{"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/exploiting-kernel-sparsity-and-entropy-for","title":"Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compression","arxiv_id":"1812.04368","date":"2018-12-11","proceeding":"CVPR 2019 6","authors":["Yuchao Li","Shaohui Lin","Baochang Zhang","Jianzhuang Liu","David Doermann","Yongjian Wu","Feiyue Huang","Rongrong Ji"],"abstract":"Compressing convolutional neural networks (CNNs) has received ever-increasing\nresearch focus. However, most existing CNN compression methods do not interpret\ntheir inherent structures to distinguish the implicit redundancy. In this\npaper, we investigate the problem of CNN compression from a novel interpretable\nperspective. The relationship between the input feature maps and 2D kernels is\nrevealed in a theoretical framework, based on which a kernel sparsity and\nentropy (KSE) indicator is proposed to quantitate the feature map importance in\na feature-agnostic manner to guide model compression. Kernel clustering is\nfurther conducted based on the KSE indicator to accomplish high-precision CNN\ncompression. KSE is capable of simultaneously compressing each layer in an\nefficient way, which is significantly faster compared to previous data-driven\nfeature map pruning methods. We comprehensively evaluate the compression and\nspeedup of the proposed method on CIFAR-10, SVHN and ImageNet 2012. Our method\ndemonstrates superior performance gains over previous ones. In particular, it\nachieves 4.7 \\times FLOPs reduction and 2.9 \\times compression on ResNet-50\nwith only a Top-5 accuracy drop of 0.35% on ImageNet 2012, which significantly\noutperforms state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1812.04368v2","url_pdf":"http://arxiv.org/pdf/1812.04368v2.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":"exploiting-kernel-sparsity-and-entropy-for","repo_url":"https://github.com/yuchaoli/KSE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"gone","observed_at":"2026-09-18","how":"tree_404+repo_404"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"model-compression","task_name":"Model Compression"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.04368","atlas_url":"https://app.syntology.ai/?focus=1812.04368","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":"1812.04368"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.04368\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.04368"},"call":"get_concepts_for_paper(arxiv_id=\"1812.04368\")"}],"by_repo":[{"repo":"yuchaoli/KSE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"61e3ff68c6b0ea33cf54174e87c8621d32a865a88560ec17ee0f1d8051040c34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}