{"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/rethinking-the-smaller-norm-less-informative","title":"Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers","arxiv_id":"1802.00124","date":"2018-02-01","proceeding":"ICLR 2018 1","authors":["Jianbo Ye","Xin Lu","Zhe Lin","James Z. Wang"],"abstract":"Model pruning has become a useful technique that improves the computational\nefficiency of deep learning, making it possible to deploy solutions in\nresource-limited scenarios. A widely-used practice in relevant work assumes\nthat a smaller-norm parameter or feature plays a less informative role at the\ninference time. In this paper, we propose a channel pruning technique for\naccelerating the computations of deep convolutional neural networks (CNNs) that\ndoes not critically rely on this assumption. Instead, it focuses on direct\nsimplification of the channel-to-channel computation graph of a CNN without the\nneed of performing a computationally difficult and not-always-useful task of\nmaking high-dimensional tensors of CNN structured sparse. Our approach takes\ntwo stages: first to adopt an end-to- end stochastic training method that\neventually forces the outputs of some channels to be constant, and then to\nprune those constant channels from the original neural network by adjusting the\nbiases of their impacting layers such that the resulting compact model can be\nquickly fine-tuned. Our approach is mathematically appealing from an\noptimization perspective and easy to reproduce. We experimented our approach\nthrough several image learning benchmarks and demonstrate its interesting\naspects and competitive performance.","url_abs":"http://arxiv.org/abs/1802.00124v2","url_pdf":"http://arxiv.org/pdf/1802.00124v2.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":"rethinking-the-smaller-norm-less-informative","repo_url":"https://github.com/bobye/batchnorm_prune","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"rethinking-the-smaller-norm-less-informative","repo_url":"https://github.com/chumingqian/Model_Compression_For_YOLOV3-V4","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"rethinking-the-smaller-norm-less-informative","repo_url":"https://github.com/jack-willturner/batchnorm-pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.00124","atlas_url":"https://app.syntology.ai/?focus=1802.00124","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":"1802.00124"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.00124\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.00124"},"call":"get_concepts_for_paper(arxiv_id=\"1802.00124\")"}],"by_repo":[{"repo":"bobye/batchnorm_prune","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"chumingqian/Model_Compression_For_YOLOV3-V4","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1503.02531"],"harvested_for_calls":[{"arxiv_id":"1503.02531","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1503.02531"},"call":"get_harvested_code_for_paper(arxiv_id=\"1503.02531\")"}]},{"repo":"jack-willturner/batchnorm-pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"8eb2e6bb1da49bbbd3e27e56d45d51f4ddae159a6547884b1854e8c08ce83cc7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}