{"total":70,"rows":[{"id":"2403.02181","title":"Not All Layers of LLMs Are Necessary During Inference","created":"2024-03-04","cited_by_count":96,"area":null},{"id":"2408.09632","title":"MoDeGPT: Modular Decomposition for Large Language Model Compression","created":"2024-08-19","cited_by_count":48,"area":null},{"id":"2405.16700","title":"Implicit Multimodal Alignment: On the Generalization of Frozen LLMs to Multimodal Inputs","created":"2024-05-26","cited_by_count":23,"area":null},{"id":"2410.14649","title":"EvoPress: Accurate Dynamic Model Compression via Evolutionary Search","created":"2024-10-18","cited_by_count":20,"area":null},{"id":"2406.16330","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","created":"2024-06-24","cited_by_count":19,"area":null},{"id":"2505.22689","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","created":"2025-05-28","cited_by_count":18,"area":null},{"id":"2501.17771","title":"2SSP: A Two-Stage Framework for Structured Pruning of LLMs","created":"2025-01-29","cited_by_count":12,"area":null},{"id":"2506.04179","title":"SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling","created":"2025-06-04","cited_by_count":11,"area":null},{"id":"2502.14816","title":"Dynamic Low-Rank Sparse Adaptation for Large Language Models","created":"2025-02-20","cited_by_count":10,"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":"2506.20353","title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","created":"2025-06-25","cited_by_count":8,"area":null},{"id":"2601.06787","title":"Garbage Attention in Large Language Models: BOS Sink Heads and Sink-aware Pruning","created":"2026-01-11","cited_by_count":8,"area":null},{"id":"2410.04808","title":"LPZero: Language Model Zero-cost Proxy Search from Zero","created":"2024-10-07","cited_by_count":7,"area":null},{"id":"2406.10576","title":"Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient","created":"2024-06-15","cited_by_count":6,"area":null},{"id":"2502.20727","title":"SPD: Sync-Point Drop for Efficient Tensor Parallelism of Large Language Models","created":"2025-02-28","cited_by_count":6,"area":null},{"id":"2510.15304","title":"Layer as Puzzle Pieces: Compressing Large Language Models through Layer Concatenation","created":"2025-10-17","cited_by_count":6,"area":null},{"id":"2501.00339","title":"GRASP: Replace Redundant Layers with Adaptive Singular Parameters for Efficient Model Compression","created":"2024-12-31","cited_by_count":5,"area":null},{"id":"2507.18212","title":"Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation","created":"2025-07-24","cited_by_count":5,"area":null},{"id":"2501.19090","title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models","created":"2025-01-31","cited_by_count":4,"area":null},{"id":"2502.12594","title":"PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recovery","created":"2025-02-18","cited_by_count":4,"area":null},{"id":"2505.24680","title":"A Simple Linear Patch Revives Layer-Pruned Large Language Models","created":"2025-05-30","cited_by_count":4,"area":null},{"id":"2508.05239","title":"Pruning Large Language Models by Identifying and Preserving Functional Networks","created":"2025-08-07","cited_by_count":4,"area":null},{"id":"2501.17905","title":"DReSS: Data-driven Regularized Structured Streamlining for Large Language Models","created":"2025-01-29","cited_by_count":3,"area":null},{"id":"2502.04348","title":"Prompt-based Depth Pruning of Large Language Models","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2505.18232","title":"Two-Stage Regularization-Based Structured Pruning for LLMs","created":"2025-05-23","cited_by_count":3,"area":null},{"id":"2506.02818","title":"ProcrustesGPT: Compressing LLMs with Structured Matrices and Orthogonal Transformations","created":"2025-06-03","cited_by_count":3,"area":null},{"id":"2511.02213","title":"IG-Pruning: Input-Guided Block Pruning for Large Language Models","created":"2025-11-04","cited_by_count":3,"area":null},{"id":"2602.07804","title":"Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models","created":"2026-02-08","cited_by_count":3,"area":null},{"id":"2603.18426","title":"Prune-then-Quantize or Quantize-then-Prune? Understanding the Impact of Compression Order in Joint Model Compression","created":"2026-03-19","cited_by_count":3,"area":null},{"id":"2411.10272","title":"P$^2$ Law: Scaling Law for Post-Training After Model Pruning","created":"2024-11-15","cited_by_count":2,"area":null},{"id":"2411.14507","title":"From Pruning to Grafting: Dynamic Knowledge Redistribution via Learnable Layer Fusion","created":"2024-11-21","cited_by_count":2,"area":null},{"id":"2502.14910","title":"EvoP: Robust LLM Inference via Evolutionary Pruning","created":"2025-02-19","cited_by_count":2,"area":null},{"id":"2503.08524","title":"Position-Aware Depth Decay Decoding ($D^3$): Boosting Large Language Model Inference Efficiency","created":"2025-03-11","cited_by_count":2,"area":null},{"id":"2503.18646","title":"ZeroLM: Data-Free Transformer Architecture Search for Language Models","created":"2025-03-24","cited_by_count":2,"area":null},{"id":"2506.03510","title":"Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information","created":"2025-06-04","cited_by_count":2,"area":null},{"id":"2510.22767","title":"TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination","created":"2025-10-26","cited_by_count":2,"area":null},{"id":"2510.23652","title":"The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models","created":"2025-10-25","cited_by_count":2,"area":null},{"id":"2510.25979","title":"AttnCache: Accelerating Self-Attention Inference for LLM Prefill via Attention Cache","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2601.07212","title":"MI-PRUN: Optimize Large Language Model Pruning via Mutual Information","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2602.08858","title":"FlattenGPT: Depth Compression for Transformer with Layer Flattening","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2605.15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","created":"2026-05-15","cited_by_count":2,"area":null},{"id":"2605.27786","title":"Locality-Aware Redundancy Pruning for LLM Depth Compression","created":"2026-05-27","cited_by_count":2,"area":null},{"id":"2501.15278","title":"PIP: Perturbation-based Iterative Pruning for Large Language Models","created":"2025-01-25","cited_by_count":1,"area":null},{"id":"2503.23924","title":"Model Hemorrhage and the Robustness Limits of Large Language Models","created":"2025-03-31","cited_by_count":1,"area":null},{"id":"2506.02561","title":"Pruning General Large Language Models into Customized Expert Models","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2510.10136","title":"PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Models","created":"2025-10-11","cited_by_count":1,"area":null},{"id":"2602.00161","title":"LLM Compression by Block Removal with Constrained Binary Optimization","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2604.19520","title":"SimDiff: Depth Pruning via Similarity and Difference","created":"2026-04-21","cited_by_count":1,"area":null},{"id":"2605.16234","title":"No Free Swap: Protocol-Dependent Layer Redundancy in Transformers","created":"2026-05-15","cited_by_count":1,"area":null},{"id":"2606.09514","title":"BUDDY: BUdget-Driven DYnamic Depth Routing for Adaptive Large Language Model Inference","created":"2026-06-08","cited_by_count":1,"area":null},{"id":"2606.14150","title":"Small LLMs: Pruning vs. Training from Scratch","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2608.19670","title":"The Asymmetric Harms of LLM Compression","created":"2026-08-20","cited_by_count":1,"area":null},{"id":"2410.12513","title":"FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reduction","created":"2024-10-16","cited_by_count":0,"area":null},{"id":"2509.06836","title":"COMPACT: Common-token Optimized Model Pruning Across Channels and Tokens","created":"2025-09-08","cited_by_count":0,"area":null},{"id":"2510.13860","title":"ShishuLM : Achieving Optimal and Efficient Parameterization with Low Attention Transformer Models","created":"2025-10-13","cited_by_count":0,"area":null},{"id":"2511.17205","title":"E$^3$-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2511.19986","title":"On-Demand Multi-Task Sparsity for Efficient Large-Model Deployment on Edge Devices","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2512.22174","title":"BitFlipScope: Scalable Fault Localization and Recovery for Bit-Flip Corruptions in LLMs","created":"2025-12-18","cited_by_count":0,"area":null},{"id":"2601.19089","title":"EPAS: Efficient Training with Progressive Activation Sharing","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.10431","title":"QTALE: Quantization-Robust Token-Adaptive Layer Execution for LLMs","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2603.23985","title":"Diet Your LLM: Dimension-wise Global Pruning of LLMs via Merging Task-specific Importance Score","created":"2026-03-25","cited_by_count":0,"area":null},{"id":"2604.21952","title":"Focus Session: Hardware and Software Techniques for Accelerating Multimodal Foundation Models","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2605.14738","title":"TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2606.01544","title":"CRePE: Convolution-aware Relative Importance in Post-training Pruning with Efficient Search","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2606.26538","title":"CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry","created":"2026-06-25","cited_by_count":0,"area":null},{"id":"2608.12953","title":"Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization","created":"2026-08-13","cited_by_count":0,"area":null},{"id":"2608.21142","title":"COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models","created":"2026-08-21","cited_by_count":0,"area":null},{"id":"2609.02083","title":"XMerge: Cross-Axis Selection and Reconstructive Layer Merging for LLM Depth Compression","created":"2026-09-02","cited_by_count":0,"area":null},{"id":"2609.32124","title":"What Should We Freeze? Guarded Freezing: Connectivity Shapes the Fine-Tuning of Pretrained Models","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2610.15781","title":"Heterogeneous Structured Pruning Under Resource Constraints for Hardware-Efficient Large Language Models","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}