{"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":"/method/pruning/papers/17","list_of":"/method/pruning","method":"Pruning","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":17,"pages_in_order":39,"rows_per_page":100,"rows":[1601,1700],"of":3874,"counts":{"archive_papers_tagged":3874,"with_a_code_link":1508,"where_syntology_ran_a_sample":478,"not_listed_spam_title":0,"listed":3874,"listed_where_code_ran":478,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":395,"every_run_a_failure_of_syntologys_instrument":83,"listed_with_a_run_with_no_instrument_failure":395,"listed_every_run_a_failure_of_syntologys_instrument":83,"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":"/method/pruning","prev":"/method/pruning/papers/16","next":"/method/pruning/papers/18","papers":[{"paper":"/paper/improved-knowledge-distillation-for-crowd","slug":"improved-knowledge-distillation-for-crowd","title":"Improved Knowledge Distillation for Crowd Counting on IoT Device","date":"2023-08-02","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"decidable-fragments-of-ltlf-modulo-theories","title":"Decidable Fragments of LTLf Modulo Theories (Extended Version)","date":"2023-07-31","arxiv_id":"2307.16840","n_code_links":0,"syntology":null},{"paper":null,"slug":"uncertainty-guided-spatial-pruning","title":"Uncertainty-Guided Spatial Pruning Architecture for Efficient Frame Interpolation","date":"2023-07-31","arxiv_id":"2307.16555","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-plenoctree-for-adaptive-sampling","title":"Dynamic PlenOctree for Adaptive Sampling Refinement in Explicit NeRF","date":"2023-07-28","arxiv_id":"2307.15333","n_code_links":0,"syntology":null},{"paper":"/paper/information-based-preprocessing-of-plc-data","slug":"information-based-preprocessing-of-plc-data","title":"Information-based Preprocessing of PLC Data for Automatic Behavior Modeling","date":"2023-07-28","arxiv_id":"2307.15404","n_code_links":1,"syntology":null},{"paper":"/paper/learning-heterogeneous-delays-in-a-layer-of","slug":"learning-heterogeneous-delays-in-a-layer-of","title":"Learning heterogeneous delays in a layer of spiking neurons for fast motion detection","date":"2023-07-26","arxiv_id":"2307.14077","n_code_links":1,"syntology":null},{"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","slug":"e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","arxiv_id":"2307.13770","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["chenghan111/e2vpt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/sparse-then-prune-toward-efficient-vision","slug":"sparse-then-prune-toward-efficient-vision","title":"Sparse then Prune: Toward Efficient Vision Transformers","date":"2023-07-22","arxiv_id":"2307.11988","n_code_links":1,"syntology":null},{"paper":null,"slug":"3d-skeletonization-of-complex-grapevines-for","title":"3D Skeletonization of Complex Grapevines for Robotic Pruning","date":"2023-07-21","arxiv_id":"2307.11706","n_code_links":0,"syntology":null},{"paper":"/paper/a-modular-theoretical-framework-for-learning","slug":"a-modular-theoretical-framework-for-learning","title":"A theoretical framework for learning through structural plasticity","date":"2023-07-21","arxiv_id":"2307.11735","n_code_links":1,"syntology":null},{"paper":"/paper/fmt-removing-backdoor-feature-maps-via","slug":"fmt-removing-backdoor-feature-maps-via","title":"Adversarial Feature Map Pruning for Backdoor","date":"2023-07-21","arxiv_id":"2307.11565","n_code_links":2,"syntology":{"ran":7,"of":7,"n_ran_checked":4,"n_instrument":3,"unverified":0,"pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ase2023paper/fmt","retsuh-bqw/fmp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"model-compression-methods-for-yolov5-a-review","title":"Model Compression Methods for YOLOv5: A Review","date":"2023-07-21","arxiv_id":"2307.11904","n_code_links":0,"syntology":null},{"paper":"/paper/learned-thresholds-token-merging-and-pruning","slug":"learned-thresholds-token-merging-and-pruning","title":"Learned Thresholds Token Merging and Pruning for Vision Transformers","date":"2023-07-20","arxiv_id":"2307.10780","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mxbonn/ltmp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"patrol-privacy-oriented-pruning-for","title":"PATROL: Privacy-Oriented Pruning for Collaborative Inference Against Model Inversion Attacks","date":"2023-07-20","arxiv_id":"2307.10981","n_code_links":0,"syntology":null},{"paper":null,"slug":"squeezerfacenet-reducing-a-small-face","title":"SqueezerFaceNet: Reducing a Small Face Recognition CNN Even More Via Filter Pruning","date":"2023-07-20","arxiv_id":"2307.10697","n_code_links":0,"syntology":null},{"paper":null,"slug":"impact-of-disentanglement-on-pruning-neural","title":"Impact of Disentanglement on Pruning Neural Networks","date":"2023-07-19","arxiv_id":"2307.09994","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-region-aware-neural-radiance-fields","slug":"efficient-region-aware-neural-radiance-fields","title":"Efficient Region-Aware Neural Radiance Fields for High-Fidelity Talking Portrait Synthesis","date":"2023-07-18","arxiv_id":"2307.09323","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":7,"n_instrument":3,"unverified":2,"pointer_only":4,"phrase":"10 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; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["fictionarry/er-nerf"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"mitigating-label-bias-via-decoupled-confident","title":"Mitigating Label Bias via Decoupled Confident Learning","date":"2023-07-18","arxiv_id":"2307.08945","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-pruning-as-spectrum-preserving","title":"Neural Network Pruning as Spectrum Preserving Process","date":"2023-07-18","arxiv_id":"2307.08982","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-transportation-pruning","title":"Differentiable Transportation Pruning","date":"2023-07-17","arxiv_id":"2307.08483","n_code_links":0,"syntology":null},{"paper":"/paper/upscale-unconstrained-channel-pruning","slug":"upscale-unconstrained-channel-pruning","title":"UPSCALE: Unconstrained Channel Pruning","date":"2023-07-17","arxiv_id":"2307.08771","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":1,"n_instrument":4,"unverified":2,"pointer_only":7,"phrase":"5 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; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["apple/ml-upscale"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learning-sparse-neural-networks-with-identity","title":"Learning Sparse Neural Networks with Identity Layers","date":"2023-07-14","arxiv_id":"2307.07389","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-pruning-of-neural-networks-for","title":"Structured Pruning of Neural Networks for Constraints Learning","date":"2023-07-14","arxiv_id":"2307.07457","n_code_links":0,"syntology":null},{"paper":null,"slug":"counterfactual-explanation-for-fairness-in","title":"Counterfactual Explanation for Fairness in Recommendation","date":"2023-07-10","arxiv_id":"2307.04386","n_code_links":0,"syntology":null},{"paper":null,"slug":"one-shot-pruning-for-fast-adapting-pre","title":"One-Shot Pruning for Fast-adapting Pre-trained Models on Devices","date":"2023-07-10","arxiv_id":"2307.04365","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsevsr-lightweight-and-noise-robust-visual","title":"SparseVSR: Lightweight and Noise Robust Visual Speech Recognition","date":"2023-07-10","arxiv_id":"2307.04552","n_code_links":0,"syntology":null},{"paper":"/paper/distilled-pruning-using-synthetic-data-to-win","slug":"distilled-pruning-using-synthetic-data-to-win","title":"Distilled Pruning: Using Synthetic Data to Win the Lottery","date":"2023-07-07","arxiv_id":"2307.03364","n_code_links":1,"syntology":null},{"paper":"/paper/improving-retrieval-augmented-large-language","slug":"improving-retrieval-augmented-large-language","title":"Improving Retrieval-Augmented Large Language Models via Data Importance Learning","date":"2023-07-06","arxiv_id":"2307.03027","n_code_links":1,"syntology":{"ran":2,"of":6,"n_ran_checked":2,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["amsterdata/ragbooster"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-vs-quantization-which-is-better","slug":"pruning-vs-quantization-which-is-better","title":"Pruning vs Quantization: Which is Better?","date":"2023-07-06","arxiv_id":"2307.02973","n_code_links":1,"syntology":{"ran":10,"of":10,"n_ran_checked":10,"n_instrument":0,"unverified":0,"pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Qualcomm-AI-research/pruning-vs-quantization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/improving-automatic-parallel-training-via","slug":"improving-automatic-parallel-training-via","title":"Improving Automatic Parallel Training via Balanced Memory Workload Optimization","date":"2023-07-05","arxiv_id":"2307.02031","n_code_links":1,"syntology":null},{"paper":"/paper/recommendation-unlearning-via-influence","slug":"recommendation-unlearning-via-influence","title":"Recommendation Unlearning via Influence Function","date":"2023-07-05","arxiv_id":"2307.02147","n_code_links":1,"syntology":null},{"paper":null,"slug":"structured-network-pruning-by-measuring","title":"Structured Network Pruning by Measuring Filter-wise Interactions","date":"2023-07-03","arxiv_id":"2307.00758","n_code_links":0,"syntology":null},{"paper":"/paper/a-proximal-algorithm-for-network-slimming","slug":"a-proximal-algorithm-for-network-slimming","title":"A Proximal Algorithm for Network Slimming","date":"2023-07-02","arxiv_id":"2307.00684","n_code_links":1,"syntology":null},{"paper":"/paper/filter-pruning-for-efficient-cnns-via","slug":"filter-pruning-for-efficient-cnns-via","title":"Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler","date":"2023-07-01","arxiv_id":"2307.00198","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":5,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["osilly/kdfs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"miniaturized-graph-convolutional-networks","title":"Miniaturized Graph Convolutional Networks with Topologically Consistent Pruning","date":"2023-06-30","arxiv_id":"2306.17590","n_code_links":0,"syntology":null},{"paper":null,"slug":"razor-snn-efficient-spiking-neural-network","title":"Razor SNN: Efficient Spiking Neural Network with Temporal Embeddings","date":"2023-06-30","arxiv_id":"2306.17597","n_code_links":0,"syntology":null},{"paper":"/paper/sparse-model-soups-a-recipe-for-improved","slug":"sparse-model-soups-a-recipe-for-improved","title":"Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging","date":"2023-06-29","arxiv_id":"2306.16788","n_code_links":1,"syntology":null},{"paper":"/paper/an-efficient-sparse-inference-software","slug":"an-efficient-sparse-inference-software","title":"An Efficient Sparse Inference Software Accelerator for Transformer-based Language Models on CPUs","date":"2023-06-28","arxiv_id":"2306.16601","n_code_links":1,"syntology":null},{"paper":"/paper/time-regularization-in-optimal-time-variable","slug":"time-regularization-in-optimal-time-variable","title":"Time Regularization in Optimal Time Variable Learning","date":"2023-06-28","arxiv_id":"2306.16111","n_code_links":1,"syntology":null},{"paper":null,"slug":"input-sensitive-dense-sparse-primitive","title":"SENSEi: Input-Sensitive Compilation for Accelerating GNNs","date":"2023-06-27","arxiv_id":"2306.15155","n_code_links":0,"syntology":null},{"paper":"/paper/constraint-aware-and-ranking-distilled-token","slug":"constraint-aware-and-ranking-distilled-token","title":"Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference","date":"2023-06-26","arxiv_id":"2306.14393","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-underlying-scaling-laws-and-universal","title":"The Underlying Scaling Laws and Universal Statistical Structure of Complex Datasets","date":"2023-06-26","arxiv_id":"2306.14975","n_code_links":0,"syntology":null},{"paper":"/paper/a-multilingual-translator-to-sql-with","slug":"a-multilingual-translator-to-sql-with","title":"A Multilingual Translator to SQL with Database Schema Pruning to Improve Self-Attention","date":"2023-06-25","arxiv_id":"2306.14256","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["c4ai/gap-text2sql"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"adaptive-sharpness-aware-pruning-for-robust","title":"Adaptive Sharpness-Aware Pruning for Robust Sparse Networks","date":"2023-06-25","arxiv_id":"2306.14306","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-window-pruning-for-efficient-local","title":"Adaptive Window Pruning for Efficient Local Motion Deblurring","date":"2023-06-25","arxiv_id":"2306.14268","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-rank-prune-and-factorize-for-language","title":"Low-Rank Prune-And-Factorize for Language Model Compression","date":"2023-06-25","arxiv_id":"2306.14152","n_code_links":0,"syntology":null},{"paper":"/paper/binary-domain-generalization-for-sparsifying","slug":"binary-domain-generalization-for-sparsifying","title":"Binary domain generalization for sparsifying binary neural networks","date":"2023-06-23","arxiv_id":"2306.13515","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-model-selection-for-predictive","title":"Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning","date":"2023-06-23","arxiv_id":"2306.13561","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-online-processing-with-deep-neural","slug":"efficient-online-processing-with-deep-neural","title":"Efficient Online Processing with Deep Neural Networks","date":"2023-06-23","arxiv_id":"2306.13474","n_code_links":1,"syntology":null},{"paper":"/paper/data-free-backbone-fine-tuning-for-pruned","slug":"data-free-backbone-fine-tuning-for-pruned","title":"Data-Free Backbone Fine-Tuning for Pruned Neural Networks","date":"2023-06-22","arxiv_id":"2306.12881","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-network-pruning-for-real-time-polyp","title":"Neural Network Pruning for Real-time Polyp Segmentation","date":"2023-06-22","arxiv_id":"2306.13203","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-for-better-domain-generalizability","slug":"pruning-for-better-domain-generalizability","title":"Pruning for Better Domain Generalizability","date":"2023-06-22","arxiv_id":"2306.13237","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["alexsunnik/pruning-for-better-domain-generalizability"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/fantastic-weights-and-how-to-find-them-where-1","slug":"fantastic-weights-and-how-to-find-them-where-1","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","date":"2023-06-21","arxiv_id":"2306.12230","n_code_links":1,"syntology":{"ran":15,"of":20,"n_ran_checked":13,"n_instrument":2,"unverified":5,"pointer_only":5,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","official":{"repos":["alooow/fantastic_weights_paper"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/quantifying-lottery-tickets-under-label-noise","slug":"quantifying-lottery-tickets-under-label-noise","title":"Quantifying lottery tickets under label noise: accuracy, calibration, and complexity","date":"2023-06-21","arxiv_id":"2306.12190","n_code_links":1,"syntology":null},{"paper":"/paper/a-simple-and-effective-pruning-approach-for","slug":"a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","arxiv_id":"2306.11695","n_code_links":7,"syntology":{"ran":9,"of":22,"n_ran_checked":6,"n_instrument":3,"unverified":13,"pointer_only":9,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 13 unverified","official":{"repos":["locuslab/wanda"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":null,"slug":"losparse-structured-compression-of-large","title":"LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximation","date":"2023-06-20","arxiv_id":"2306.11222","n_code_links":0,"syntology":null},{"paper":"/paper/instant-soup-cheap-pruning-ensembles-in-a","slug":"instant-soup-cheap-pruning-ensembles-in-a","title":"Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models","date":"2023-06-18","arxiv_id":"2306.10460","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","official":{"repos":["vita-group/instant_soup"],"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"]}}},{"paper":"/paper/hinerv-video-compression-with-hierarchical","slug":"hinerv-video-compression-with-hierarchical","title":"HiNeRV: Video Compression with Hierarchical Encoding-based Neural Representation","date":"2023-06-16","arxiv_id":"2306.09818","n_code_links":1,"syntology":null},{"paper":null,"slug":"representation-and-decomposition-of-functions","title":"Representation and decomposition of functions in DAG-DNNs and structural network pruning","date":"2023-06-16","arxiv_id":"2306.09707","n_code_links":0,"syntology":null},{"paper":null,"slug":"squeezing-nnu-nets-with-knowledge","title":"Squeezing nnU-Nets with Knowledge Distillation for On-Board Cloud Detection","date":"2023-06-16","arxiv_id":"2306.09886","n_code_links":0,"syntology":null},{"paper":null,"slug":"transferability-of-winning-lottery-tickets-in","title":"Transferability of Winning Lottery Tickets in Neural Network Differential Equation Solvers","date":"2023-06-16","arxiv_id":"2306.09863","n_code_links":0,"syntology":null},{"paper":"/paper/fix-fairness-don-t-ruin-accuracy-performance","slug":"fix-fairness-don-t-ruin-accuracy-performance","title":"Fix Fairness, Don't Ruin Accuracy: Performance Aware Fairness Repair using AutoML","date":"2023-06-15","arxiv_id":"2306.09297","n_code_links":2,"syntology":null},{"paper":null,"slug":"geometric-based-pruning-rules-for-change","title":"Geometric-Based Pruning Rules For Change Point Detection in Multiple Independent Time Series","date":"2023-06-15","arxiv_id":"2306.09555","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-compression-using-binarization","title":"Neural Network Compression using Binarization and Few Full-Precision Weights","date":"2023-06-15","arxiv_id":"2306.08960","n_code_links":0,"syntology":null},{"paper":"/paper/improving-generalization-in-meta-learning-via","slug":"improving-generalization-in-meta-learning-via","title":"Improving Generalization in Meta-Learning via Meta-Gradient Augmentation","date":"2023-06-14","arxiv_id":"2306.08460","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-the-way-to-reliable-policies-a-multi","title":"Pruning the Way to Reliable Policies: A Multi-Objective Deep Q-Learning Approach to Critical Care","date":"2023-06-13","arxiv_id":"2306.08044","n_code_links":0,"syntology":null},{"paper":null,"slug":"resource-efficient-neural-networks-using","title":"Resource Efficient Neural Networks Using Hessian Based Pruning","date":"2023-06-12","arxiv_id":"2306.07030","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-token-pruning-for-object-detection","slug":"revisiting-token-pruning-for-object-detection","title":"Revisiting Token Pruning for Object Detection and Instance Segmentation","date":"2023-06-12","arxiv_id":"2306.07050","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["uzh-rpg/svit"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"small-temperature-is-all-you-need-for","title":"Small Temperature is All You Need for Differentiable Architecture Search","date":"2023-06-12","arxiv_id":"2306.06855","n_code_links":0,"syntology":null},{"paper":"/paper/gup-fast-subgraph-matching-by-guard-based","slug":"gup-fast-subgraph-matching-by-guard-based","title":"GuP: Fast Subgraph Matching by Guard-based Pruning","date":"2023-06-11","arxiv_id":"2306.06557","n_code_links":1,"syntology":null},{"paper":"/paper/how-sparse-can-we-prune-a-deep-network-a","slug":"how-sparse-can-we-prune-a-deep-network-a","title":"How Sparse Can We Prune A Deep Network: A Fundamental Limit Viewpoint","date":"2023-06-09","arxiv_id":"2306.05857","n_code_links":1,"syntology":null},{"paper":"/paper/large-scale-dataset-pruning-with-dynamic","slug":"large-scale-dataset-pruning-with-dynamic","title":"Large-scale Dataset Pruning with Dynamic Uncertainty","date":"2023-06-08","arxiv_id":"2306.05175","n_code_links":2,"syntology":{"ran":11,"of":11,"n_ran_checked":8,"n_instrument":3,"unverified":0,"pointer_only":7,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["baai-dcai/dataset-pruning"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"magnitude-attention-based-dynamic-pruning","title":"Magnitude Attention-based Dynamic Pruning","date":"2023-06-08","arxiv_id":"2306.05056","n_code_links":0,"syntology":null},{"paper":null,"slug":"muti-scale-and-token-mergence-make-your-vit","title":"Multi-Scale And Token Mergence: Make Your ViT More Efficient","date":"2023-06-08","arxiv_id":"2306.04897","n_code_links":0,"syntology":null},{"paper":"/paper/cfdp-common-frequency-domain-pruning","slug":"cfdp-common-frequency-domain-pruning","title":"CFDP: Common Frequency Domain Pruning","date":"2023-06-07","arxiv_id":"2306.04147","n_code_links":1,"syntology":null},{"paper":null,"slug":"bayesian-post-hoc-regularization-of-random","title":"Bayesian post-hoc regularization of random forests","date":"2023-06-06","arxiv_id":"2306.03702","n_code_links":0,"syntology":null},{"paper":null,"slug":"esl-snns-an-evolutionary-structure-learning","title":"ESL-SNNs: An Evolutionary Structure Learning Strategy for Spiking Neural Networks","date":"2023-06-06","arxiv_id":"2306.03693","n_code_links":0,"syntology":null},{"paper":null,"slug":"utterance-classification-with-logical-neural","title":"Utterance Classification with Logical Neural Network: Explainable AI for Mental Disorder Diagnosis","date":"2023-06-06","arxiv_id":"2306.03902","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-joint-source-channel-coding-for-wireless-4","title":"Deep Joint Source-Channel Coding for Wireless Image Transmission with Entropy-Aware Adaptive Rate Control","date":"2023-06-05","arxiv_id":"2306.02825","n_code_links":0,"syntology":null},{"paper":"/paper/nlu-on-data-diets-dynamic-data-subset","slug":"nlu-on-data-diets-dynamic-data-subset","title":"NLU on Data Diets: Dynamic Data Subset Selection for NLP Classification Tasks","date":"2023-06-05","arxiv_id":"2306.03208","n_code_links":1,"syntology":null},{"paper":"/paper/group-channel-pruning-and-spatial-attention","slug":"group-channel-pruning-and-spatial-attention","title":"Group channel pruning and spatial attention distilling for object detection","date":"2023-06-02","arxiv_id":"2306.01526","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-low-rank-training-via-approximate","title":"Robust low-rank training via approximate orthonormal constraints","date":"2023-06-02","arxiv_id":"2306.01485","n_code_links":0,"syntology":null},{"paper":null,"slug":"task-agnostic-structured-pruning-of-speech","title":"Task-Agnostic Structured Pruning of Speech Representation Models","date":"2023-06-02","arxiv_id":"2306.01385","n_code_links":0,"syntology":null},{"paper":"/paper/training-free-neural-architecture-search-for","slug":"training-free-neural-architecture-search-for","title":"Training-free Neural Architecture Search for RNNs and Transformers","date":"2023-06-01","arxiv_id":"2306.00288","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["aaronserianni/training-free-nas"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"accurate-and-structured-pruning-for-efficient","title":"Accurate and Structured Pruning for Efficient Automatic Speech Recognition","date":"2023-05-31","arxiv_id":"2305.19549","n_code_links":0,"syntology":null},{"paper":"/paper/lottery-tickets-in-evolutionary-optimization","slug":"lottery-tickets-in-evolutionary-optimization","title":"Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability","date":"2023-05-31","arxiv_id":"2306.00045","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["roberttlange/es-lottery"],"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"]}}},{"paper":"/paper/optimal-sets-and-solution-paths-of-relu","slug":"optimal-sets-and-solution-paths-of-relu","title":"Optimal Sets and Solution Paths of ReLU Networks","date":"2023-05-31","arxiv_id":"2306.00119","n_code_links":1,"syntology":null},{"paper":null,"slug":"budget-aware-graph-convolutional-network","title":"Budget-Aware Graph Convolutional Network Design using Probabilistic Magnitude Pruning","date":"2023-05-30","arxiv_id":"2305.19343","n_code_links":0,"syntology":null},{"paper":"/paper/e-panns-sound-recognition-using-efficient-pre","slug":"e-panns-sound-recognition-using-efficient-pre","title":"E-PANNs: Sound Recognition Using Efficient Pre-trained Audio Neural Networks","date":"2023-05-30","arxiv_id":"2305.18665","n_code_links":1,"syntology":null},{"paper":null,"slug":"generalization-bounds-for-magnitude-based","title":"Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching","date":"2023-05-30","arxiv_id":"2305.18789","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-adaptive-spectral-pruning-of","title":"Geometry-aware training of factorized layers in tensor Tucker format","date":"2023-05-30","arxiv_id":"2305.19059","n_code_links":0,"syntology":null},{"paper":"/paper/diffrate-differentiable-compression-rate-for","slug":"diffrate-differentiable-compression-rate-for","title":"DiffRate : Differentiable Compression Rate for Efficient Vision Transformers","date":"2023-05-29","arxiv_id":"2305.17997","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-network-reduction-with-guided","title":"Neural Network Reduction with Guided Regularizers","date":"2023-05-29","arxiv_id":"2305.18448","n_code_links":0,"syntology":null},{"paper":"/paper/out-of-distributed-semantic-pruning-for-1","slug":"out-of-distributed-semantic-pruning-for-1","title":"Out-of-Distributed Semantic Pruning for Robust Semi-Supervised Learning","date":"2023-05-29","arxiv_id":"2305.18158","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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) · 0 unverified","official":{"repos":["rain305f/osp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"slimfit-memory-efficient-fine-tuning-of","title":"SlimFit: Memory-Efficient Fine-Tuning of Transformer-based Models Using Training Dynamics","date":"2023-05-29","arxiv_id":"2305.18513","n_code_links":0,"syntology":null},{"paper":"/paper/vlsd-an-efficient-subgroup-discovery","slug":"vlsd-an-efficient-subgroup-discovery","title":"VLSD—An Efficient Subgroup Discovery Algorithm Based on Equivalence Classes and Optimistic Estimate","date":"2023-05-29","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/a-three-regime-model-of-network-pruning","slug":"a-three-regime-model-of-network-pruning","title":"A Three-regime Model of Network Pruning","date":"2023-05-28","arxiv_id":"2305.18383","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yefanzhou/threeregimepruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/one-network-many-masks-towards-more-parameter","slug":"one-network-many-masks-towards-more-parameter","title":"One Network, Many Masks: Towards More Parameter-Efficient Transfer Learning","date":"2023-05-28","arxiv_id":"2305.17682","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":1,"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) · 1 unverified","official":{"repos":["chaoscodes/propetl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/pruning-meets-low-rank-parameter-efficient","slug":"pruning-meets-low-rank-parameter-efficient","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","date":"2023-05-28","arxiv_id":"2305.18403","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["aim-uofa/loraprune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/repeated-random-sampling-for-minimizing-the","slug":"repeated-random-sampling-for-minimizing-the","title":"Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning","date":"2023-05-28","arxiv_id":"2305.18424","n_code_links":1,"syntology":null}],"record_sha256":"c5a89e8edd8ca7cc870e8c8cd85556fb07707ea6ab55dcd6f7172b781941e582","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}