{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/group-sparse-regularization-for-deep-neural","title":"Group Sparse Regularization for Deep Neural Networks","arxiv_id":"1607.00485","date":"2016-07-02","proceeding":null,"authors":["Simone Scardapane","Danilo Comminiello","Amir Hussain","Aurelio Uncini"],"abstract":"In this paper, we consider the joint task of simultaneously optimizing (i)\nthe weights of a deep neural network, (ii) the number of neurons for each\nhidden layer, and (iii) the subset of active input features (i.e., feature\nselection). While these problems are generally dealt with separately, we\npresent a simple regularized formulation allowing to solve all three of them in\nparallel, using standard optimization routines. Specifically, we extend the\ngroup Lasso penalty (originated in the linear regression literature) in order\nto impose group-level sparsity on the network's connections, where each group\nis defined as the set of outgoing weights from a unit. Depending on the\nspecific case, the weights can be related to an input variable, to a hidden\nneuron, or to a bias unit, thus performing simultaneously all the\naforementioned tasks in order to obtain a compact network. We perform an\nextensive experimental evaluation, by comparing with classical weight decay and\nLasso penalties. We show that a sparse version of the group Lasso penalty is\nable to achieve competitive performances, while at the same time resulting in\nextremely compact networks with a smaller number of input features. We evaluate\nboth on a toy dataset for handwritten digit recognition, and on multiple\nrealistic large-scale classification problems.","url_abs":"http://arxiv.org/abs/1607.00485v1","url_pdf":"http://arxiv.org/pdf/1607.00485v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"group-sparse-regularization-for-deep-neural","repo_url":"https://bitbucket.org/ispamm/group-lasso-deep-networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"handwritten-digit-recognition","task_name":"Handwritten Digit Recognition"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[{"method_slug":"linear-regression","method_name":"Linear Regression"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1607.00485","atlas_url":"https://app.syntology.ai/?focus=1607.00485","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1607.00485"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1607.00485\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1607.00485"},"call":"get_concepts_for_paper(arxiv_id=\"1607.00485\")"}],"by_repo":[{"repo":"bitbucket.org/ispamm/group-lasso-deep-networks","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2e25bd5a9e60219205d8ea0059425e419cec7732017e5877867371c0dc9ca871","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}