{"total":94,"rows":[{"id":"2312.12456","title":"PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU","created":"2023-12-16","cited_by_count":217,"area":null},{"id":"2403.19708","title":"Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttention","created":"2024-03-23","cited_by_count":163,"area":"inference"},{"id":"2403.05527","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","created":"2024-03-08","cited_by_count":158,"area":"inference"},{"id":"2312.04985","title":"SparQ Attention: Bandwidth-Efficient LLM Inference","created":"2023-12-08","cited_by_count":119,"area":"inference"},{"id":"2402.07033","title":"Fiddler: CPU-GPU Orchestration for Fast Inference of Mixture-of-Experts Models","created":"2024-02-10","cited_by_count":71,"area":"moe"},{"id":"2402.03804","title":"ReLU$^2$ Wins: Discovering Efficient Activation Functions for Sparse LLMs","created":"2024-02-06","cited_by_count":67,"area":null},{"id":"2408.14690","title":"Training-Free Activation Sparsity in Large Language Models","created":"2024-08-26","cited_by_count":55,"area":"inference"},{"id":"2402.13516","title":"ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Models","created":"2024-02-21","cited_by_count":45,"area":"inference"},{"id":"2404.08763","title":"CATS: Contextually-Aware Thresholding for Sparsity in Large Language Models","created":"2024-04-12","cited_by_count":41,"area":null},{"id":"2406.05955","title":"Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameters","created":"2024-06-10","cited_by_count":38,"area":"moe"},{"id":"2503.01776","title":"Beyond Matryoshka: Revisiting Sparse Coding for Adaptive Representation","created":"2025-03-03","cited_by_count":26,"area":null},{"id":"2407.10969","title":"Q-Sparse: All Large Language Models can be Fully Sparsely-Activated","created":"2024-07-15","cited_by_count":25,"area":null},{"id":"2503.07639","title":"Mixture of Experts Made Intrinsically Interpretable","created":"2025-03-05","cited_by_count":24,"area":"moe"},{"id":"2409.02877","title":"Configurable Foundation Models: Building LLMs from a Modular Perspective","created":"2024-09-04","cited_by_count":22,"area":null},{"id":"2411.02335","title":"Sparsing Law: Towards Large Language Models with Greater Activation Sparsity","created":"2024-11-04","cited_by_count":22,"area":null},{"id":"2404.01365","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","created":"2024-04-01","cited_by_count":21,"area":"moe"},{"id":"2504.19449","title":"R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference","created":"2025-04-28","cited_by_count":21,"area":"inference"},{"id":"2402.06126","title":"Learn To be Efficient: Build Structured Sparsity in Large Language Models","created":"2024-02-09","cited_by_count":20,"area":null},{"id":"2501.02086","title":"Instruction-Following Pruning for Large Language Models","created":"2025-01-03","cited_by_count":17,"area":null},{"id":"2501.15296","title":"You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning","created":"2025-01-25","cited_by_count":17,"area":null},{"id":"2410.05437","title":"ESPACE: Dimensionality Reduction of Activations for Model Compression","created":"2024-10-07","cited_by_count":15,"area":null},{"id":"2412.01380","title":"Efficient LLM Inference using Dynamic Input Pruning and Cache-Aware Masking","created":"2024-12-02","cited_by_count":11,"area":"inference"},{"id":"2405.16486","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","created":"2024-05-26","cited_by_count":10,"area":"moe"},{"id":"2505.05950","title":"FloE: On-the-Fly MoE Inference on Memory-constrained GPU","created":"2025-05-09","cited_by_count":9,"area":"moe"},{"id":"2506.16500","title":"SparseLoRA: Accelerating LLM Fine-Tuning with Contextual Sparsity","created":"2025-06-19","cited_by_count":9,"area":null},{"id":"2402.02362","title":"Unification of Symmetries Inside Neural Networks: Transformer, Feedforward and Neural ODE","created":"2024-02-04","cited_by_count":7,"area":null},{"id":"2402.09360","title":"HiRE: High Recall Approximate Top-$k$ Estimation for Efficient LLM Inference","created":"2024-02-14","cited_by_count":7,"area":"inference"},{"id":"2409.01990","title":"Designing Large Foundation Models for Efficient Training and Inference: A Survey","created":"2024-09-03","cited_by_count":7,"area":null},{"id":"2502.00840","title":"Activation Approximations Can Incur Safety Vulnerabilities Even in Aligned LLMs: Comprehensive Analysis and Defense","created":"2025-02-02","cited_by_count":7,"area":null},{"id":"2505.22913","title":"Mustafar: Promoting Unstructured Sparsity for KV Cache Pruning in LLM Inference","created":"2025-05-28","cited_by_count":7,"area":"inference"},{"id":"2509.00454","title":"Universal Properties of Activation Sparsity in Modern Large Language Models","created":"2025-08-30","cited_by_count":7,"area":null},{"id":"2312.09084","title":"Language Modeling on a SpiNNaker 2 Neuromorphic Chip","created":"2023-12-14","cited_by_count":6,"area":null},{"id":"2403.07688","title":"Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neurons","created":"2024-03-12","cited_by_count":6,"area":null},{"id":"2406.17989","title":"Learning Neural Networks with Sparse Activations","created":"2024-06-26","cited_by_count":6,"area":null},{"id":"2505.14884","title":"Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsity","created":"2025-05-20","cited_by_count":6,"area":null},{"id":"2506.20194","title":"DuoGPT: Training-free Dual Sparsity through Activation-aware Pruning in LLMs","created":"2025-06-25","cited_by_count":6,"area":null},{"id":"2507.01299","title":"La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation","created":"2025-07-02","cited_by_count":6,"area":null},{"id":"2507.08771","title":"BlockFFN: Towards End-Side Acceleration-Friendly Mixture-of-Experts with Chunk-Level Activation Sparsity","created":"2025-07-11","cited_by_count":6,"area":"moe"},{"id":"2602.05735","title":"CSRv2: Unlocking Ultra-Sparse Embeddings","created":"2026-02-05","cited_by_count":6,"area":null},{"id":"2406.02529","title":"ReLUs Are Sufficient for Learning Implicit Neural Representations","created":"2024-06-04","cited_by_count":5,"area":null},{"id":"2410.03440","title":"Exploring the Benefit of Activation Sparsity in Pre-training","created":"2024-10-04","cited_by_count":5,"area":"moe"},{"id":"2410.19274","title":"Neuralink: Fast LLM Inference on Smartphones with Neuron Co-Activation Linking","created":"2024-10-25","cited_by_count":5,"area":null},{"id":"2412.07174","title":"Post-Training Statistical Calibration for Higher Activation Sparsity","created":"2024-12-10","cited_by_count":5,"area":null},{"id":"2502.05967","title":"$\\mu$nit Scaling: Simple and Scalable FP8 LLM Training","created":"2025-02-09","cited_by_count":5,"area":null},{"id":"2503.16916","title":"Temporal Action Detection Model Compression by Progressive Block Drop","created":"2025-03-21","cited_by_count":5,"area":null},{"id":"2506.06644","title":"Spark Transformer: Reactivating Sparsity in FFN and Attention","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2502.07783","title":"Curvature Tuning: Provable Training-free Model Steering From a Single Parameter","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2503.12167","title":"PLM: Efficient Peripheral Language Models Hardware-Co-Designed for Ubiquitous Computing","created":"2025-03-15","cited_by_count":4,"area":null},{"id":"2505.07239","title":"Comet: Accelerating Private Inference for Large Language Model by Predicting Activation Sparsity","created":"2025-05-12","cited_by_count":4,"area":null},{"id":"2605.25704","title":"PowLU: An Activation Function for Stable Pre-Training of LLMs","created":"2026-05-25","cited_by_count":4,"area":null},{"id":"2402.06357","title":"The SkipSponge Attack: Sponge Weight Poisoning of Deep Neural Networks","created":"2024-02-09","cited_by_count":3,"area":null},{"id":"2410.13060","title":"AERO: Entropy-Guided Framework for Private LLM Inference","created":"2024-10-16","cited_by_count":3,"area":null},{"id":"2502.01330","title":"Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsity","created":"2025-02-03","cited_by_count":3,"area":null},{"id":"2502.09954","title":"On Space Folds of ReLU Neural Networks","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2503.18216","title":"Adaptive Rank Allocation: Speeding Up Modern Transformers with RaNA Adapters","created":"2025-03-23","cited_by_count":3,"area":null},{"id":"2405.01943","title":"Dependency-Aware Semi-Structured Sparsity of GLU Variants in Large Language Models","created":"2024-05-03","cited_by_count":2,"area":null},{"id":"2408.11855","title":"FactorLLM: Factorizing Knowledge via Mixture of Experts for Large Language Models","created":"2024-08-15","cited_by_count":2,"area":"moe"},{"id":"2412.05644","title":"Mixture of Hidden-Dimensions Transformer","created":"2024-12-07","cited_by_count":2,"area":null},{"id":"2509.24198","title":"Negative Pre-activations Differentiate Syntax","created":"2025-09-29","cited_by_count":2,"area":null},{"id":"2510.15964","title":"Long Exposure: Accelerating Parameter-Efficient Fine-Tuning for LLMs under Shadowy Sparsity","created":"2025-10-12","cited_by_count":2,"area":null},{"id":"2607.17624","title":"Can Transformers Really Do It All? On the Compatibility of Inductive Biases Across Tasks","created":"2026-07-20","cited_by_count":2,"area":null},{"id":"2406.02021","title":"FFNet: MetaMixer-based Efficient Convolutional Mixer Design","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2410.24050","title":"A Mechanistic Study of Transformers Training Dynamics","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2501.16337","title":"Explore Activation Sparsity in Recurrent LLMs for Energy-Efficient Neuromorphic Computing","created":"2025-01-09","cited_by_count":1,"area":null},{"id":"2510.08629","title":"Dynamic Mixture-of-Experts for Visual Autoregressive Model","created":"2025-10-08","cited_by_count":1,"area":"moe"},{"id":"2511.04477","title":"Enabling Dynamic Sparsity in Quantized LLM Inference","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2511.18692","title":"VLM in a flash: I/O-Efficient Sparsification of Vision-Language Model via Neuron Chunking","created":"2025-11-24","cited_by_count":1,"area":"mllm"},{"id":"2601.14792","title":"Robustness of Mixtures of Experts to Feature Noise","created":"2026-01-21","cited_by_count":1,"area":"moe"},{"id":"2605.17659","title":"Bug or Feature$^2$: Weight Drift, Activation Sparsity and Spikes","created":"2026-05-17","cited_by_count":1,"area":null},{"id":"2606.23419","title":"GRINQH: Graded Input-based Quantization Hierarchy for Efficient LLM Generation","created":"2026-06-22","cited_by_count":1,"area":null},{"id":"2607.11990","title":"Sparse Inter-Layer Dependencies of Transformer FFN Neurons","created":"2026-07-13","cited_by_count":1,"area":null},{"id":"2407.07848","title":"Uncovering Layer-Dependent Activation Sparsity Patterns in ReLU Transformers","created":"2024-07-10","cited_by_count":0,"area":null},{"id":"2501.02362","title":"Easing Optimization Paths: a Circuit Perspective","created":"2025-01-04","cited_by_count":0,"area":null},{"id":"2503.17101","title":"Large Language Model Compression via the Nested Activation-Aware Decomposition","created":"2025-03-21","cited_by_count":0,"area":null},{"id":"2506.02210","title":"Exchangeability in Neural Network and its Application to Dynamic Pruning","created":"2025-06-02","cited_by_count":0,"area":null},{"id":"2506.04165","title":"A Faster Generalized Two-Stage Approximate Top-K","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2506.23225","title":"Masked Gated Linear Unit","created":"2025-06-29","cited_by_count":0,"area":null},{"id":"2512.12744","title":"Resting Neurons, Active Insights: Robustifying Activation Sparsity in LLMs via Spontaneity","created":"2025-12-14","cited_by_count":0,"area":null},{"id":"2602.06822","title":"POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2603.23198","title":"Sparser, Faster, Lighter Transformer Language Models","created":"2026-03-24","cited_by_count":0,"area":null},{"id":"2605.08575","title":"Uncovering Intra-expert Activation Sparsity for Efficient Mixture-of-Expert Model Execution","created":"2026-05-09","cited_by_count":0,"area":"moe"},{"id":"2605.17743","title":"MoASE++: Mixture of Activation Sparsity Experts with Domain-Adaptive On-policy Distillation for Continual Test Time Adaptation","created":"2026-05-18","cited_by_count":0,"area":"distill"},{"id":"2605.25612","title":"Towards the Connection between Activation Sparsity and Flat Minima","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2605.26632","title":"RT-Lynx: Putting GEMM Sparsity in the Right Place for Diffusion Models","created":"2026-05-26","cited_by_count":0,"area":"diffusion"},{"id":"2605.29983","title":"Improving Adversarial Robustness of Attribution via Implicit Regularization","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.07414","title":"Sparsely gated tiny linear experts","created":"2026-06-05","cited_by_count":0,"area":"moe"},{"id":"2607.18081","title":"SelectInfer: Selective Neuron Loading and Computation for On-Device LLMs","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2608.02995","title":"SparSEEty: Extracting Tokens from Sparsity-Exploiting LLM Serving Systems via Deterministic Side Channels","created":"2026-08-04","cited_by_count":0,"area":"inference"},{"id":"2608.30439","title":"Event-Driven Language Models with Sparse Neural Activity for Neuromorphic Hardware","created":"2026-08-31","cited_by_count":0,"area":"inference"},{"id":"2609.31975","title":"Model Casting and Low-Parameter Gating: Towards More Sparsely Activated FFNs","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.33889","title":"Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decoding","created":"2026-09-27","cited_by_count":0,"area":"inference"},{"id":"2610.01763","title":"TopK-Guided: Adaptive, Budget-Aware Activation Sparsity for Efficient LLM Inference","created":"2026-10-01","cited_by_count":0,"area":"inference"},{"id":"2610.02598","title":"Activation Sparsity with Weight Approximation for Faster LLM Decoding on Offloaded Weights","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04670","title":"A Tropical Geometry View of Forgetting: A Per-Unit Projector for Knowledge-Preserving Fine-Tuning","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}