{"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/learning-efficient-convolutional-networks","title":"Learning Efficient Convolutional Networks through Network Slimming","arxiv_id":"1708.06519","date":"2017-08-22","proceeding":"ICCV 2017 10","authors":["Zhuang Liu","Jianguo Li","Zhiqiang Shen","Gao Huang","Shoumeng Yan","Chang-Shui Zhang"],"abstract":"The deployment of deep convolutional neural networks (CNNs) in many real\nworld applications is largely hindered by their high computational cost. In\nthis paper, we propose a novel learning scheme for CNNs to simultaneously 1)\nreduce the model size; 2) decrease the run-time memory footprint; and 3) lower\nthe number of computing operations, without compromising accuracy. This is\nachieved by enforcing channel-level sparsity in the network in a simple but\neffective way. Different from many existing approaches, the proposed method\ndirectly applies to modern CNN architectures, introduces minimum overhead to\nthe training process, and requires no special software/hardware accelerators\nfor the resulting models. We call our approach network slimming, which takes\nwide and large networks as input models, but during training insignificant\nchannels are automatically identified and pruned afterwards, yielding thin and\ncompact models with comparable accuracy. We empirically demonstrate the\neffectiveness of our approach with several state-of-the-art CNN models,\nincluding VGGNet, ResNet and DenseNet, on various image classification\ndatasets. For VGGNet, a multi-pass version of network slimming gives a 20x\nreduction in model size and a 5x reduction in computing operations.","url_abs":"http://arxiv.org/abs/1708.06519v1","url_pdf":"http://arxiv.org/pdf/1708.06519v1.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":"learning-efficient-convolutional-networks","repo_url":"https://github.com/liuzhuang13/slimming","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/Eric-mingjie/network-slimming","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/DDGRCF/yolov5_Chinese","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/DDGRCF/yolov5_pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/EstherBear/implementation-of-network-slimming","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/VainF/Torch-Pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/ZJCV/NetworkSlimming","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","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":"learning-efficient-convolutional-networks","repo_url":"https://github.com/midasklr/yolov5prune","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/mvpzhangqiu/yolov5prune","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/polarizationpruning/PolarizationPruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"learning-efficient-convolutional-networks","repo_url":"https://github.com/alibaba/esim-response-selection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"architecture-search","task_name":"Neural Architecture Search"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-block","method_name":"Dense Block"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.06519","atlas_url":"https://app.syntology.ai/?focus=1708.06519","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":"1708.06519"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.06519\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.06519"},"call":"get_concepts_for_paper(arxiv_id=\"1708.06519\")"}],"by_repo":[{"repo":"liuzhuang13/slimming","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Eric-mingjie/network-slimming","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"DDGRCF/yolov5_Chinese","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"DDGRCF/yolov5_pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"EstherBear/implementation-of-network-slimming","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"VainF/Torch-Pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2301.12900"],"harvested_for_calls":[{"arxiv_id":"2301.12900","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.12900"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.12900\")"}]},{"repo":"ZJCV/NetworkSlimming","kind":"listed","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":"midasklr/yolov5prune","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1608.08710"],"harvested_for_calls":[{"arxiv_id":"1608.08710","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1608.08710"},"call":"get_harvested_code_for_paper(arxiv_id=\"1608.08710\")"}]},{"repo":"mvpzhangqiu/yolov5prune","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1608.08710"],"harvested_for_calls":[{"arxiv_id":"1608.08710","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1608.08710"},"call":"get_harvested_code_for_paper(arxiv_id=\"1608.08710\")"}]},{"repo":"polarizationpruning/PolarizationPruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alibaba/esim-response-selection","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":"7f732180f9731c15fbc2b6ff144f5567a9892d70b1cd95347ae8614bd886c101","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}