{"total":730,"rows":[{"id":"2103.13630","title":"A Survey of Quantization Methods for Efficient Neural Network Inference","created":"2021-03-25","cited_by_count":815,"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.17245","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","created":"2023-11-28","cited_by_count":436,"area":null},{"id":"2101.09671","title":"Pruning and Quantization for Deep Neural Network Acceleration: A Survey","created":"2021-01-24","cited_by_count":263,"area":null},{"id":"2310.17157","title":"Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Time","created":"2023-10-26","cited_by_count":252,"area":null},{"id":"2312.12148","title":"Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment","created":"2023-12-19","cited_by_count":230,"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":"2101.08134","title":"Zero-Cost Proxies for Lightweight NAS","created":"2021-01-20","cited_by_count":199,"area":null},{"id":"2102.13451","title":"FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropout","created":"2021-02-26","cited_by_count":192,"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":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179,"area":null},{"id":"2102.11535","title":"Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspective","created":"2021-02-23","cited_by_count":169,"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":"2207.03620","title":"More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsity","created":"2022-07-07","cited_by_count":142,"area":null},{"id":"2301.08727","title":"Neural Architecture Search: Insights from 1000 Papers","created":"2023-01-20","cited_by_count":139,"area":null},{"id":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"area":null},{"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":"2102.08124","title":"Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks","created":"2021-02-16","cited_by_count":103,"area":null},{"id":"2104.01177","title":"How Powerful are Performance Predictors in Neural Architecture Search?","created":"2021-04-02","cited_by_count":90,"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":"2304.01195","title":"Not All Features Matter: Enhancing Few-shot CLIP with Adaptive Prior Refinement","created":"2023-04-03","cited_by_count":84,"area":null},{"id":"2210.04284","title":"SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters","created":"2022-10-09","cited_by_count":83,"area":null},{"id":"2110.14032","title":"MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge","created":"2021-10-26","cited_by_count":79,"area":null},{"id":"2203.08243","title":"Unified Visual Transformer Compression","created":"2022-03-15","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":"2110.13981","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","created":"2021-10-26","cited_by_count":78,"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":"2310.02025","title":"DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training","created":"2023-10-03","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":"2107.07467","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","created":"2021-07-15","cited_by_count":70,"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":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61,"area":null},{"id":"2310.08915","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","created":"2023-10-13","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":"2301.11300","title":"ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradients","created":"2023-01-26","cited_by_count":58,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2103.09377","title":"Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Network","created":"2021-03-17","cited_by_count":55,"area":null},{"id":"2112.09824","title":"Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better","created":"2021-12-18","cited_by_count":55,"area":null},{"id":"2209.09476","title":"SparCL: Sparse Continual Learning on the Edge","created":"2022-09-20","cited_by_count":55,"area":null},{"id":"2106.05933","title":"PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition","created":"2021-06-10","cited_by_count":53,"area":null},{"id":"2305.18403","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","created":"2023-05-28","cited_by_count":53,"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.05193","title":"A Survey on Green Deep Learning","created":"2021-11-08","cited_by_count":52,"area":null},{"id":"2408.13656","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","created":"2024-08-24","cited_by_count":50,"area":null},{"id":"2110.00296","title":"Powerpropagation: A sparsity inducing weight reparameterisation","created":"2021-10-01","cited_by_count":49,"area":null},{"id":"2110.14678","title":"Meta-Learning Sparse Implicit Neural Representations","created":"2021-10-27","cited_by_count":48,"area":null},{"id":"2210.12782","title":"Compressing Explicit Voxel Grid Representations: fast NeRFs become also small","created":"2022-10-23","cited_by_count":48,"area":null},{"id":"2402.02769","title":"Learning from Teaching Regularization: Generalizable Correlations Should be Easy to Imitate","created":"2024-02-05","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":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"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":"2101.00234","title":"Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformers","created":"2021-01-01","cited_by_count":43,"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":"2103.06460","title":"Recent Advances on Neural Network Pruning at Initialization","created":"2021-03-11","cited_by_count":41,"area":null},{"id":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41,"area":null},{"id":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","cited_by_count":41,"area":null},{"id":"2210.06659","title":"Structural Pruning via Latency-Saliency Knapsack","created":"2022-10-13","cited_by_count":41,"area":null},{"id":"2406.02924","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","created":"2024-06-05","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":"2302.01107","title":"A Survey on Efficient Training of Transformers","created":"2023-02-02","cited_by_count":39,"area":null},{"id":"2110.12007","title":"When to Prune? A Policy towards Early Structural Pruning","created":"2021-10-22","cited_by_count":38,"area":null},{"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":"2404.07236","title":"Lightweight Deep Learning for Resource-Constrained Environments: A Survey","created":"2024-04-08","cited_by_count":38,"area":null},{"id":"2203.15794","title":"CHEX: CHannel EXploration for CNN Model Compression","created":"2022-03-29","cited_by_count":36,"area":null},{"id":"2210.03230","title":"NAS-Bench-Suite-Zero: Accelerating Research on Zero Cost Proxies","created":"2022-10-06","cited_by_count":36,"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":"2203.12217","title":"Training-free Transformer Architecture Search","created":"2022-03-23","cited_by_count":33,"area":null},{"id":"2103.16886","title":"Neural Response Interpretation through the Lens of Critical Pathways","created":"2021-03-31","cited_by_count":32,"area":null},{"id":"2110.13041","title":"Applications and Techniques for Fast Machine Learning in Science","created":"2021-10-25","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":"2303.03428","title":"Towards provably efficient quantum algorithms for large-scale machine-learning models","created":"2023-03-06","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":"2210.13738","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","created":"2022-10-25","cited_by_count":31,"area":null},{"id":"2406.16797","title":"Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs","created":"2024-06-24","cited_by_count":31,"area":null},{"id":"2110.11395","title":"SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning","created":"2021-10-19","cited_by_count":30,"area":null},{"id":"2111.11146","title":"On the Existence of Universal Lottery Tickets","created":"2021-11-22","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":"2207.10888","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","created":"2022-07-22","cited_by_count":30,"area":null},{"id":"2304.02840","title":"NTK-SAP: Improving neural network pruning by aligning training dynamics","created":"2023-04-06","cited_by_count":30,"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":"2308.10134","title":"AutoReP: Automatic ReLU Replacement for Fast Private Network Inference","created":"2023-08-20","cited_by_count":29,"area":null},{"id":"2107.05802","title":"How many degrees of freedom do we need to train deep networks: a loss landscape perspective","created":"2021-07-13","cited_by_count":28,"area":null},{"id":"2109.00817","title":"NASI: Label- and Data-agnostic Neural Architecture Search at Initialization","created":"2021-09-02","cited_by_count":28,"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":"2403.19232","title":"AZ-NAS: Assembling Zero-Cost Proxies for Network Architecture Search","created":"2024-03-28","cited_by_count":28,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2203.04248","title":"Dual Lottery Ticket Hypothesis","created":"2022-03-08","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":"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},{"id":"2206.08684","title":"Sparse Double Descent: Where Network Pruning Aggravates Overfitting","created":"2022-06-17","cited_by_count":26,"area":null},{"id":"2206.12755","title":"Training Your Sparse Neural Network Better with Any Mask","created":"2022-06-26","cited_by_count":26,"area":null},{"id":"2207.01382","title":"Exploring Lottery Ticket Hypothesis in Spiking Neural Networks","created":"2022-07-04","cited_by_count":26,"area":null}],"next_cursor":"100"}