{"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/a-framework-for-fast-and-efficient-neural","title":"Efficient Neural Network Compression","arxiv_id":"1811.12781","date":"2018-11-30","proceeding":"CVPR 2019 6","authors":["Hyeji Kim","Muhammad Umar Karim Khan","Chong-Min Kyung"],"abstract":"Network compression reduces the computational complexity and memory\nconsumption of deep neural networks by reducing the number of parameters. In\nSVD-based network compression, the right rank needs to be decided for every\nlayer of the network. In this paper, we propose an efficient method for\nobtaining the rank configuration of the whole network. Unlike previous methods\nwhich consider each layer separately, our method considers the whole network to\nchoose the right rank configuration. We propose novel accuracy metrics to\nrepresent the accuracy and complexity relationship for a given neural network.\nWe use these metrics in a non-iterative fashion to obtain the right rank\nconfiguration which satisfies the constraints on FLOPs and memory while\nmaintaining sufficient accuracy. Experiments show that our method provides\nbetter compromise between accuracy and computational complexity/memory\nconsumption while performing compression at much higher speed. For VGG-16 our\nnetwork can reduce the FLOPs by 25% and improve accuracy by 0.7% compared to\nthe baseline, while requiring only 3 minutes on a CPU to search for the right\nrank configuration. Previously, similar results were achieved in 4 hours with 8\nGPUs. The proposed method can be used for lossless compression of a neural\nnetwork as well. The better accuracy and complexity compromise, as well as the\nextremely fast speed of our method makes it suitable for neural network\ncompression.","url_abs":"http://arxiv.org/abs/1811.12781v3","url_pdf":"http://arxiv.org/pdf/1811.12781v3.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":"a-framework-for-fast-and-efficient-neural","repo_url":"https://github.com/Hyeji-Kim/ENC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"caffe2","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"efficient-neural-network","task_name":"Efficient Neural Network"},{"task_slug":"neural-network-compression","task_name":"Neural Network Compression"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Hyeji-Kim/ENC","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":"91b09de81da8aaf194e1eaa9f66327a4f7d68f474903e75546fad9d56891e5c6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}