{"total":80,"rows":[{"id":"2312.11514","title":"LLM in a flash: Efficient Large Language Model Inference with Limited Memory","created":"2023-12-12","cited_by_count":177,"area":"inference"},{"id":"2402.16363","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","created":"2024-02-26","cited_by_count":152,"area":"inference"},{"id":"2507.10524","title":"Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation","created":"2025-07-14","cited_by_count":133,"area":null},{"id":"2312.15234","title":"Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems","created":"2023-12-23","cited_by_count":102,"area":"inference"},{"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":"2410.20672","title":"Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRA","created":"2024-10-28","cited_by_count":78,"area":null},{"id":"2405.19715","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","created":"2024-05-30","cited_by_count":75,"area":"inference"},{"id":"2410.06916","title":"SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration","created":"2024-10-09","cited_by_count":72,"area":"inference"},{"id":"2312.04916","title":"EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism","created":"2023-12-08","cited_by_count":69,"area":"inference"},{"id":"2404.18911","title":"Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting","created":"2024-04-29","cited_by_count":58,"area":"inference"},{"id":"2402.05964","title":"A Survey on Transformer Compression","created":"2024-02-05","cited_by_count":46,"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":"2402.01528","title":"Decoding Speculative Decoding","created":"2024-02-02","cited_by_count":34,"area":"inference"},{"id":"2406.02657","title":"Block Transformer: Global-to-Local Language Modeling for Fast Inference","created":"2024-06-04","cited_by_count":32,"area":"inference"},{"id":"2406.03853","title":"Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism","created":"2024-06-06","cited_by_count":32,"area":"inference"},{"id":"2405.20915","title":"Fast yet Safe: Early-Exiting with Risk Control","created":"2024-05-31","cited_by_count":30,"area":"inference"},{"id":"2411.00841","title":"A Theoretical Perspective for Speculative Decoding Algorithm","created":"2024-10-30","cited_by_count":29,"area":"inference"},{"id":"2402.13720","title":"Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding","created":"2024-02-21","cited_by_count":25,"area":"inference"},{"id":"2411.02829","title":"CE-CoLLM: Efficient and Adaptive Large Language Models Through Cloud-Edge Collaboration","created":"2024-11-05","cited_by_count":25,"area":null},{"id":"2510.07358","title":"Encode, Think, Decode: Scaling test-time reasoning with recursive latent thoughts","created":"2025-10-08","cited_by_count":24,"area":"lr"},{"id":"2404.03865","title":"FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skipping","created":"2024-04-05","cited_by_count":23,"area":"inference"},{"id":"2404.08698","title":"Lossless Acceleration of Large Language Model via Adaptive N-gram Parallel Decoding","created":"2024-04-10","cited_by_count":23,"area":"inference"},{"id":"2502.19732","title":"Speculative Decoding and Beyond: An In-Depth Survey of Techniques","created":"2025-02-27","cited_by_count":23,"area":"inference"},{"id":"2502.17421","title":"LongSpec: Long-Context Lossless Speculative Decoding with Efficient Drafting and Verification","created":"2025-02-24","cited_by_count":21,"area":"agents"},{"id":"2511.08577","title":"Think-at-Hard: Dynamic Looped Transformers for Improved Reasoning","created":"2025-11-11","cited_by_count":16,"area":"lr"},{"id":"2312.05385","title":"Apparate: Rethinking Early Exits to Tame Latency-Throughput Tensions in ML Serving","created":"2023-12-08","cited_by_count":15,"area":"inference"},{"id":"2507.01449","title":"LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation","created":"2025-07-02","cited_by_count":14,"area":"inference"},{"id":"2312.11882","title":"ConsistentEE: A Consistent and Hardness-Guided Early Exiting Method for Accelerating Language Models Inference","created":"2023-12-19","cited_by_count":13,"area":"inference"},{"id":"2402.00518","title":"EE-Tuning: An Economical yet Scalable Solution for Tuning Early-Exit Large Language Models","created":"2024-02-01","cited_by_count":13,"area":"inference"},{"id":"2402.13485","title":"ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding","created":"2024-02-21","cited_by_count":12,"area":"inference"},{"id":"2406.01698","title":"Demystifying AI Platform Design for Distributed Inference of Next-Generation LLM models","created":"2024-06-03","cited_by_count":12,"area":"inference"},{"id":"2406.16758","title":"Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized Drafters","created":"2024-06-24","cited_by_count":12,"area":"inference"},{"id":"2501.02336","title":"AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference","created":"2025-01-04","cited_by_count":12,"area":null},{"id":"2607.20519","title":"Adaptive Depth in Looped Transformers: Diagnosing Learned Halting Gates and Trajectory Readouts","created":"2026-07-08","cited_by_count":12,"area":null},{"id":"2311.15983","title":"SPIN: Sparsifying and Integrating Internal Neurons in Large Language Models for Text Classification","created":"2023-11-27","cited_by_count":10,"area":null},{"id":"2410.13184","title":"Router-Tuning: A Simple and Effective Approach for Enabling Dynamic-Depth in Transformers","created":"2024-10-17","cited_by_count":10,"area":null},{"id":"2501.02173","title":"The Efficiency vs. Accuracy Trade-off: Optimizing RAG-Enhanced LLM Recommender Systems Using Multi-Head Early Exit","created":"2025-01-04","cited_by_count":10,"area":"inference"},{"id":"2510.13251","title":"Map the Flow: Revealing Hidden Pathways of Information in VideoLLMs","created":"2025-10-15","cited_by_count":10,"area":"mllm"},{"id":"2406.07368","title":"When Linear Attention Meets Autoregressive Decoding: Towards More Effective and Efficient Linearized Large Language Models","created":"2024-06-11","cited_by_count":9,"area":"inference"},{"id":"2504.10724","title":"HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving","created":"2025-04-14","cited_by_count":8,"area":"inference"},{"id":"2507.03865","title":"OrthoRank: Token Selection via Sink Token Orthogonality for Efficient LLM inference","created":"2025-07-05","cited_by_count":8,"area":"inference"},{"id":"2311.08623","title":"DEED: Dynamic Early Exit on Decoder for Accelerating Encoder-Decoder Transformer Models","created":"2023-11-15","cited_by_count":7,"area":"inference"},{"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.14846","title":"A-VL: Adaptive Attention for Large Vision-Language Models","created":"2024-09-23","cited_by_count":7,"area":"mllm"},{"id":"2506.03700","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","created":"2025-06-04","cited_by_count":7,"area":"lr"},{"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":"2505.12731","title":"Accelerating Adaptive Retrieval Augmented Generation via Instruction-Driven Representation Reduction of Retrieval Overlaps","created":"2025-05-19","cited_by_count":6,"area":"rag"},{"id":"2505.18629","title":"Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding","created":"2025-05-24","cited_by_count":6,"area":"lr"},{"id":"2608.09444","title":"Depth-adaptive Inference of Looped Language Models via Continuous Depth Batching","created":"2026-08-10","cited_by_count":6,"area":null},{"id":"2405.13019","title":"A Comprehensive Survey of Accelerated Generation Techniques in Large Language Models","created":"2024-05-15","cited_by_count":5,"area":"inference"},{"id":"2406.13170","title":"Amphista: Bi-directional Multi-head Decoding for Accelerating LLM Inference","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2412.07192","title":"PrisonBreak: Jailbreaking Large Language Models with at Most Twenty-Five Targeted Bit-flips","created":"2024-12-10","cited_by_count":5,"area":"alignment"},{"id":"2405.15198","title":"RAEE: A Robust Retrieval-Augmented Early Exit Framework for Efficient Inference","created":"2024-05-24","cited_by_count":4,"area":"rag"},{"id":"2410.18952","title":"Dynamic Vocabulary Pruning in Early-Exit LLMs","created":"2024-10-24","cited_by_count":4,"area":"inference"},{"id":"2410.20022","title":"Dynamic layer selection in decoder-only transformers","created":"2024-10-26","cited_by_count":4,"area":"inference"},{"id":"2601.03700","title":"ADEPT: Adaptive Dynamic Early-Exit Process for Transformers","created":"2026-01-07","cited_by_count":4,"area":"inference"},{"id":"2404.12022","title":"Parallel Decoding via Hidden Transfer for Lossless Large Language Model Acceleration","created":"2024-04-18","cited_by_count":3,"area":"inference"},{"id":"2504.20922","title":"DYNAMAX: Dynamic computing for Transformers and Mamba based architectures","created":"2025-04-29","cited_by_count":3,"area":"ssm"},{"id":"2509.19996","title":"Choosing to Be Green: Advancing Green AI via Dynamic Model Selection","created":"2025-09-24","cited_by_count":2,"area":null},{"id":"2510.00078","title":"Adaptive and Resource-efficient Agentic AI Systems for Mobile and Embedded Devices: A Survey","created":"2025-09-30","cited_by_count":2,"area":"lr"},{"id":"2512.15705","title":"Dynamic Rebatching for Efficient Early-Exit Inference with DREX","created":"2025-12-17","cited_by_count":2,"area":"inference"},{"id":"2605.27965","title":"The Shape of Overthinking: Backtracking Bursts in Long Reasoning Traces","created":"2026-05-27","cited_by_count":2,"area":"lr"},{"id":"2605.29727","title":"Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting","created":"2026-05-28","cited_by_count":2,"area":"inference"},{"id":"2506.05404","title":"AD-EE: Early Exiting for Fast and Reliable Vision-Language Models in Autonomous Driving","created":"2025-06-04","cited_by_count":1,"area":"mllm"},{"id":"2510.16290","title":"Cerberus: Real-Time Video Anomaly Detection via Cascaded Vision-Language Models","created":"2025-10-18","cited_by_count":1,"area":"mllm"},{"id":"2601.22035","title":"Thinking Out of Order: When Output Order Stops Reflecting Reasoning Order in Diffusion Language Models","created":"2026-01-29","cited_by_count":1,"area":"lr"},{"id":"2601.23157","title":"No More, No Less: Least-Privilege Language Models","created":"2026-01-30","cited_by_count":1,"area":null},{"id":"2603.12453","title":"CSE-UOI at SemEval-2026 Task 6: A Two-Stage Heterogeneous Ensemble with Deliberative Complexity Gating for Political Evasion Detection","created":"2026-03-12","cited_by_count":1,"area":null},{"id":"2603.23701","title":"The Diminishing Returns of Early-Exit Decoding in Modern LLMs","created":"2026-03-24","cited_by_count":1,"area":"inference"},{"id":"2604.20090","title":"Less Languages, Less Tokens: An Efficient Unified Logic Cross-lingual Chain-of-Thought Reasoning Framework","created":"2026-04-22","cited_by_count":1,"area":"lr"},{"id":"2604.20503","title":"FASER: Fine-Grained Phase Management for Speculative Decoding in Dynamic LLM Serving","created":"2026-04-22","cited_by_count":1,"area":"inference"},{"id":"2605.07686","title":"The Coupling Tax: How Shared Token Budgets Undermine Visible Chain-of-Thought Under Fixed Output Limits","created":"2026-05-08","cited_by_count":1,"area":"lr"},{"id":"2605.20998","title":"Single-Pass, Depth-Selective Reading for Multi-Aspect Sentiment Analysis","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2405.04513","title":"Switchable Decision: Dynamic Neural Generation Networks","created":"2024-05-07","cited_by_count":0,"area":null},{"id":"2510.01795","title":"Nav-EE: Navigation-Guided Early Exiting for Efficient Vision-Language Models in Autonomous Driving","created":"2025-10-02","cited_by_count":0,"area":"mllm"},{"id":"2511.06391","title":"HatePrototypes: Interpretable and Transferable Representations for Implicit and Explicit Hate Speech Detection","created":"2025-11-09","cited_by_count":0,"area":null},{"id":"2603.09215","title":"SPAR-K: Scheduled Periodic Alternating Early Exit for Spoken Language Models","created":"2026-03-10","cited_by_count":0,"area":"inference"},{"id":"2604.15764","title":"When Do Early-Exit Networks Generalize? A PAC-Bayesian Theory of Adaptive Depth","created":"2026-04-17","cited_by_count":0,"area":"inference"},{"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.13190","title":"N-vium: Mixture-of-Exits Transformer for Accelerated Exact Generation","created":"2026-05-13","cited_by_count":0,"area":null}],"next_cursor":null}