{"total":442,"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":"2310.06694","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","created":"2023-10-10","cited_by_count":415,"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":"2104.09044","title":"Distilling Knowledge via Knowledge Review","created":"2021-04-19","cited_by_count":288,"area":"distill"},{"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":"2402.05162","title":"Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modifications","created":"2024-02-07","cited_by_count":231,"area":"alignment"},{"id":"2301.12900","title":"DepGraph: Towards Any Structural Pruning","created":"2023-01-30","cited_by_count":203,"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":"2305.10924","title":"Structural Pruning for Diffusion Models","created":"2023-05-18","cited_by_count":195,"area":"diffusion"},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170,"area":null},{"id":"2407.14679","title":"Compact Language Models via Pruning and Knowledge Distillation","created":"2024-07-19","cited_by_count":148,"area":"distill"},{"id":"2108.06098","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","created":"2021-08-13","cited_by_count":141,"area":null},{"id":"2108.00708","title":"Group Fisher Pruning for Practical Network Compression","created":"2021-08-02","cited_by_count":131,"area":null},{"id":"2207.13243","title":"Toward Transparent AI: A Survey on Interpreting the Inner Structures of Deep Neural Networks","created":"2022-07-27","cited_by_count":129,"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":"2301.05603","title":"A Comprehensive Survey of Dataset Distillation","created":"2023-01-13","cited_by_count":115,"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":"2103.13258","title":"Dynamic Slimmable Network","created":"2021-03-24","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":"2110.13981","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","created":"2021-10-26","cited_by_count":78,"area":null},{"id":"2104.03438","title":"Convolutional Neural Network Pruning with Structural Redundancy Reduction","created":"2021-04-08","cited_by_count":73,"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":"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":"2103.03936","title":"Pufferfish: Communication-efficient Models At No Extra Cost","created":"2021-03-05","cited_by_count":61,"area":null},{"id":"2107.12422","title":"Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Framework","created":"2021-07-26","cited_by_count":52,"area":null},{"id":"2205.05676","title":"Revisiting Random Channel Pruning for Neural Network Compression","created":"2022-05-11","cited_by_count":50,"area":null},{"id":"2108.04657","title":"Differentiable Subset Pruning of Transformer Heads","created":"2021-08-10","cited_by_count":47,"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":"2208.02507","title":"ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsity","created":"2022-08-04","cited_by_count":45,"area":null},{"id":"2205.13571","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","created":"2022-05-26","cited_by_count":43,"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":"2111.03759","title":"MQBench: Towards Reproducible and Deployable Model Quantization Benchmark","created":"2021-11-05","cited_by_count":40,"area":null},{"id":"2111.15127","title":"A Unified Pruning Framework for Vision Transformers","created":"2021-11-30","cited_by_count":40,"area":null},{"id":"2103.00841","title":"Learning Frequency Domain Approximation for Binary Neural Networks","created":"2021-03-01","cited_by_count":38,"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":"2105.11228","title":"Towards Compact CNNs via Collaborative Compression","created":"2021-05-24","cited_by_count":36,"area":null},{"id":"2203.15794","title":"CHEX: CHannel EXploration for CNN Model Compression","created":"2022-03-29","cited_by_count":36,"area":null},{"id":"2104.14235","title":"Inspect, Understand, Overcome: A Survey of Practical Methods for AI Safety","created":"2021-04-29","cited_by_count":35,"area":null},{"id":"2209.13802","title":"Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention","created":"2022-09-28","cited_by_count":35,"area":"inference"},{"id":"2209.14635","title":"Compressed Gastric Image Generation Based on Soft-Label Dataset Distillation for Medical Data Sharing","created":"2022-09-29","cited_by_count":35,"area":null},{"id":"2402.15607","title":"How Do Nonlinear Transformers Learn and Generalize in In-Context Learning?","created":"2024-02-23","cited_by_count":35,"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.01198","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","created":"2022-06-02","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.06862","title":"OTOV2: Automatic, Generic, User-Friendly","created":"2023-03-13","cited_by_count":32,"area":null},{"id":"2106.02898","title":"Dynamic Resolution Network","created":"2021-06-05","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":"2112.14397","title":"EvoMoE: An Evolutional Mixture-of-Experts Training Framework via Dense-To-Sparse Gate","created":"2021-12-29","cited_by_count":30,"area":"moe"},{"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":"2106.06091","title":"DECORE: Deep Compression with Reinforcement Learning","created":"2021-06-11","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":"2105.03193","title":"Network Pruning That Matters: A Case Study on Retraining Variants","created":"2021-05-07","cited_by_count":25,"area":null},{"id":"2302.05601","title":"Pruning Deep Neural Networks from a Sparsity Perspective","created":"2023-02-11","cited_by_count":25,"area":null},{"id":"2410.14720","title":"SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Models","created":"2024-10-14","cited_by_count":25,"area":null},{"id":"2110.08232","title":"Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Prediction","created":"2021-10-15","cited_by_count":24,"area":null},{"id":"2310.03337","title":"Denoising Diffusion Step-aware Models","created":"2023-10-05","cited_by_count":24,"area":"diffusion"},{"id":"2403.05894","title":"Frequency Attention for Knowledge Distillation","created":"2024-03-09","cited_by_count":24,"area":"distill"},{"id":"2107.06569","title":"Importance-based Neuron Allocation for Multilingual Neural Machine Translation","created":"2021-07-14","cited_by_count":23,"area":null},{"id":"2203.04940","title":"Data-Efficient Structured Pruning via Submodular Optimization","created":"2022-03-09","cited_by_count":23,"area":null},{"id":"2308.07209","title":"Unified Data-Free Compression: Pruning and Quantization without Fine-Tuning","created":"2023-08-14","cited_by_count":23,"area":null},{"id":"2102.01670","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","created":"2021-02-02","cited_by_count":22,"area":null},{"id":"2103.14473","title":"Distilling a Powerful Student Model via Online Knowledge Distillation","created":"2021-03-26","cited_by_count":22,"area":"distill"},{"id":"2104.11883","title":"Carrying out CNN Channel Pruning in a White Box","created":"2021-04-24","cited_by_count":22,"area":null},{"id":"2102.07156","title":"ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations","created":"2021-02-14","cited_by_count":21,"area":null},{"id":"2405.16646","title":"A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts","created":"2024-05-26","cited_by_count":21,"area":"moe"},{"id":"2203.15331","title":"CNN Filter DB: An Empirical Investigation of Trained Convolutional Filters","created":"2022-03-29","cited_by_count":20,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2309.08513","title":"SCT: A Simple Baseline for Parameter-Efficient Fine-Tuning via Salient Channels","created":"2023-09-15","cited_by_count":20,"area":null},{"id":"2102.07804","title":"Scaling Up Exact Neural Network Compression by ReLU Stability","created":"2021-02-15","cited_by_count":19,"area":null},{"id":"2105.14797","title":"RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networks","created":"2021-05-31","cited_by_count":19,"area":null},{"id":"2110.01397","title":"RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Merging","created":"2021-09-30","cited_by_count":19,"area":null},{"id":"2205.11141","title":"OPQ: Compressing Deep Neural Networks with One-shot Pruning-Quantization","created":"2022-05-23","cited_by_count":19,"area":null},{"id":"2308.06689","title":"Estimator Meets Equilibrium Perspective: A Rectified Straight Through Estimator for Binary Neural Networks Training","created":"2023-08-13","cited_by_count":19,"area":null},{"id":"2406.07831","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","created":"2024-06-12","cited_by_count":19,"area":null},{"id":"2103.05152","title":"Knowledge Evolution in Neural Networks","created":"2021-03-09","cited_by_count":18,"area":null},{"id":"2111.03044","title":"A Unified Approach to Coreset Learning","created":"2021-11-04","cited_by_count":18,"area":null},{"id":"2403.12983","title":"OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization","created":"2024-03-02","cited_by_count":18,"area":null},{"id":"2108.08532","title":"An Information Theory-inspired Strategy for Automatic Network Pruning","created":"2021-08-19","cited_by_count":17,"area":null},{"id":"2208.04952","title":"Continual Prune-and-Select: Class-incremental learning with specialized subnetworks","created":"2022-08-09","cited_by_count":17,"area":null},{"id":"2402.00422","title":"Lightweight Pixel Difference Networks for Efficient Visual Representation Learning","created":"2024-02-01","cited_by_count":17,"area":null},{"id":"2101.07985","title":"Network Pruning using Adaptive Exemplar Filters","created":"2021-01-20","cited_by_count":16,"area":null},{"id":"2202.07190","title":"Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filters","created":"2022-02-15","cited_by_count":16,"area":null},{"id":"2212.03537","title":"Efficient Stein Variational Inference for Reliable Distribution-lossless Network Pruning","created":"2022-12-07","cited_by_count":16,"area":null},{"id":"2301.05219","title":"Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruning","created":"2023-01-12","cited_by_count":16,"area":null},{"id":"2407.02068","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","created":"2024-07-02","cited_by_count":16,"area":null},{"id":"2105.10065","title":"A Probabilistic Approach to Neural Network Pruning","created":"2021-05-20","cited_by_count":15,"area":null},{"id":"2201.03297","title":"GhostNets on Heterogeneous Devices via Cheap Operations","created":"2022-01-10","cited_by_count":15,"area":null},{"id":"2308.10438","title":"Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networks","created":"2023-08-21","cited_by_count":15,"area":null},{"id":"2310.15929","title":"E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsity","created":"2023-10-24","cited_by_count":15,"area":null},{"id":"2405.14377","title":"CoMERA: Computing- and Memory-Efficient Training via Rank-Adaptive Tensor Optimization","created":"2024-05-23","cited_by_count":15,"area":null},{"id":"2109.14710","title":"Convolutional Neural Network Compression through Generalized Kronecker Product Decomposition","created":"2021-09-29","cited_by_count":14,"area":null},{"id":"2110.07720","title":"Decomposing Convolutional Neural Networks into Reusable and Replaceable Modules","created":"2021-10-11","cited_by_count":14,"area":null},{"id":"2304.14271","title":"A Survey on Approximate Edge AI for Energy Efficient Autonomous Driving Services","created":"2023-04-13","cited_by_count":14,"area":null},{"id":"2308.13998","title":"Computation-efficient Deep Learning for Computer Vision: A Survey","created":"2023-08-27","cited_by_count":14,"area":null},{"id":"2104.15082","title":"Semantic Relation Preserving Knowledge Distillation for Image-to-Image Translation","created":"2021-04-30","cited_by_count":13,"area":"distill"},{"id":"2106.12718","title":"Sparse Flows: Pruning Continuous-depth Models","created":"2021-06-24","cited_by_count":13,"area":null},{"id":"2107.05033","title":"Blending Pruning Criteria for Convolutional Neural Networks","created":"2021-07-11","cited_by_count":13,"area":null}],"next_cursor":"100"}