{"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/discrimination-aware-channel-pruning-for-deep","title":"Discrimination-aware Channel Pruning for Deep Neural Networks","arxiv_id":"1810.11809","date":"2018-10-28","proceeding":"NeurIPS 2018 12","authors":["Zhuangwei Zhuang","Mingkui Tan","Bohan Zhuang","Jing Liu","Yong Guo","Qingyao Wu","Junzhou Huang","Jinhui Zhu"],"abstract":"Channel pruning is one of the predominant approaches for deep model\ncompression. Existing pruning methods either train from scratch with sparsity\nconstraints on channels, or minimize the reconstruction error between the\npre-trained feature maps and the compressed ones. Both strategies suffer from\nsome limitations: the former kind is computationally expensive and difficult to\nconverge, whilst the latter kind optimizes the reconstruction error but ignores\nthe discriminative power of channels. To overcome these drawbacks, we\ninvestigate a simple-yet-effective method, called discrimination-aware channel\npruning, to choose those channels that really contribute to discriminative\npower. To this end, we introduce additional losses into the network to increase\nthe discriminative power of intermediate layers and then select the most\ndiscriminative channels for each layer by considering the additional loss and\nthe reconstruction error. Last, we propose a greedy algorithm to conduct\nchannel selection and parameter optimization in an iterative way. Extensive\nexperiments demonstrate the effectiveness of our method. For example, on\nILSVRC-12, our pruned ResNet-50 with 30% reduction of channels even outperforms\nthe original model by 0.39% in top-1 accuracy.","url_abs":"http://arxiv.org/abs/1810.11809v3","url_pdf":"http://arxiv.org/pdf/1810.11809v3.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":"discrimination-aware-channel-pruning-for-deep","repo_url":"https://github.com/SCUT-AILab/DCP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"model-compression","task_name":"Model Compression"},{"task_slug":"channel-selection","task_name":"channel selection"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.11809","atlas_url":"https://app.syntology.ai/?focus=1810.11809","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":"1810.11809"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.11809\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.11809"},"call":"get_concepts_for_paper(arxiv_id=\"1810.11809\")"}],"by_repo":[{"repo":"SCUT-AILab/DCP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2001.01050"],"harvested_for_calls":[{"arxiv_id":"2001.01050","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01050"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01050\")"}]}],"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":"019a795368ed23963990433f705fd7dd5d8885f28d96ac16a14cc44437433564","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}