{"total":603,"rows":[{"id":"2112.11446","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","created":"2021-12-08","cited_by_count":1202,"area":null},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121,"area":null},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800,"area":null},{"id":"2311.03099","title":"Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunch","created":"2023-11-06","cited_by_count":694,"area":null},{"id":"2311.18259","title":"Ego-Exo4D: Understanding Skilled Human Activity from First- and Third-Person Perspectives","created":"2023-11-30","cited_by_count":490,"area":null},{"id":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385,"area":null},{"id":"2208.11580","title":"Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning","created":"2022-08-24","cited_by_count":322,"area":null},{"id":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223,"area":null},{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183,"area":null},{"id":"2310.05175","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","created":"2023-10-08","cited_by_count":165,"area":null},{"id":"2106.08962","title":"Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better","created":"2021-06-16","cited_by_count":154,"area":null},{"id":"2109.05687","title":"Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning","created":"2021-09-13","cited_by_count":146,"area":null},{"id":"2203.11086","title":"Overcoming Oscillations in Quantization-Aware Training","created":"2022-03-21","cited_by_count":119,"area":null},{"id":"2203.07259","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","created":"2022-03-14","cited_by_count":115,"area":"inference"},{"id":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110,"area":null},{"id":"2310.01334","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","created":"2023-10-02","cited_by_count":108,"area":"moe"},{"id":"2204.00595","title":"Monarch: Expressive Structured Matrices for Efficient and Accurate Training","created":"2022-04-01","cited_by_count":106,"area":null},{"id":"2206.09557","title":"LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models","created":"2022-06-20","cited_by_count":105,"area":null},{"id":"2306.11222","title":"LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximation","created":"2023-06-20","cited_by_count":104,"area":null},{"id":"2308.07026","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learning","created":"2023-08-14","cited_by_count":103,"area":null},{"id":"2107.10845","title":"QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits","created":"2021-07-22","cited_by_count":98,"area":null},{"id":"2202.02643","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","created":"2022-02-05","cited_by_count":85,"area":null},{"id":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84,"area":null},{"id":"2406.11617","title":"DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Sampling","created":"2024-06-17","cited_by_count":81,"area":null},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79,"area":null},{"id":"2206.12562","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","created":"2022-06-25","cited_by_count":79,"area":null},{"id":"2112.00029","title":"Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models","created":"2021-11-30","cited_by_count":76,"area":null},{"id":"2106.02890","title":"Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?","created":"2021-06-05","cited_by_count":75,"area":null},{"id":"2212.07048","title":"PD-Quant: Post-Training Quantization based on Prediction Difference Metric","created":"2022-12-14","cited_by_count":73,"area":null},{"id":"2108.04974","title":"SoK: How Robust is Image Classification Deep Neural Network Watermarking? (Extended Version)","created":"2021-08-11","cited_by_count":69,"area":null},{"id":"2304.04947","title":"Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inference","created":"2023-04-11","cited_by_count":69,"area":null},{"id":"2111.05754","title":"Prune Once for All: Sparse Pre-Trained Language Models","created":"2021-11-10","cited_by_count":66,"area":null},{"id":"2205.07877","title":"A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classification","created":"2022-05-14","cited_by_count":65,"area":null},{"id":"2402.09748","title":"Model Compression and Efficient Inference for Large Language Models: A Survey","created":"2024-02-15","cited_by_count":64,"area":null},{"id":"2103.03014","title":"Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracy","created":"2021-03-04","cited_by_count":62,"area":null},{"id":"2106.09129","title":"A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustness","created":"2021-06-16","cited_by_count":62,"area":null},{"id":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"area":null},{"id":"2101.09336","title":"A Comprehensive Survey on Hardware-Aware Neural Architecture Search","created":"2021-01-22","cited_by_count":61,"area":null},{"id":"2103.03936","title":"Pufferfish: Communication-efficient Models At No Extra Cost","created":"2021-03-05","cited_by_count":61,"area":null},{"id":"2202.08602","title":"Fingerprinting Deep Neural Networks Globally via Universal Adversarial Perturbations","created":"2022-02-17","cited_by_count":61,"area":null},{"id":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61,"area":null},{"id":"2503.10657","title":"RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMs","created":"2025-03-08","cited_by_count":61,"area":null},{"id":"2106.12379","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","created":"2021-06-23","cited_by_count":59,"area":null},{"id":"2101.11714","title":"TT-Rec: Tensor Train Compression for Deep Learning Recommendation Models","created":"2021-01-25","cited_by_count":58,"area":null},{"id":"2403.15447","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","created":"2024-03-18","cited_by_count":57,"area":null},{"id":"2103.10559","title":"CDFI: Compression-Driven Network Design for Frame Interpolation","created":"2021-03-18","cited_by_count":56,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2109.11369","title":"Recent Advances of Continual Learning in Computer Vision: An Overview","created":"2021-09-23","cited_by_count":55,"area":null},{"id":"2107.03356","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","created":"2021-07-07","cited_by_count":54,"area":null},{"id":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"area":null},{"id":"2404.06448","title":"Automated Federated Pipeline for Parameter-Efficient Fine-Tuning of Large Language Models","created":"2024-04-09","cited_by_count":49,"area":null},{"id":"2102.11343","title":"Understanding Catastrophic Forgetting and Remembering in Continual Learning with Optimal Relevance Mapping","created":"2021-02-22","cited_by_count":48,"area":null},{"id":"2105.09259","title":"Learning Language Specific Sub-network for Multilingual Machine Translation","created":"2021-05-19","cited_by_count":48,"area":null},{"id":"2404.03233","title":"Learn What You Want to Unlearn: Unlearning Inversion Attacks against Machine Unlearning","created":"2024-04-04","cited_by_count":48,"area":"safety"},{"id":"2108.04657","title":"Differentiable Subset Pruning of Transformer Heads","created":"2021-08-10","cited_by_count":47,"area":null},{"id":"2110.03036","title":"The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translation","created":"2021-10-06","cited_by_count":47,"area":null},{"id":"2307.02973","title":"Pruning vs Quantization: Which is Better?","created":"2023-07-06","cited_by_count":46,"area":null},{"id":"2402.05964","title":"A Survey on Transformer Compression","created":"2024-02-05","cited_by_count":46,"area":null},{"id":"2101.08940","title":"Hessian-Aware Pruning and Optimal Neural Implant","created":"2021-01-22","cited_by_count":45,"area":null},{"id":"2105.01571","title":"Effective Sparsification of Neural Networks with Global Sparsity Constraint","created":"2021-05-03","cited_by_count":45,"area":null},{"id":"2201.11692","title":"SSLGuard: A Watermarking Scheme for Self-supervised Learning Pre-trained Encoders","created":"2022-01-27","cited_by_count":45,"area":null},{"id":"2106.14568","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","created":"2021-06-28","cited_by_count":44,"area":null},{"id":"2511.13653","title":"Weight-sparse transformers have interpretable circuits","created":"2025-11-17","cited_by_count":44,"area":"mechinterp"},{"id":"2101.05108","title":"Fast convolutional neural networks on FPGAs with hls4ml","created":"2021-01-13","cited_by_count":42,"area":null},{"id":"2306.03805","title":"The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter","created":"2023-06-06","cited_by_count":42,"area":null},{"id":"2402.09977","title":"Fast Vocabulary Transfer for Language Model Compression","created":"2024-02-15","cited_by_count":42,"area":null},{"id":"2104.08682","title":"Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigm","created":"2021-04-18","cited_by_count":40,"area":null},{"id":"2302.14623","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","created":"2023-02-28","cited_by_count":40,"area":null},{"id":"2111.06061","title":"Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI","created":"2021-11-11","cited_by_count":39,"area":null},{"id":"2203.04570","title":"CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Prediction","created":"2022-03-09","cited_by_count":39,"area":null},{"id":"2402.10193","title":"BitDelta: Your Fine-Tune May Only Be Worth One Bit","created":"2024-02-15","cited_by_count":39,"area":null},{"id":"2402.12479","title":"In value-based deep reinforcement learning, a pruned network is a good network","created":"2024-02-19","cited_by_count":39,"area":"deeprl"},{"id":"2210.03044","title":"Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?","created":"2022-10-06","cited_by_count":38,"area":null},{"id":"2407.09590","title":"Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts","created":"2024-07-12","cited_by_count":37,"area":"moe"},{"id":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","cited_by_count":36,"area":null},{"id":"2410.10912","title":"AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models","created":"2024-10-14","cited_by_count":36,"area":null},{"id":"2307.07982","title":"A Survey of Techniques for Optimizing Transformer Inference","created":"2023-07-16","cited_by_count":35,"area":null},{"id":"2202.08132","title":"Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradients","created":"2022-02-16","cited_by_count":34,"area":null},{"id":"2202.12002","title":"Rare Gems: Finding Lottery Tickets at Initialization","created":"2022-02-24","cited_by_count":34,"area":null},{"id":"2103.06132","title":"MixMo: Mixing Multiple Inputs for Multiple Outputs via Deep Subnetworks","created":"2021-03-10","cited_by_count":32,"area":null},{"id":"2206.06662","title":"Learning Best Combination for Efficient N:M Sparsity","created":"2022-06-14","cited_by_count":32,"area":null},{"id":"2307.12280","title":"Downstream-agnostic Adversarial Examples","created":"2023-07-23","cited_by_count":32,"area":null},{"id":"2202.02340","title":"Selective Network Linearization for Efficient Private Inference","created":"2022-02-04","cited_by_count":31,"area":null},{"id":"2111.05685","title":"Efficient Neural Network Training via Forward and Backward Propagation Sparsification","created":"2021-11-10","cited_by_count":30,"area":null},{"id":"2205.15043","title":"RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch","created":"2022-05-30","cited_by_count":30,"area":null},{"id":"2302.03773","title":"What Matters In The Structured Pruning of Generative Language Models?","created":"2023-02-07","cited_by_count":30,"area":null},{"id":"2403.07839","title":"MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metric","created":"2024-03-12","cited_by_count":30,"area":"mllm"},{"id":"2406.04101","title":"How Far Can We Compress Instant-NGP-Based NeRF?","created":"2024-06-06","cited_by_count":30,"area":null},{"id":"2105.09564","title":"Dual-side Sparse Tensor Core","created":"2021-05-20","cited_by_count":29,"area":null},{"id":"2109.02220","title":"GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarization","created":"2021-09-06","cited_by_count":29,"area":null},{"id":"2401.04472","title":"A Survey on Efficient Federated Learning Methods for Foundation Model Training","created":"2024-01-09","cited_by_count":29,"area":null},{"id":"2205.14550","title":"Machine Learning for Microcontroller-Class Hardware: A Review","created":"2022-05-29","cited_by_count":28,"area":null},{"id":"2303.10464","title":"SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Models","created":"2023-03-18","cited_by_count":28,"area":null},{"id":"2205.11005","title":"Parameter-Efficient Sparsity for Large Language Models Fine-Tuning","created":"2022-05-23","cited_by_count":27,"area":null},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27,"area":null},{"id":"2309.11932","title":"A Machine Learning-oriented Survey on Tiny Machine Learning","created":"2023-09-21","cited_by_count":27,"area":null},{"id":"2101.09048","title":"Selfish Sparse RNN Training","created":"2021-01-22","cited_by_count":26,"area":null},{"id":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26,"area":null}],"next_cursor":"100"}