{"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/18","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":18,"pages_in_order":39,"rows_per_page":100,"rows":[1701,1800],"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/17","next":"/method/pruning/papers/19","papers":[{"paper":"/paper/is-centralized-training-with-decentralized","slug":"is-centralized-training-with-decentralized","title":"Is Centralized Training with Decentralized Execution Framework Centralized Enough for MARL?","date":"2023-05-27","arxiv_id":"2305.17352","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: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zyh1999/cadp"],"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":null,"slug":"pruning-at-initialization-a-sketching","title":"Pruning at Initialization -- A Sketching Perspective","date":"2023-05-27","arxiv_id":"2305.17559","n_code_links":0,"syntology":null},{"paper":"/paper/pumer-pruning-and-merging-tokens-for","slug":"pumer-pruning-and-merging-tokens-for","title":"PuMer: Pruning and Merging Tokens for Efficient Vision Language Models","date":"2023-05-27","arxiv_id":"2305.17530","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 2 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) · 0 unverified","official":{"repos":["csarron/pumer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"zero-tprune-zero-shot-token-pruning-through","title":"Zero-TPrune: Zero-Shot Token Pruning through Leveraging of the Attention Graph in Pre-Trained Transformers","date":"2023-05-27","arxiv_id":"2305.17328","n_code_links":0,"syntology":null},{"paper":"/paper/comcat-towards-efficient-compression-and","slug":"comcat-towards-efficient-compression-and","title":"COMCAT: Towards Efficient Compression and Customization of Attention-Based Vision Models","date":"2023-05-26","arxiv_id":"2305.17235","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["jinqixiao/ComCAT"],"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"]}}},{"paper":"/paper/improving-knowledge-distillation-via-1","slug":"improving-knowledge-distillation-via-1","title":"Improving Knowledge Distillation via Regularizing Feature Norm and Direction","date":"2023-05-26","arxiv_id":"2305.17007","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["wangyz1608/knowledge-distillation-via-nd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/peeking-inside-sparse-neural-networks-using","slug":"peeking-inside-sparse-neural-networks-using","title":"Understanding Sparse Neural Networks from their Topology via Multipartite Graph Representations","date":"2023-05-26","arxiv_id":"2305.16886","n_code_links":1,"syntology":null},{"paper":"/paper/c-mcts-safe-planning-with-monte-carlo-tree","slug":"c-mcts-safe-planning-with-monte-carlo-tree","title":"C-MCTS: Safe Planning with Monte Carlo Tree Search","date":"2023-05-25","arxiv_id":"2305.16209","n_code_links":1,"syntology":null},{"paper":"/paper/candidate-set-re-ranking-for-composed-image","slug":"candidate-set-re-ranking-for-composed-image","title":"Candidate Set Re-ranking for Composed Image Retrieval with Dual Multi-modal Encoder","date":"2023-05-25","arxiv_id":"2305.16304","n_code_links":2,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"4 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; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["Cuberick-Orion/Candidate-Reranking-CIR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"dynamic-context-pruning-for-efficient-and","title":"Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers","date":"2023-05-25","arxiv_id":"2305.15805","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-scale-efficient-graph-transformer-for","title":"Multi-scale Efficient Graph-Transformer for Whole Slide Image Classification","date":"2023-05-25","arxiv_id":"2305.15773","n_code_links":0,"syntology":null},{"paper":"/paper/on-architectural-compression-of-text-to-image","slug":"on-architectural-compression-of-text-to-image","title":"BK-SDM: A Lightweight, Fast, and Cheap Version of Stable Diffusion","date":"2023-05-25","arxiv_id":"2305.15798","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"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":["Nota-NetsPresso/BK-SDM","segmind/distill-sd"],"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/2305-14706","slug":"2305-14706","title":"PruMUX: Augmenting Data Multiplexing with Model Compression","date":"2023-05-24","arxiv_id":"2305.14706","n_code_links":1,"syntology":null},{"paper":null,"slug":"2305-14852","title":"Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruning","date":"2023-05-24","arxiv_id":"2305.14852","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-language-model-distillation-doesn-t","title":"Just CHOP: Embarrassingly Simple LLM Compression","date":"2023-05-24","arxiv_id":"2305.14864","n_code_links":0,"syntology":null},{"paper":null,"slug":"smarttrim-adaptive-tokens-and-parameters","title":"SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models","date":"2023-05-24","arxiv_id":"2305.15033","n_code_links":0,"syntology":null},{"paper":null,"slug":"augmented-random-search-for-multi-objective","title":"Combining Multi-Objective Bayesian Optimization with Reinforcement Learning for TinyML","date":"2023-05-23","arxiv_id":"2305.14109","n_code_links":0,"syntology":null},{"paper":null,"slug":"layer-adaptive-structured-pruning-guided-by","title":"Layer-adaptive Structured Pruning Guided by Latency","date":"2023-05-23","arxiv_id":"2305.14403","n_code_links":0,"syntology":null},{"paper":"/paper/pad-program-aided-distillation-specializes","slug":"pad-program-aided-distillation-specializes","title":"PaD: Program-aided Distillation Can Teach Small Models Reasoning Better than Chain-of-thought Fine-tuning","date":"2023-05-23","arxiv_id":"2305.13888","n_code_links":1,"syntology":null},{"paper":null,"slug":"joint-device-edge-digital-semantic","title":"Digital-SC: Digital Semantic Communication with Adaptive Network Split and Learned Non-Linear Quantization","date":"2023-05-22","arxiv_id":"2305.13553","n_code_links":0,"syntology":null},{"paper":"/paper/communication-efficient-federated-learning-19","slug":"communication-efficient-federated-learning-19","title":"Communication Efficient Federated Learning for Multilingual Neural Machine Translation with Adapter","date":"2023-05-21","arxiv_id":"2305.12449","n_code_links":1,"syntology":null},{"paper":null,"slug":"infor-coef-information-bottleneck-based","title":"Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language model","date":"2023-05-21","arxiv_id":"2305.12458","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-pre-trained-language-models-with","slug":"pruning-pre-trained-language-models-with","title":"Pruning Pre-trained Language Models with Principled Importance and Self-regularization","date":"2023-05-21","arxiv_id":"2305.12394","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"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","official":{"repos":["drsy/pins"],"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":null,"slug":"probabilistic-modeling-proving-the-lottery","title":"Probabilistic Modeling: Proving the Lottery Ticket Hypothesis in Spiking Neural Network","date":"2023-05-20","arxiv_id":"2305.12148","n_code_links":0,"syntology":null},{"paper":"/paper/self-distillation-with-meta-learning-for-1","slug":"self-distillation-with-meta-learning-for-1","title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","date":"2023-05-20","arxiv_id":"2305.12209","n_code_links":1,"syntology":null},{"paper":"/paper/llm-pruner-on-the-structural-pruning-of-large-1","slug":"llm-pruner-on-the-structural-pruning-of-large-1","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","date":"2023-05-19","arxiv_id":"2305.11627","n_code_links":2,"syntology":null},{"paper":null,"slug":"sfp-spurious-feature-targeted-pruning-for-out","title":"SFP: Spurious Feature-targeted Pruning for Out-of-Distribution Generalization","date":"2023-05-19","arxiv_id":"2305.11615","n_code_links":0,"syntology":null},{"paper":null,"slug":"boost-vision-transformer-with-gpu-friendly-1","title":"Boost Vision Transformer with GPU-Friendly Sparsity and Quantization","date":"2023-05-18","arxiv_id":"2305.10727","n_code_links":0,"syntology":null},{"paper":"/paper/learning-activation-functions-for-sparse","slug":"learning-activation-functions-for-sparse","title":"Learning Activation Functions for Sparse Neural Networks","date":"2023-05-18","arxiv_id":"2305.10964","n_code_links":1,"syntology":null},{"paper":"/paper/less-can-be-more-unsupervised-graph-pruning","slug":"less-can-be-more-unsupervised-graph-pruning","title":"Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs","date":"2023-05-18","arxiv_id":"2305.10673","n_code_links":1,"syntology":null},{"paper":null,"slug":"pdp-parameter-free-differentiable-pruning-is","title":"PDP: Parameter-free Differentiable Pruning is All You Need","date":"2023-05-18","arxiv_id":"2305.11203","n_code_links":0,"syntology":null},{"paper":null,"slug":"compress-then-prompt-improving-accuracy","title":"Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Prompt","date":"2023-05-17","arxiv_id":"2305.11186","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-federated-pruning-in-hierarchical","title":"Adaptive Federated Pruning in Hierarchical Wireless Networks","date":"2023-05-15","arxiv_id":"2305.09042","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-matching-by-bare-homography","title":"Image Matching by Bare Homography","date":"2023-05-15","arxiv_id":"2305.08946","n_code_links":0,"syntology":null},{"paper":"/paper/parameter-efficient-fine-tuning-with-layer","slug":"parameter-efficient-fine-tuning-with-layer","title":"Parameter-Efficient Fine-Tuning with Layer Pruning on Free-Text Sequence-to-Sequence Modeling","date":"2023-05-15","arxiv_id":"2305.08285","n_code_links":1,"syntology":null},{"paper":null,"slug":"pillaracc-sparse-pointpillars-accelerator-for","title":"SPADE: Sparse Pillar-based 3D Object Detection Accelerator for Autonomous Driving","date":"2023-05-12","arxiv_id":"2305.07522","n_code_links":0,"syntology":null},{"paper":null,"slug":"divide-and-conquer-the-nas-puzzle-in-resource","title":"Divide-and-Conquer the NAS puzzle in Resource Constrained Federated Learning Systems","date":"2023-05-11","arxiv_id":"2305.07135","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-network-for-accurate-and-low","title":"Graph Neural Network for Accurate and Low-complexity SAR ATR","date":"2023-05-11","arxiv_id":"2305.07119","n_code_links":0,"syntology":null},{"paper":"/paper/securing-distributed-sgd-against-gradient","slug":"securing-distributed-sgd-against-gradient","title":"Securing Distributed SGD against Gradient Leakage Threats","date":"2023-05-10","arxiv_id":"2305.06473","n_code_links":1,"syntology":null},{"paper":null,"slug":"spectrum-breathing-protecting-over-the-air","title":"Spectrum Breathing: Protecting Over-the-Air Federated Learning Against Interference","date":"2023-05-10","arxiv_id":"2305.05933","n_code_links":0,"syntology":null},{"paper":"/paper/distributional-multi-objective-decision","slug":"distributional-multi-objective-decision","title":"Distributional Multi-Objective Decision Making","date":"2023-05-09","arxiv_id":"2305.05560","n_code_links":1,"syntology":null},{"paper":null,"slug":"osta-one-shot-task-adaptive-channel-selection","title":"OSTA: One-shot Task-adaptive Channel Selection for Semantic Segmentation of Multichannel Images","date":"2023-05-08","arxiv_id":"2305.04766","n_code_links":0,"syntology":null},{"paper":null,"slug":"snt-sharpness-minimizing-network","title":"CrAFT: Compression-Aware Fine-Tuning for Efficient Visual Task Adaptation","date":"2023-05-08","arxiv_id":"2305.04526","n_code_links":0,"syntology":null},{"paper":null,"slug":"classification-tree-pruning-under-covariate","title":"Classification Tree Pruning Under Covariate Shift","date":"2023-05-07","arxiv_id":"2305.04335","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressing-audio-cnns-with-graph-centrality","title":"Compressing audio CNNs with graph centrality based filter pruning","date":"2023-05-05","arxiv_id":"2305.03391","n_code_links":0,"syntology":null},{"paper":"/paper/dspdet3d-dynamic-spatial-pruning-for-3d-small","slug":"dspdet3d-dynamic-spatial-pruning-for-3d-small","title":"3D Small Object Detection with Dynamic Spatial Pruning","date":"2023-05-05","arxiv_id":"2305.03716","n_code_links":1,"syntology":null},{"paper":null,"slug":"learn-how-to-prune-pixels-for-multi-view","title":"Learn how to Prune Pixels for Multi-view Neural Image-based Synthesis","date":"2023-05-05","arxiv_id":"2305.03572","n_code_links":0,"syntology":null},{"paper":"/paper/bicubic-slim-slimmer-slimmest-designing-an","slug":"bicubic-slim-slimmer-slimmest-designing-an","title":"Bicubic++: Slim, Slimmer, Slimmest -- Designing an Industry-Grade Super-Resolution Network","date":"2023-05-03","arxiv_id":"2305.02126","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-graph-lottery-tickets-graph","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","date":"2023-05-03","arxiv_id":"2305.02190","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-federated-learning-with-enhanced","title":"Efficient Federated Learning with Enhanced Privacy via Lottery Ticket Pruning in Edge Computing","date":"2023-05-02","arxiv_id":"2305.01387","n_code_links":0,"syntology":null},{"paper":"/paper/optimizing-guided-traversal-for-fast-learned","slug":"optimizing-guided-traversal-for-fast-learned","title":"Optimizing Guided Traversal for Fast Learned Sparse Retrieval","date":"2023-05-02","arxiv_id":"2305.01203","n_code_links":1,"syntology":null},{"paper":"/paper/depthfl-depthwise-federated-learning-for","slug":"depthfl-depthwise-federated-learning-for","title":"DepthFL: Depthwise Federated Learning for Heterogeneous Clients","date":"2023-05-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/jaxpruner-a-concise-library-for-sparsity","slug":"jaxpruner-a-concise-library-for-sparsity","title":"JaxPruner: A concise library for sparsity research","date":"2023-04-27","arxiv_id":"2304.14082","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["google-research/jaxpruner"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"concept-monitor-understanding-dnn-training","title":"Concept-Monitor: Understanding DNN training through individual neurons","date":"2023-04-26","arxiv_id":"2304.13346","n_code_links":0,"syntology":null},{"paper":null,"slug":"filter-pruning-via-filters-similarity-in","title":"Filter Pruning via Filters Similarity in Consecutive Layers","date":"2023-04-26","arxiv_id":"2304.13397","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-tuning-with-abnormal-examples","title":"Fine Tuning with Abnormal Examples","date":"2023-04-26","arxiv_id":"2304.13783","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsified-model-zoo-twins-investigating","title":"Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Models","date":"2023-04-26","arxiv_id":"2304.13718","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-static-pruning-study-on-sparse-neural","title":"A Static Pruning Study on Sparse Neural Retrievers","date":"2023-04-25","arxiv_id":"2304.12702","n_code_links":0,"syntology":null},{"paper":null,"slug":"bias-in-pruned-vision-models-in-depth","title":"Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures","date":"2023-04-25","arxiv_id":"2304.12622","n_code_links":0,"syntology":null},{"paper":"/paper/optimizing-deep-learning-models-for-raspberry","slug":"optimizing-deep-learning-models-for-raspberry","title":"Optimizing Deep Learning Models For Raspberry Pi","date":"2023-04-25","arxiv_id":"2304.13039","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-compute-optimal-transfer-learning","title":"Towards Compute-Optimal Transfer Learning","date":"2023-04-25","arxiv_id":"2304.13164","n_code_links":0,"syntology":null},{"paper":null,"slug":"advancing-underwater-acoustic-target","title":"Advancing underwater acoustic target recognition via adaptive data pruning and smoothness-inducing regularization","date":"2023-04-24","arxiv_id":"2304.11907","n_code_links":0,"syntology":null},{"paper":null,"slug":"neurogenesis-dynamics-inspired-spiking-neural","title":"Neurogenesis Dynamics-inspired Spiking Neural Network Training Acceleration","date":"2023-04-24","arxiv_id":"2304.12214","n_code_links":0,"syntology":null},{"paper":null,"slug":"conservative-sparse-neural-network-embedded","title":"Conservative Sparse Neural Network Embedded Frequency-Constrained Unit Commitment With Distributed Energy Resources","date":"2023-04-21","arxiv_id":"2304.10720","n_code_links":0,"syntology":null},{"paper":"/paper/joint-token-pruning-and-squeezing-towards","slug":"joint-token-pruning-and-squeezing-towards","title":"Joint Token Pruning and Squeezing Towards More Aggressive Compression of Vision Transformers","date":"2023-04-21","arxiv_id":"2304.10716","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":3,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["megvii-research/tps-cvpr2023"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"biologically-inspired-structure-learning-with","title":"Biologically inspired structure learning with reverse knowledge distillation for spiking neural networks","date":"2023-04-19","arxiv_id":"2304.09500","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-pruning-enables-localized-and-efficient","title":"Model Pruning Enables Localized and Efficient Federated Learning for Yield Forecasting and Data Sharing","date":"2023-04-19","arxiv_id":"2304.09876","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-pruning-spaces-1","title":"Network Pruning Spaces","date":"2023-04-19","arxiv_id":"2304.09453","n_code_links":0,"syntology":null},{"paper":null,"slug":"single-view-view-synthesis-with-self","title":"Single-View View Synthesis with Self-Rectified Pseudo-Stereo","date":"2023-04-19","arxiv_id":"2304.09527","n_code_links":0,"syntology":null},{"paper":null,"slug":"atheena-a-toolflow-for-hardware-early-exit","title":"ATHEENA: A Toolflow for Hardware Early-Exit Network Automation","date":"2023-04-17","arxiv_id":"2304.08400","n_code_links":0,"syntology":null},{"paper":"/paper/beta-rank-a-robust-convolutional-filter","slug":"beta-rank-a-robust-convolutional-filter","title":"Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysis","date":"2023-04-15","arxiv_id":"2304.07461","n_code_links":1,"syntology":null},{"paper":null,"slug":"salientgrads-sparse-models-for-communication","title":"SalientGrads: Sparse Models for Communication Efficient and Data Aware Distributed Federated Training","date":"2023-04-15","arxiv_id":"2304.07488","n_code_links":0,"syntology":null},{"paper":null,"slug":"autosparse-towards-automated-sparse-training","title":"AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networks","date":"2023-04-14","arxiv_id":"2304.06941","n_code_links":0,"syntology":null},{"paper":"/paper/boosting-convolutional-neural-networks-with","slug":"boosting-convolutional-neural-networks-with","title":"Boosting Convolutional Neural Networks with Middle Spectrum Grouped Convolution","date":"2023-04-13","arxiv_id":"2304.06305","n_code_links":1,"syntology":null},{"paper":"/paper/learning-accurate-performance-predictors-for","slug":"learning-accurate-performance-predictors-for","title":"Learning Accurate Performance Predictors for Ultrafast Automated Model Compression","date":"2023-04-13","arxiv_id":"2304.06393","n_code_links":1,"syntology":null},{"paper":null,"slug":"structured-pruning-for-multi-task-deep-neural","title":"Structured Pruning for Multi-Task Deep Neural Networks","date":"2023-04-13","arxiv_id":"2304.06840","n_code_links":0,"syntology":null},{"paper":null,"slug":"distilling-token-pruned-pose-transformer-for","title":"Distilling Token-Pruned Pose Transformer for 2D Human Pose Estimation","date":"2023-04-12","arxiv_id":"2304.05548","n_code_links":0,"syntology":null},{"paper":"/paper/proximity-forest-2-0-a-new-effective-and","slug":"proximity-forest-2-0-a-new-effective-and","title":"Proximity Forest 2.0: A new effective and scalable similarity-based classifier for time series","date":"2023-04-12","arxiv_id":"2304.05800","n_code_links":1,"syntology":null},{"paper":null,"slug":"surrogate-lagrangian-relaxation-a-path-to","title":"Surrogate Lagrangian Relaxation: A Path To Retrain-free Deep Neural Network Pruning","date":"2023-04-08","arxiv_id":"2304.04120","n_code_links":0,"syntology":null},{"paper":null,"slug":"clutter-detection-and-removal-in-3d-scenes","title":"Clutter Detection and Removal in 3D Scenes with View-Consistent Inpainting","date":"2023-04-07","arxiv_id":"2304.03763","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-learn-with-indispensable","title":"Learning to Learn with Indispensable Connections","date":"2023-04-06","arxiv_id":"2304.02862","n_code_links":0,"syntology":null},{"paper":"/paper/ntk-sap-improving-neural-network-pruning-by","slug":"ntk-sap-improving-neural-network-pruning-by","title":"NTK-SAP: Improving neural network pruning by aligning training dynamics","date":"2023-04-06","arxiv_id":"2304.02840","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["yitewang/ntk-sap"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":null,"slug":"scalable-causal-discovery-with-score-matching","title":"Scalable Causal Discovery with Score Matching","date":"2023-04-06","arxiv_id":"2304.03382","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-cnns-via-passive-filter-pruning","title":"Efficient CNNs via Passive Filter Pruning","date":"2023-04-05","arxiv_id":"2304.02319","n_code_links":0,"syntology":null},{"paper":null,"slug":"to-asymmetry-and-beyond-structured-pruning-of","title":"To Asymmetry and Beyond: Structured Pruning of Sequence to Sequence Models for Improved Inference Efficiency","date":"2023-04-05","arxiv_id":"2304.02721","n_code_links":0,"syntology":null},{"paper":"/paper/attention-map-guided-transformer-pruning-for","slug":"attention-map-guided-transformer-pruning-for","title":"Attention Map Guided Transformer Pruning for Edge Device","date":"2023-04-04","arxiv_id":"2304.01452","n_code_links":1,"syntology":null},{"paper":null,"slug":"posematcher-one-shot-6d-object-pose","title":"PoseMatcher: One-shot 6D Object Pose Estimation by Deep Feature Matching","date":"2023-04-03","arxiv_id":"2304.01382","n_code_links":0,"syntology":null},{"paper":"/paper/self-building-neural-networks","slug":"self-building-neural-networks","title":"Self-building Neural Networks","date":"2023-04-03","arxiv_id":"2304.01086","n_code_links":1,"syntology":null},{"paper":null,"slug":"progressive-channel-shrinking-network","title":"Progressive Channel-Shrinking Network","date":"2023-04-01","arxiv_id":"2304.00280","n_code_links":0,"syntology":null},{"paper":"/paper/the-other-side-of-compression-measuring-bias","slug":"the-other-side-of-compression-measuring-bias","title":"The Other Side of Compression: Measuring Bias in Pruned Transformers","date":"2023-04-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"quick-dense-retrievers-consume-kale-post","title":"Quick Dense Retrievers Consume KALE: Post Training Kullback Leibler Alignment of Embeddings for Asymmetrical dual encoders","date":"2023-03-31","arxiv_id":"2304.01016","n_code_links":0,"syntology":null},{"paper":null,"slug":"explainable-intrusion-detection-systems-using","title":"Explainable Intrusion Detection Systems Using Competitive Learning Techniques","date":"2023-03-30","arxiv_id":"2303.17387","n_code_links":0,"syntology":null},{"paper":null,"slug":"oberta-improving-sparse-transfer-learning-via","title":"oBERTa: Improving Sparse Transfer Learning via improved initialization, distillation, and pruning regimes","date":"2023-03-30","arxiv_id":"2303.17612","n_code_links":0,"syntology":null},{"paper":"/paper/sparsevit-revisiting-activation-sparsity-for","slug":"sparsevit-revisiting-activation-sparsity-for","title":"SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformer","date":"2023-03-30","arxiv_id":"2303.17605","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-emo-joint-pruning-with-multiple-sub","title":"A Multi-objective Complex Network Pruning Framework Based on Divide-and-conquer and Global Performance Impairment Ranking","date":"2023-03-28","arxiv_id":"2303.16212","n_code_links":0,"syntology":null},{"paper":"/paper/large-scale-training-data-search-for-object","slug":"large-scale-training-data-search-for-object","title":"Large-scale Training Data Search for Object Re-identification","date":"2023-03-28","arxiv_id":"2303.16186","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-second-order-attentive-context-for","title":"Learning Second-Order Attentive Context for Efficient Correspondence Pruning","date":"2023-03-28","arxiv_id":"2303.15761","n_code_links":0,"syntology":null},{"paper":null,"slug":"randomly-initialized-subnetworks-with","title":"Randomly Initialized Subnetworks with Iterative Weight Recycling","date":"2023-03-28","arxiv_id":"2303.15953","n_code_links":0,"syntology":null},{"paper":"/paper/improving-the-transferability-of-adversarial-5","slug":"improving-the-transferability-of-adversarial-5","title":"Improving the Transferability of Adversarial Examples via Direction Tuning","date":"2023-03-27","arxiv_id":"2303.15109","n_code_links":2,"syntology":null},{"paper":null,"slug":"transcode-co-design-of-transformers-and","title":"TransCODE: Co-design of Transformers and Accelerators for Efficient Training and Inference","date":"2023-03-27","arxiv_id":"2303.14882","n_code_links":0,"syntology":null}],"record_sha256":"45f85028171dec02639c89b8a33bc0d34a949a8381dcb902232c4da09e805c83","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}