{"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/soft-filter-pruning-for-accelerating-deep","title":"Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks","arxiv_id":"1808.06866","date":"2018-08-21","proceeding":null,"authors":["Yang He","Guoliang Kang","Xuanyi Dong","Yanwei Fu","Yi Yang"],"abstract":"This paper proposed a Soft Filter Pruning (SFP) method to accelerate the\ninference procedure of deep Convolutional Neural Networks (CNNs). Specifically,\nthe proposed SFP enables the pruned filters to be updated when training the\nmodel after pruning. SFP has two advantages over previous works: (1) Larger\nmodel capacity. Updating previously pruned filters provides our approach with\nlarger optimization space than fixing the filters to zero. Therefore, the\nnetwork trained by our method has a larger model capacity to learn from the\ntraining data. (2) Less dependence on the pre-trained model. Large capacity\nenables SFP to train from scratch and prune the model simultaneously. In\ncontrast, previous filter pruning methods should be conducted on the basis of\nthe pre-trained model to guarantee their performance. Empirically, SFP from\nscratch outperforms the previous filter pruning methods. Moreover, our approach\nhas been demonstrated effective for many advanced CNN architectures. Notably,\non ILSCRC-2012, SFP reduces more than 42% FLOPs on ResNet-101 with even 0.2%\ntop-5 accuracy improvement, which has advanced the state-of-the-art. Code is\npublicly available on GitHub: https://github.com/he-y/soft-filter-pruning","url_abs":"http://arxiv.org/abs/1808.06866v1","url_pdf":"http://arxiv.org/pdf/1808.06866v1.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":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/he-y/soft-filter-pruning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/AlumLuther/PruningFilters","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/EkdeepSLubana/OrthoReg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/Gideon0805/Tensorflow1.15-Model-Pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/Gideon0805/Tensorflow_Model_Pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"soft-filter-pruning-for-accelerating-deep","repo_url":"https://github.com/arturjordao/PruningNeuralNetworks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.06866","atlas_url":"https://app.syntology.ai/?focus=1808.06866","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":"1808.06866"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.06866\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.06866"},"call":"get_concepts_for_paper(arxiv_id=\"1808.06866\")"}],"by_repo":[{"repo":"he-y/soft-filter-pruning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"AlumLuther/PruningFilters","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"EkdeepSLubana/OrthoReg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1801.05787"],"harvested_for_calls":[{"arxiv_id":"1801.05787","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1801.05787"},"call":"get_harvested_code_for_paper(arxiv_id=\"1801.05787\")"}]},{"repo":"Gideon0805/Tensorflow1.15-Model-Pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1801.04381"],"harvested_for_calls":[{"arxiv_id":"1801.04381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1801.04381"},"call":"get_harvested_code_for_paper(arxiv_id=\"1801.04381\")"}]},{"repo":"Gideon0805/Tensorflow_Model_Pruning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"arturjordao/PruningNeuralNetworks","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":"12c1b213e6e7730bfab7b5116072eb8210c8a155c92e2da4219ccd626b3d8282","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}