{"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/layer-compensated-pruning-for-resource","title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","arxiv_id":"1810.00518","date":"2018-10-01","proceeding":null,"authors":["Ting-Wu Chin","Cha Zhang","Diana Marculescu"],"abstract":"Resource-efficient convolution neural networks enable not only the\nintelligence on edge devices but also opportunities in system-level\noptimization such as scheduling. In this work, we aim to improve the\nperformance of resource-constrained filter pruning by merging two sub-problems\ncommonly considered, i.e., (i) how many filters to prune for each layer and\n(ii) which filters to prune given a per-layer pruning budget, into a global\nfilter ranking problem. Our framework entails a novel algorithm, dubbed\nlayer-compensated pruning, where meta-learning is involved to determine better\nsolutions. We show empirically that the proposed algorithm is superior to prior\nart in both effectiveness and efficiency. Specifically, we reduce the accuracy\ngap between the pruned and original networks from 0.9% to 0.7% with 8x\nreduction in time needed for meta-learning, i.e., from 1 hour down to 7\nminutes. To this end, we demonstrate the effectiveness of our algorithm using\nResNet and MobileNetV2 networks under CIFAR-10, ImageNet, and Bird-200\ndatasets.","url_abs":"http://arxiv.org/abs/1810.00518v2","url_pdf":"http://arxiv.org/pdf/1810.00518v2.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":"layer-compensated-pruning-for-resource","repo_url":"https://github.com/cmu-enyac/LeGR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"scheduling","task_name":"Scheduling"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"depthwise-convolution","method_name":"Depthwise Convolution"},{"method_slug":"depthwise-separable-convolution","method_name":"Depthwise Separable Convolution"},{"method_slug":"inverted-residual-block","method_name":"Inverted Residual Block"},{"method_slug":"pointwise-convolution","method_name":"Pointwise Convolution"},{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.00518","atlas_url":"https://app.syntology.ai/?focus=1810.00518","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.00518"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.00518\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.00518"},"call":"get_concepts_for_paper(arxiv_id=\"1810.00518\")"}],"by_repo":[{"repo":"cmu-enyac/LeGR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.12368"],"harvested_for_calls":[{"arxiv_id":"1904.12368","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.12368"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.12368\")"}]}],"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":"93a3a89a9cab879e0ac13e81c2c017234a40eb7d130c374862613cd6a38755c9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}