{"total":177,"rows":[{"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":"2201.05596","title":"DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scale","created":"2022-01-14","cited_by_count":404,"area":"moe"},{"id":"2407.02490","title":"MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention","created":"2024-07-02","cited_by_count":383,"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":"2403.17887","title":"The Unreasonable Ineffectiveness of the Deeper Layers","created":"2024-03-26","cited_by_count":226,"area":"lr"},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170,"area":null},{"id":"2204.09656","title":"A Fast Post-Training Pruning Framework for Transformers","created":"2022-03-29","cited_by_count":162,"area":null},{"id":"2211.15583","title":"On the Effectiveness of Parameter-Efficient Fine-Tuning","created":"2022-11-28","cited_by_count":141,"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":"2204.00595","title":"Monarch: Expressive Structured Matrices for Efficient and Accurate Training","created":"2022-04-01","cited_by_count":106,"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":"2110.12894","title":"The Efficiency Misnomer","created":"2021-10-25","cited_by_count":98,"area":null},{"id":"2404.08555","title":"RLHF Deciphered: A Critical Analysis of Reinforcement Learning from Human Feedback for LLMs","created":"2024-04-12","cited_by_count":90,"area":"alignment"},{"id":"2401.08092","title":"A Survey of Resource-efficient LLM and Multimodal Foundation Models","created":"2024-01-16","cited_by_count":86,"area":null},{"id":"2310.07707","title":"MatFormer: Nested Transformer for Elastic Inference","created":"2023-10-11","cited_by_count":85,"area":null},{"id":"2402.02834","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","created":"2024-02-05","cited_by_count":82,"area":null},{"id":"2302.14017","title":"Full Stack Optimization of Transformer Inference: a Survey","created":"2023-02-27","cited_by_count":80,"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":"2111.05754","title":"Prune Once for All: Sparse Pre-Trained Language Models","created":"2021-11-10","cited_by_count":66,"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":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"area":null},{"id":"2210.07795","title":"EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruning","created":"2022-10-14","cited_by_count":56,"area":"mllm"},{"id":"2305.17530","title":"PuMer: Pruning and Merging Tokens for Efficient Vision Language Models","created":"2023-05-27","cited_by_count":53,"area":"mllm"},{"id":"2302.04089","title":"ZipLM: Inference-Aware Structured Pruning of Language Models","created":"2023-02-07","cited_by_count":49,"area":null},{"id":"2207.04606","title":"SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning","created":"2022-07-11","cited_by_count":47,"area":null},{"id":"2402.05964","title":"A Survey on Transformer Compression","created":"2024-02-05","cited_by_count":46,"area":null},{"id":"2202.07105","title":"A Survey on Model Compression and Acceleration for Pretrained Language Models","created":"2022-02-15","cited_by_count":45,"area":null},{"id":"2402.05406","title":"Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes","created":"2024-02-08","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":"2312.12728","title":"Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy","created":"2023-12-20","cited_by_count":37,"area":"inference"},{"id":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","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":"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":"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":"2401.12200","title":"APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inference","created":"2024-01-22","cited_by_count":29,"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":"2405.18218","title":"FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models","created":"2024-05-28","cited_by_count":27,"area":null},{"id":"2303.04185","title":"Gradient-Free Structured Pruning with Unlabeled Data","created":"2023-03-07","cited_by_count":26,"area":null},{"id":"2301.10936","title":"PIT: Optimization of Dynamic Sparse Deep Learning Models via Permutation Invariant Transformation","created":"2023-01-26","cited_by_count":25,"area":null},{"id":"2302.09632","title":"HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformers","created":"2023-02-19","cited_by_count":25,"area":"distill"},{"id":"2302.14705","title":"AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformers","created":"2023-02-28","cited_by_count":24,"area":null},{"id":"2301.12017","title":"Understanding INT4 Quantization for Transformer Models: Latency Speedup, Composability, and Failure Cases","created":"2023-01-27","cited_by_count":23,"area":null},{"id":"2312.01397","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","created":"2023-12-03","cited_by_count":23,"area":null},{"id":"2305.18396","title":"LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformers","created":"2023-05-28","cited_by_count":22,"area":null},{"id":"2207.02463","title":"Gender Biases and Where to Find Them: Exploring Gender Bias in Pre-Trained Transformer-based Language Models Using Movement Pruning","created":"2022-07-06","cited_by_count":21,"area":null},{"id":"2402.01799","title":"Faster and Lighter LLMs: A Survey on Current Challenges and Way Forward","created":"2024-02-02","cited_by_count":21,"area":null},{"id":"2205.12694","title":"Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models","created":"2022-05-25","cited_by_count":20,"area":null},{"id":"2211.07886","title":"A Survey for Efficient Open Domain Question Answering","created":"2022-11-15","cited_by_count":20,"area":null},{"id":"2203.12758","title":"Mokey: Enabling Narrow Fixed-Point Inference for Out-of-the-Box Floating-Point Transformer Models","created":"2022-03-23","cited_by_count":19,"area":null},{"id":"2205.05071","title":"Towards Climate Awareness in NLP Research","created":"2022-05-10","cited_by_count":19,"area":null},{"id":"2206.01859","title":"Extreme Compression for Pre-trained Transformers Made Simple and Efficient","created":"2022-06-04","cited_by_count":19,"area":"distill"},{"id":"2310.05015","title":"Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models","created":"2023-10-08","cited_by_count":19,"area":null},{"id":"2311.09758","title":"OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Tracking","created":"2023-11-16","cited_by_count":19,"area":null},{"id":"2205.15171","title":"Modular and On-demand Bias Mitigation with Attribute-Removal Subnetworks","created":"2022-05-30","cited_by_count":18,"area":null},{"id":"2307.00067","title":"Transformers in Healthcare: A Survey","created":"2023-06-30","cited_by_count":17,"area":null},{"id":"2209.06979","title":"Efficient Quantized Sparse Matrix Operations on Tensor Cores","created":"2022-09-14","cited_by_count":16,"area":null},{"id":"2310.09499","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","created":"2023-10-14","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":"2112.13896","title":"Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks","created":"2021-12-27","cited_by_count":15,"area":null},{"id":"2205.10036","title":"Exploring Extreme Parameter Compression for Pre-trained Language Models","created":"2022-05-20","cited_by_count":15,"area":null},{"id":"2210.06384","title":"GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods","created":"2022-10-12","cited_by_count":15,"area":null},{"id":"2211.02738","title":"Intriguing Properties of Compression on Multilingual Models","created":"2022-11-04","cited_by_count":15,"area":null},{"id":"2401.15347","title":"A Comprehensive Survey of Compression Algorithms for Language Models","created":"2024-01-27","cited_by_count":15,"area":null},{"id":"2410.17711","title":"Beware of Calibration Data for Pruning Large Language Models","created":"2024-10-23","cited_by_count":15,"area":null},{"id":"2203.00091","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism","created":"2022-02-28","cited_by_count":14,"area":null},{"id":"2302.04852","title":"SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks","created":"2023-02-09","cited_by_count":13,"area":null},{"id":"2310.02065","title":"VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores","created":"2023-10-03","cited_by_count":13,"area":null},{"id":"2310.02277","title":"Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","created":"2023-09-29","cited_by_count":13,"area":null},{"id":"2403.08058","title":"CHAI: Clustered Head Attention for Efficient LLM Inference","created":"2024-03-12","cited_by_count":13,"area":"inference"},{"id":"2211.10155","title":"Structured Pruning Adapters","created":"2022-11-17","cited_by_count":12,"area":null},{"id":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2312.15033","title":"Sparsity-Guided Holistic Explanation for LLMs with Interpretable Inference-Time Intervention","created":"2023-12-22","cited_by_count":12,"area":null},{"id":"2411.18615","title":"Proactive Gradient Conflict Mitigation in Multi-Task Learning: A Sparse Training Perspective","created":"2024-11-27","cited_by_count":12,"area":null},{"id":"2305.19549","title":"Accurate and Structured Pruning for Efficient Automatic Speech Recognition","created":"2023-05-31","cited_by_count":11,"area":null},{"id":"2306.14152","title":"Low-Rank Prune-And-Factorize for Language Model Compression","created":"2023-06-25","cited_by_count":11,"area":null},{"id":"2308.03449","title":"Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models","created":"2023-08-07","cited_by_count":11,"area":null},{"id":"2408.12568","title":"Pruning By Explaining Revisited: Optimizing Attribution Methods to Prune CNNs and Transformers","created":"2024-08-22","cited_by_count":11,"area":null},{"id":"2503.06823","title":"eMoE: Task-aware Memory Efficient Mixture-of-Experts-Based (MoE) Model Inference","created":"2025-03-10","cited_by_count":11,"area":"moe"},{"id":"2203.15996","title":"TextPruner: A Model Pruning Toolkit for Pre-Trained Language Models","created":"2022-03-30","cited_by_count":10,"area":null},{"id":"2403.03942","title":"The Heuristic Core: Understanding Subnetwork Generalization in Pretrained Language Models","created":"2024-03-06","cited_by_count":10,"area":null},{"id":"2405.03637","title":"Collage: Light-Weight Low-Precision Strategy for LLM Training","created":"2024-05-06","cited_by_count":10,"area":null},{"id":"2212.07634","title":"Gradient-based Intra-attention Pruning on Pre-trained Language Models","created":"2022-12-15","cited_by_count":9,"area":"distill"},{"id":"2407.09111","title":"Inference Optimization of Foundation Models on AI Accelerators","created":"2024-07-12","cited_by_count":9,"area":null},{"id":"2502.19159","title":"Sliding-Window Merging for Compacting Patch-Redundant Layers in LLMs","created":"2025-02-26","cited_by_count":9,"area":null},{"id":"2205.14107","title":"Spartan: Differentiable Sparsity via Regularized Transportation","created":"2022-05-27","cited_by_count":8,"area":null},{"id":"2305.09098","title":"Weight-Inherited Distillation for Task-Agnostic BERT Compression","created":"2023-05-16","cited_by_count":8,"area":"distill"},{"id":"2308.04637","title":"Sparse Binary Transformers for Multivariate Time Series Modeling","created":"2023-08-09","cited_by_count":8,"area":null},{"id":"2306.01841","title":"Binary and Ternary Natural Language Generation","created":"2023-06-02","cited_by_count":7,"area":null},{"id":"2310.10054","title":"NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Models","created":"2023-10-16","cited_by_count":7,"area":null},{"id":"2402.09773","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","created":"2024-02-15","cited_by_count":7,"area":null},{"id":"2409.09099","title":"S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training","created":"2024-09-13","cited_by_count":7,"area":null},{"id":"2501.17088","title":"Mamba-Shedder: Post-Transformer Compression for Efficient Selective Structured State Space Models","created":"2025-01-28","cited_by_count":7,"area":"ssm"},{"id":"2506.18623","title":"Efficient and Robust Speaker Diarization via Structured Pruning of Self-Supervised Models","created":"2025-06-23","cited_by_count":7,"area":"distill"},{"id":"2306.14393","title":"Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference","created":"2023-06-26","cited_by_count":6,"area":"inference"},{"id":"2310.08797","title":"A Comparative Analysis of Task-Agnostic Distillation Methods for Compressing Transformer Language Models","created":"2023-10-13","cited_by_count":6,"area":null},{"id":"2310.12126","title":"SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networks","created":"2023-10-18","cited_by_count":6,"area":null},{"id":"2405.20314","title":"S3D: A Simple and Cost-Effective Self-Speculative Decoding Scheme for Low-Memory GPUs","created":"2024-05-30","cited_by_count":6,"area":"inference"},{"id":"2511.13061","title":"MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity","created":"2025-11-17","cited_by_count":6,"area":null}],"next_cursor":"100"}