{"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/lossless-cnn-channel-pruning-via-gradient","title":"ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgetting","arxiv_id":"2007.03260","date":"2020-07-07","proceeding":"ICCV 2021 10","authors":["Xiaohan Ding","Tianxiang Hao","Jianchao Tan","Ji Liu","Jungong Han","Yuchen Guo","Guiguang Ding"],"abstract":"We propose ResRep, a novel method for lossless channel pruning (a.k.a. filter pruning), which slims down a CNN by reducing the width (number of output channels) of convolutional layers. Inspired by the neurobiology research about the independence of remembering and forgetting, we propose to re-parameterize a CNN into the remembering parts and forgetting parts, where the former learn to maintain the performance and the latter learn to prune. Via training with regular SGD on the former but a novel update rule with penalty gradients on the latter, we realize structured sparsity. Then we equivalently merge the remembering and forgetting parts into the original architecture with narrower layers. In this sense, ResRep can be viewed as a successful application of Structural Re-parameterization. Such a methodology distinguishes ResRep from the traditional learning-based pruning paradigm that applies a penalty on parameters to produce sparsity, which may suppress the parameters essential for the remembering. ResRep slims down a standard ResNet-50 with 76.15% accuracy on ImageNet to a narrower one with only 45% FLOPs and no accuracy drop, which is the first to achieve lossless pruning with such a high compression ratio. The code and models are at https://github.com/DingXiaoH/ResRep.","url_abs":"https://arxiv.org/abs/2007.03260v4","url_pdf":"https://arxiv.org/pdf/2007.03260v4.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":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/DingXiaoH/ResRep","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/DingXiaoH/DiverseBranchBlock","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/DingXiaoH/GSM-SGD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/DingXiaoH/RepMLP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/ShawnDing1994/AOFP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"lossless-cnn-channel-pruning-via-gradient","repo_url":"https://github.com/xdhe1216/ResRep","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"},{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.03260","atlas_url":"https://app.syntology.ai/?focus=2007.03260","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":"2007.03260"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2007.03260\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2007.03260"},"call":"get_concepts_for_paper(arxiv_id=\"2007.03260\")"}],"by_repo":[{"repo":"DingXiaoH/ResRep","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.01883"],"harvested_for_calls":[{"arxiv_id":"2105.01883","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01883"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01883\")"}]},{"repo":"DingXiaoH/DiverseBranchBlock","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.13425"],"harvested_for_calls":[{"arxiv_id":"2103.13425","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.13425"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.13425\")"}]},{"repo":"DingXiaoH/GSM-SGD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.01883"],"harvested_for_calls":[{"arxiv_id":"2105.01883","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01883"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01883\")"}]},{"repo":"DingXiaoH/RepMLP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.01883"],"harvested_for_calls":[{"arxiv_id":"2105.01883","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01883"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01883\")"}]},{"repo":"ShawnDing1994/AOFP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xdhe1216/ResRep","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":"efe4bbe47cbf9ba8d47f56587f9280b13b8344fb31bd8b06b99a49405bbf6bd2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}