{"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":"/task/network-pruning/papers/3","list_of":"/task/network-pruning","task":"Network Pruning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":6,"rows_per_page":100,"rows":[201,300],"of":534,"counts":{"archive_papers_tagged":534,"with_a_code_link":239,"where_syntology_ran_a_sample":83,"not_listed_spam_title":0,"listed":534,"listed_where_code_ran":83,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":65,"every_run_a_failure_of_syntologys_instrument":18,"listed_with_a_run_with_no_instrument_failure":65,"listed_every_run_a_failure_of_syntologys_instrument":18,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/network-pruning","prev":"/task/network-pruning/papers/2","next":"/task/network-pruning/papers/4","papers":[{"url":"/paper/l-co-net-learned-condensation-optimization","slug":"l-co-net-learned-condensation-optimization","title":"L-CO-Net: Learned Condensation-Optimization Network for Clinical Parameter Estimation from Cardiac Cine MRI","date":"2020-04-21","arxiv_id":"2004.11253","repositories_listed":1,"syntology":null},{"url":"/paper/network-adjustment-channel-search-guided-by","slug":"network-adjustment-channel-search-guided-by","title":"Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio","date":"2020-04-06","arxiv_id":"2004.02767","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/network-adjustment-channel-search-guided-by#ran","syntology_url":"https://syntology.ai/paper/2004.02767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02767"}},"official":{"repos":["danczs/NetworkAdjustment"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-not-to-give-a-flop-combining","slug":"how-not-to-give-a-flop-combining","title":"How Not to Give a FLOP: Combining Regularization and Pruning for Efficient Inference","date":"2020-03-30","arxiv_id":"2003.13593","repositories_listed":1,"syntology":null},{"url":"/paper/what-is-the-state-of-neural-network-pruning","slug":"what-is-the-state-of-neural-network-pruning","title":"What is the State of Neural Network Pruning?","date":"2020-03-06","arxiv_id":"2003.03033","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-is-the-state-of-neural-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2003.03033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03033"}},"official":{"repos":["jjgo/shrinkbench"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/good-subnetworks-provably-exist-pruning-via","slug":"good-subnetworks-provably-exist-pruning-via","title":"Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection","date":"2020-03-03","arxiv_id":"2003.01794","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/good-subnetworks-provably-exist-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2003.01794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01794"}},"official":{"repos":["lushleaf/Network-Pruning-Greedy-Forward-Selection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knapsack-pruning-with-inner-distillation","slug":"knapsack-pruning-with-inner-distillation","title":"Knapsack Pruning with Inner Distillation","date":"2020-02-19","arxiv_id":"2002.08258","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knapsack-pruning-with-inner-distillation#ran","syntology_url":"https://syntology.ai/paper/2002.08258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08258"}},"official":{"repos":["yoniaflalo/knapsack_pruning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-agnostic-structured-sparsification-with","slug":"model-agnostic-structured-sparsification-with","title":"Structured Sparsification with Joint Optimization of Group Convolution and Channel Shuffle","date":"2020-02-19","arxiv_id":"2002.08127","repositories_listed":1,"syntology":null},{"url":"/paper/soft-threshold-weight-reparameterization-for","slug":"soft-threshold-weight-reparameterization-for","title":"Soft Threshold Weight Reparameterization for Learnable Sparsity","date":"2020-02-08","arxiv_id":"2002.03231","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/soft-threshold-weight-reparameterization-for#ran","syntology_url":"https://syntology.ai/paper/2002.03231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03231"}},"official":{"repos":["RAIVNLab/STR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/filter-sketch-for-network-pruning","slug":"filter-sketch-for-network-pruning","title":"Filter Sketch for Network Pruning","date":"2020-01-23","arxiv_id":"2001.08514","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/filter-sketch-for-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2001.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08514"}},"official":{"repos":["lmbxmu/FilterSketch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/quantisation-and-pruning-for-neural-network","slug":"quantisation-and-pruning-for-neural-network","title":"Quantisation and Pruning for Neural Network Compression and Regularisation","date":"2020-01-14","arxiv_id":"2001.04850","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-weight-activation-training-1","slug":"sparse-weight-activation-training-1","title":"Sparse Weight Activation Training","date":"2020-01-07","arxiv_id":"2001.01969","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-weight-activation-training-1#ran","syntology_url":"https://syntology.ai/paper/2001.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01969"}},"official":{"repos":["AamirRaihan/SWAT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/discrimination-aware-network-pruning-for-deep","slug":"discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","arxiv_id":"2001.01050","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/discrimination-aware-network-pruning-for-deep#ran","syntology_url":"https://syntology.ai/paper/2001.01050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01050"}},"official":{"repos":["SCUT-AILab/DCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-by-explaining-a-novel-criterion-for","slug":"pruning-by-explaining-a-novel-criterion-for","title":"Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruning","date":"2019-12-18","arxiv_id":"1912.08881","repositories_listed":1,"syntology":null},{"url":"/paper/the-search-for-sparse-robust-neural-networks","slug":"the-search-for-sparse-robust-neural-networks","title":"The Search for Sparse, Robust Neural Networks","date":"2019-12-05","arxiv_id":"1912.02386","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-search-for-sparse-robust-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1912.02386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02386"}},"official":{"repos":["justincosentino/robust-sparse-networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/quantum-inspired-hamiltonian-monte-carlo-for","slug":"quantum-inspired-hamiltonian-monte-carlo-for","title":"Quantum-Inspired Hamiltonian Monte Carlo for Bayesian Sampling","date":"2019-12-04","arxiv_id":"1912.01937","repositories_listed":1,"syntology":null},{"url":"/paper/autoprune-automatic-network-pruning-by","slug":"autoprune-automatic-network-pruning-by","title":"AutoPrune: Automatic Network Pruning by Regularizing Auxiliary Parameters","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-pruning-with-residual","slug":"neural-network-pruning-with-residual","title":"Neural Network Pruning with Residual-Connections and Limited-Data","date":"2019-11-19","arxiv_id":"1911.08114","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-network-pruning-with-residual#ran","syntology_url":"https://syntology.ai/paper/1911.08114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08114"}},"official":null}},{"url":"/paper/pruning-from-scratch","slug":"pruning-from-scratch","title":"Pruning from Scratch","date":"2019-09-27","arxiv_id":"1909.12579","repositories_listed":1,"syntology":null},{"url":"/paper/190910364","slug":"190910364","title":"Class-dependent Compression of Deep Neural Networks","date":"2019-09-23","arxiv_id":"1909.10364","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190910364#ran","syntology_url":"https://syntology.ai/paper/1909.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10364"}},"official":{"repos":["rahimentezari/Sensys-ml2020"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-signal-propagation-perspective-for-pruning","slug":"a-signal-propagation-perspective-for-pruning","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","date":"2019-06-14","arxiv_id":"1906.06307","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-signal-propagation-perspective-for-pruning#ran","syntology_url":"https://syntology.ai/paper/1906.06307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06307"}},"official":{"repos":["namhoonlee/spp-public"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/eigendamage-structured-pruning-in-the","slug":"eigendamage-structured-pruning-in-the","title":"EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis","date":"2019-05-15","arxiv_id":"1905.05934","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/eigendamage-structured-pruning-in-the#ran","syntology_url":"https://syntology.ai/paper/1905.05934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05934"}},"official":{"repos":["alecwangcq/EigenDamage-Pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/progressive-stochastic-binarization-of-deep","slug":"progressive-stochastic-binarization-of-deep","title":"Progressive Stochastic Binarization of Deep Networks","date":"2019-04-03","arxiv_id":"1904.02205","repositories_listed":1,"syntology":null},{"url":"/paper/second-rethinking-of-network-pruning-in-the","slug":"second-rethinking-of-network-pruning-in-the","title":"Adversarial Robustness vs Model Compression, or Both?","date":"2019-03-29","arxiv_id":"1903.12561","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/second-rethinking-of-network-pruning-in-the#ran","syntology_url":"https://syntology.ai/paper/1903.12561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12561"}},"official":{"repos":["yeshaokai/Robustness-Aware-Pruning-ADMM"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fastdepth-fast-monocular-depth-estimation-on","slug":"fastdepth-fast-monocular-depth-estimation-on","title":"FastDepth: Fast Monocular Depth Estimation on Embedded Systems","date":"2019-03-08","arxiv_id":"1903.03273","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fastdepth-fast-monocular-depth-estimation-on#ran","syntology_url":"https://syntology.ai/paper/1903.03273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03273"}},"official":null}},{"url":"/paper/same-same-but-different-recovering-neural","slug":"same-same-but-different-recovering-neural","title":"Same, Same But Different - Recovering Neural Network Quantization Error Through Weight Factorization","date":"2019-02-05","arxiv_id":"1902.01917","repositories_listed":1,"syntology":null},{"url":"/paper/deepsz-a-novel-framework-to-compress-deep","slug":"deepsz-a-novel-framework-to-compress-deep","title":"DeepSZ: A Novel Framework to Compress Deep Neural Networks by Using Error-Bounded Lossy Compression","date":"2019-01-26","arxiv_id":"1901.09124","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-distillation-from-few-samples","slug":"knowledge-distillation-from-few-samples","title":"Few Sample Knowledge Distillation for Efficient Network Compression","date":"2018-12-05","arxiv_id":"1812.01839","repositories_listed":1,"syntology":null},{"url":"/paper/neural-rejuvenation-improving-deep-network","slug":"neural-rejuvenation-improving-deep-network","title":"Neural Rejuvenation: Improving Deep Network Training by Enhancing Computational Resource Utilization","date":"2018-12-02","arxiv_id":"1812.00481","repositories_listed":1,"syntology":null},{"url":"/paper/learning-grouped-convolution-for-efficient","slug":"learning-grouped-convolution-for-efficient","title":"Efficient Structured Pruning and Architecture Searching for Group Convolution","date":"2018-11-23","arxiv_id":"1811.09341","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-convolutional-kernels-to-compress","slug":"clustering-convolutional-kernels-to-compress","title":"Clustering Convolutional Kernels to Compress Deep Neural Networks","date":"2018-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-device-neural-language-model-based-word","slug":"on-device-neural-language-model-based-word","title":"On-Device Neural Language Model Based Word Prediction","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-convex-pruning-of-deep-neural-networks","slug":"fast-convex-pruning-of-deep-neural-networks","title":"Fast Convex Pruning of Deep Neural Networks","date":"2018-06-17","arxiv_id":"1806.06457","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/fast-convex-pruning-of-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.06457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.06457"}},"official":null}},{"url":"/paper/alearning-compressiona-algorithms-for-neural","slug":"alearning-compressiona-algorithms-for-neural","title":"“Learning-Compression” Algorithms for Neural Net Pruning","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/channel-gating-neural-networks","slug":"channel-gating-neural-networks","title":"Channel Gating Neural Networks","date":"2018-05-29","arxiv_id":"1805.12549","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/channel-gating-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1805.12549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.12549"}},"official":null}},{"url":"/paper/structured-deep-neural-network-pruning-by","slug":"structured-deep-neural-network-pruning-by","title":"Structured Pruning for Efficient ConvNets via Incremental Regularization","date":"2018-04-25","arxiv_id":"1804.09461","repositories_listed":1,"syntology":null},{"url":"/paper/a-quantization-friendly-separable-convolution","slug":"a-quantization-friendly-separable-convolution","title":"A Quantization-Friendly Separable Convolution for MobileNets","date":"2018-03-22","arxiv_id":"1803.08607","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-sparse-winograd-convolutional","slug":"efficient-sparse-winograd-convolutional","title":"Efficient Sparse-Winograd Convolutional Neural Networks","date":"2018-02-18","arxiv_id":"1802.06367","repositories_listed":1,"syntology":null},{"url":"/paper/attention-based-guided-structured-sparsity-of","slug":"attention-based-guided-structured-sparsity-of","title":"Attention-Based Guided Structured Sparsity of Deep Neural Networks","date":"2018-02-13","arxiv_id":"1802.09902","repositories_listed":1,"syntology":null},{"url":"/paper/structured-pruning-of-deep-convolutional","slug":"structured-pruning-of-deep-convolutional","title":"Structured Pruning of Deep Convolutional Neural Networks","date":"2015-12-29","arxiv_id":"1512.08571","repositories_listed":1,"syntology":null},{"url":null,"slug":"hyperpruning-efficient-search-through-pruned","title":"Hyperpruning: Efficient Search through Pruned Variants of Recurrent Neural Networks Leveraging Lyapunov Spectrum","date":"2025-06-09","arxiv_id":"2506.07975","repositories_listed":0,"syntology":null},{"url":null,"slug":"tsenor-highly-efficient-algorithm-for-finding","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","date":"2025-05-29","arxiv_id":"2505.23949","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-lstm-based-multi-agent-drl-with","title":"Bi-LSTM based Multi-Agent DRL with Computation-aware Pruning for Agent Twins Migration in Vehicular Embodied AI Networks","date":"2025-05-09","arxiv_id":"2505.06378","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-over-trained-and-sparse-neural","title":"Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate","date":"2025-05-04","arxiv_id":"2505.01985","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperflows-pruning-reveals-the-importance-of","title":"Hyperflows: Pruning Reveals the Importance of Weights","date":"2025-04-06","arxiv_id":"2504.05349","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-constant-meets-condition-number","title":"Lipschitz Constant Meets Condition Number: Learning Robust and Compact Deep Neural Networks","date":"2025-03-26","arxiv_id":"2503.20454","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-redundancy-pruning-a-principle-driven","title":"Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMs","date":"2025-03-24","arxiv_id":"2503.18377","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-stable-subnetworks-at-initialization","title":"Finding Stable Subnetworks at Initialization with Dataset Distillation","date":"2025-03-23","arxiv_id":"2503.17905","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-actor-critic-with-harmonic","title":"Multi-Agent Actor-Critic with Harmonic Annealing Pruning for Dynamic Spectrum Access Systems","date":"2025-03-19","arxiv_id":"2503.15172","repositories_listed":0,"syntology":null},{"url":null,"slug":"ntp-int-network-traffic-prediction-driven-in","title":"NTP-INT: Network Traffic Prediction-Driven In-band Network Telemetry for High-load Switches","date":"2025-02-18","arxiv_id":"2502.12834","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-collapse-in-one-shot-pruning-when","title":"Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations","date":"2025-02-18","arxiv_id":"2502.15790","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-row-based-sparse-fine-tuning","title":"An Efficient Row-Based Sparse Fine-Tuning","date":"2025-02-17","arxiv_id":"2502.11439","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-pruning-via-structured-lasso-with","title":"Automatic Pruning via Structured Lasso with Class-wise Information","date":"2025-02-13","arxiv_id":"2502.09125","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-neural-network-pruning-with","title":"Exploring Neural Network Pruning with Screening Methods","date":"2025-02-11","arxiv_id":"2502.07189","repositories_listed":0,"syntology":null},{"url":null,"slug":"b-fpgm-lightweight-face-detection-via","title":"B-FPGM: Lightweight Face Detection via Bayesian-Optimized Soft FPGM Pruning","date":"2025-01-28","arxiv_id":"2501.16917","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-iterative-pruning-of-large-language","title":"Scalable iterative pruning of large language and vision models using block coordinate descent","date":"2024-11-26","arxiv_id":"2411.17796","repositories_listed":0,"syntology":null},{"url":null,"slug":"adapting-the-biological-ssvep-response-to","title":"Adapting the Biological SSVEP Response to Artificial Neural Networks","date":"2024-11-15","arxiv_id":"2411.10084","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-aware-training-of-deep-neural","title":"Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery","date":"2024-11-14","arxiv_id":"2411.09127","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-information-preserving-neural-network","title":"Mutual Information Preserving Neural Network Pruning","date":"2024-10-31","arxiv_id":"2411.00147","repositories_listed":0,"syntology":null},{"url":null,"slug":"small-contributions-small-networks-efficient","title":"Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance","date":"2024-10-21","arxiv_id":"2410.16151","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multi-object-tracking-on-edge","title":"Efficient Multi-Object Tracking on Edge Devices via Reconstruction-Based Channel Pruning","date":"2024-10-11","arxiv_id":"2410.08769","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-federated-learning-for-3","title":"Personalized Federated Learning for Generative AI-Assisted Semantic Communications","date":"2024-10-03","arxiv_id":"2410.02450","repositories_listed":0,"syntology":null},{"url":null,"slug":"aggressive-post-training-compression-on","title":"Aggressive Post-Training Compression on Extremely Large Language Models","date":"2024-09-30","arxiv_id":"2409.20094","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-greedy-hierarchical-approach-to-whole","title":"A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs","date":"2024-08-22","arxiv_id":"2409.03777","repositories_listed":0,"syntology":null},{"url":null,"slug":"confident-magnitude-based-neural-network","title":"Confident magnitude-based neural network pruning","date":"2024-08-08","arxiv_id":"2408.04759","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-efficient-training-of-llms-with-larger","title":"Mini-batch Coresets for Memory-efficient Training of Large Language Models","date":"2024-07-28","arxiv_id":"2407.19580","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-study-on-performance-evaluation","title":"Comprehensive Study on Performance Evaluation and Optimization of Model Compression: Bridging Traditional Deep Learning and Large Language Models","date":"2024-07-22","arxiv_id":"2407.15904","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-00794","title":"CCSRP: Robust Pruning of Spiking Neural Networks through Cooperative Coevolution","date":"2024-07-18","arxiv_id":"2408.00794","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-lightweight-graph-neural-network","title":"Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsification","date":"2024-06-24","arxiv_id":"2406.16357","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-task-specific-subnetworks-in-multi","title":"Finding Task-specific Subnetworks in Multi-task Spoken Language Understanding Model","date":"2024-06-18","arxiv_id":"2406.12317","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-based-structural-pruning-for","title":"Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient","date":"2024-06-15","arxiv_id":"2406.10576","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-subset-selection-through-the-lens","title":"Effective Subset Selection Through The Lens of Neural Network Pruning","date":"2024-06-03","arxiv_id":"2406.01086","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-deep-spiking-neural","title":"Towards Efficient Deep Spiking Neural Networks Construction with Spiking Activity based Pruning","date":"2024-06-03","arxiv_id":"2406.01072","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-network-pruning-a-comparative-study-on","title":"Deep Network Pruning: A Comparative Study on CNNs in Face Recognition","date":"2024-05-28","arxiv_id":"2405.18302","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-metrics-pruning-and-generalization","title":"A rescaling-invariant Lipschitz bound based on path-metrics for modern ReLU network parameterizations","date":"2024-05-23","arxiv_id":"2405.15006","repositories_listed":0,"syntology":null},{"url":null,"slug":"dependency-aware-semi-structured-sparsity-of","title":"Dependency-Aware Semi-Structured Sparsity of GLU Variants in Large Language Models","date":"2024-05-03","arxiv_id":"2405.01943","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedp3-federated-personalized-and-privacy","title":"FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity","date":"2024-04-15","arxiv_id":"2404.09816","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-distilled-and","title":"Adversarial Robustness of Distilled and Pruned Deep Learning-based Wireless Classifiers","date":"2024-04-11","arxiv_id":"2404.15344","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedmef-towards-memory-efficient-federated","title":"FedMef: Towards Memory-efficient Federated Dynamic Pruning","date":"2024-03-21","arxiv_id":"2403.14737","repositories_listed":0,"syntology":null},{"url":null,"slug":"lnpt-label-free-network-pruning-and-training","title":"LNPT: Label-free Network Pruning and Training","date":"2024-03-19","arxiv_id":"2403.12690","repositories_listed":0,"syntology":null},{"url":null,"slug":"structurally-prune-anything-any-architecture","title":"Structurally Prune Anything: Any Architecture, Any Framework, Any Time","date":"2024-03-03","arxiv_id":"2403.18955","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequentialattention-for-block-sparsification","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","date":"2024-02-27","arxiv_id":"2402.17902","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-adversarial-unlearning","title":"Discriminative Adversarial Unlearning","date":"2024-02-10","arxiv_id":"2402.06864","repositories_listed":0,"syntology":null},{"url":null,"slug":"epsd-early-pruning-with-self-distillation-for","title":"EPSD: Early Pruning with Self-Distillation for Efficient Model Compression","date":"2024-01-31","arxiv_id":"2402.00084","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-scalability-in-recommender-systems","title":"Enhancing Scalability in Recommender Systems through Lottery Ticket Hypothesis and Knowledge Distillation-based Neural Network Pruning","date":"2024-01-19","arxiv_id":"2401.10484","repositories_listed":0,"syntology":null},{"url":null,"slug":"three-ways-that-non-differentiability-affects","title":"GD doesn't make the cut: Three ways that non-differentiability affects neural network training","date":"2024-01-16","arxiv_id":"2401.08426","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-pruning-for-enhanced-efficiency-in","title":"Block Pruning for Enhanced Efficiency in Convolutional Neural Networks","date":"2023-12-28","arxiv_id":"2312.16904","repositories_listed":0,"syntology":null},{"url":null,"slug":"picking-the-underused-heads-a-network-pruning","title":"Picking the Underused Heads: A Network Pruning Perspective of Attention Head Selection for Fusing Dialogue Coreference Information","date":"2023-12-15","arxiv_id":"2312.09541","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-architecture-codesign-for-fast-bragg","title":"Neural Architecture Codesign for Fast Bragg Peak Analysis","date":"2023-12-10","arxiv_id":"2312.05978","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-convolutional-neural-network","title":"Accelerating Convolutional Neural Network Pruning via Spatial Aura Entropy","date":"2023-12-08","arxiv_id":"2312.04926","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-network-pruning-pipeline-with","title":"An End-to-End Network Pruning Pipeline with Sparsity Enforcement","date":"2023-12-04","arxiv_id":"2312.01653","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-reinforced-knowledge-distillation","title":"Robustness-Reinforced Knowledge Distillation with Correlation Distance and Network Pruning","date":"2023-11-23","arxiv_id":"2311.13934","repositories_listed":0,"syntology":null},{"url":null,"slug":"mechanistically-analyzing-the-effects-of-fine","title":"Mechanistically analyzing the effects of fine-tuning on procedurally defined tasks","date":"2023-11-21","arxiv_id":"2311.12786","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentations-in-deep-weight-spaces","title":"Data Augmentations in Deep Weight Spaces","date":"2023-11-15","arxiv_id":"2311.08851","repositories_listed":0,"syntology":null},{"url":null,"slug":"brain-inspired-efficient-pruning-exploiting","title":"Brain-Inspired Efficient Pruning: Exploiting Criticality in Spiking Neural Networks","date":"2023-11-05","arxiv_id":"2311.16141","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-estimation-with-random-gradient","title":"Importance Estimation with Random Gradient for Neural Network Pruning","date":"2023-10-31","arxiv_id":"2310.20203","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsebytenn-a-novel-mobile-inference","title":"SparseByteNN: A Novel Mobile Inference Acceleration Framework Based on Fine-Grained Group Sparsity","date":"2023-10-30","arxiv_id":"2310.19509","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-mode-connectivity-in-sparse-neural","title":"Linear Mode Connectivity in Sparse Neural Networks","date":"2023-10-28","arxiv_id":"2310.18769","repositories_listed":0,"syntology":null},{"url":null,"slug":"graft-gradual-fusion-transformer-for","title":"GraFT: Gradual Fusion Transformer for Multimodal Re-Identification","date":"2023-10-25","arxiv_id":"2310.16856","repositories_listed":0,"syntology":null},{"url":null,"slug":"samples-on-thin-ice-re-evaluating-adversarial","title":"Samples on Thin Ice: Re-Evaluating Adversarial Pruning of Neural Networks","date":"2023-10-12","arxiv_id":"2310.08073","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-asr-pathways-an-adaptive-masking","title":"Dynamic ASR Pathways: An Adaptive Masking Approach Towards Efficient Pruning of A Multilingual ASR Model","date":"2023-09-22","arxiv_id":"2309.13018","repositories_listed":0,"syntology":null}],"record_sha256":"0f210e029580a822fe406837f3ef239e3a65d60444659778ec4da387f48a0069","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}