{"total":98,"rows":[{"id":"2306.14048","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","created":"2023-06-24","cited_by_count":832,"area":"inference"},{"id":"2207.07061","title":"Confident Adaptive Language Modeling","created":"2022-07-14","cited_by_count":310,"area":"inference"},{"id":"2404.14294","title":"A Survey on Efficient Inference for Large Language Models","created":"2024-04-22","cited_by_count":205,"area":"inference"},{"id":"2307.06945","title":"In-context Autoencoder for Context Compression in a Large Language Model","created":"2023-07-13","cited_by_count":199,"area":"inference"},{"id":"2310.08461","title":"DistillSpec: Improving Speculative Decoding via Knowledge Distillation","created":"2023-10-12","cited_by_count":165,"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":"2407.18003","title":"Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption","created":"2024-07-25","cited_by_count":97,"area":"inference"},{"id":"2407.00023","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","created":"2024-05-08","cited_by_count":70,"area":"inference"},{"id":"2509.26488","title":"dParallel: Learnable Parallel Decoding for dLLMs","created":"2025-09-30","cited_by_count":65,"area":"inference"},{"id":"2502.00299","title":"ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference","created":"2025-02-01","cited_by_count":60,"area":"inference"},{"id":"2504.15364","title":"KeyDiff: Key Similarity-Based KV Cache Eviction for Long-Context LLM Inference in Resource-Constrained Environments","created":"2025-04-21","cited_by_count":51,"area":"inference"},{"id":"2502.14866","title":"LServe: Efficient Long-sequence LLM Serving with Unified Sparse Attention","created":"2025-02-20","cited_by_count":41,"area":"inference"},{"id":"2502.04420","title":"KVTuner: Sensitivity-Aware Layer-Wise Mixed-Precision KV Cache Quantization for Efficient and Nearly Lossless LLM Inference","created":"2025-02-06","cited_by_count":40,"area":"inference"},{"id":"2402.01869","title":"InferCept: Efficient Intercept Support for Augmented Large Language Model Inference","created":"2024-02-02","cited_by_count":33,"area":"inference"},{"id":"2504.06261","title":"Hogwild! Inference: Parallel LLM Generation via Concurrent Attention","created":"2025-04-08","cited_by_count":32,"area":"inference"},{"id":"2506.18879","title":"CommVQ: Commutative Vector Quantization for KV Cache Compression","created":"2025-06-23","cited_by_count":28,"area":"inference"},{"id":"2408.08147","title":"P/D-Serve: Serving Disaggregated Large Language Model at Scale","created":"2024-08-15","cited_by_count":27,"area":"inference"},{"id":"2406.02376","title":"Retaining Key Information under High Compression Ratios: Query-Guided Compressor for LLMs","created":"2024-06-04","cited_by_count":24,"area":"inference"},{"id":"2505.07203","title":"PrefillOnly: An Inference Engine for Prefill-only Workloads in Large Language Model Applications","created":"2025-05-12","cited_by_count":21,"area":"inference"},{"id":"2507.10150","title":"Past-Future Scheduler for LLM Serving under SLA Guarantees","created":"2025-07-14","cited_by_count":20,"area":"inference"},{"id":"2404.00242","title":"DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference","created":"2024-03-30","cited_by_count":19,"area":"inference"},{"id":"2603.04445","title":"Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey","created":"2026-02-23","cited_by_count":19,"area":"inference"},{"id":"2404.00489","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","created":"2024-03-30","cited_by_count":18,"area":"inference"},{"id":"2412.19925","title":"HADES: Hardware Accelerated Decoding for Efficient Speculation in Large Language Models","created":"2024-12-27","cited_by_count":15,"area":"inference"},{"id":"2504.08242","title":"Jupiter: Fast and Resource-Efficient Collaborative Inference of Generative LLMs on Edge Devices","created":"2025-04-11","cited_by_count":15,"area":"inference"},{"id":"2606.18394","title":"JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting","created":"2026-06-16","cited_by_count":15,"area":"inference"},{"id":"2608.03893","title":"Cross-Model KV Cache Transfer in LLM Families: A Closed-Form Linear Mapping for Prefill Reuse","created":"2026-08-04","cited_by_count":15,"area":"inference"},{"id":"2605.07721","title":"Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models","created":"2026-05-08","cited_by_count":14,"area":"inference"},{"id":"2504.20039","title":"AutoJudge: Judge Decoding Without Manual Annotation","created":"2025-04-28","cited_by_count":13,"area":"inference"},{"id":"2509.18362","title":"FastMTP: Accelerating LLM Inference with Enhanced Multi-Token Prediction","created":"2025-09-16","cited_by_count":13,"area":"inference"},{"id":"2511.01815","title":"KV Cache Transform Coding for Compact Storage in LLM Inference","created":"2025-11-03","cited_by_count":13,"area":"inference"},{"id":"2507.08799","title":"KV Cache Steering for Controlling Frozen LLMs","created":"2025-07-11","cited_by_count":11,"area":"inference"},{"id":"2502.00527","title":"PolarQuant: Leveraging Polar Transformation for Efficient Key Cache Quantization and Decoding Acceleration","created":"2025-02-01","cited_by_count":10,"area":"inference"},{"id":"2505.17052","title":"SpecEdge: Scalable Edge-Assisted Serving Framework for Interactive LLMs","created":"2025-05-16","cited_by_count":10,"area":"inference"},{"id":"2511.18643","title":"Kitty: Accurate and Efficient 2-bit KV Cache Quantization with Dynamic Channel-wise Precision Boost","created":"2025-11-23","cited_by_count":10,"area":"inference"},{"id":"2506.11309","title":"SwiftSpec: Ultra-Low Latency LLM Decoding by Scaling Asynchronous Speculative Decoding","created":"2025-06-12","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":"2505.00019","title":"An Empirical Study on Prompt Compression for Large Language Models","created":"2025-04-24","cited_by_count":8,"area":"inference"},{"id":"2505.12942","title":"A3 : an Analytical Low-Rank Approximation Framework for Attention","created":"2025-05-19","cited_by_count":8,"area":"inference"},{"id":"2505.18231","title":"NSNQuant: A Double Normalization Approach for Calibration-Free Low-Bit Vector Quantization of KV Cache","created":"2025-05-23","cited_by_count":7,"area":"inference"},{"id":"2602.07223","title":"Vegas: Self-Speculative Decoding with Verification-Guided Sparse Attention","created":"2026-02-06","cited_by_count":7,"area":"inference"},{"id":"2402.12280","title":"Plato: Plan to Efficiently Decode for Large Language Model Inference","created":"2024-02-19","cited_by_count":6,"area":"inference"},{"id":"2409.15395","title":"Parse Trees Guided LLM Prompt Compression","created":"2024-09-23","cited_by_count":6,"area":"inference"},{"id":"2504.11004","title":"Dynamic Compressing Prompts for Efficient Inference of Large Language Models","created":"2025-04-15","cited_by_count":6,"area":"inference"},{"id":"2504.14992","title":"Efficient Pretraining Length Scaling","created":"2025-04-21","cited_by_count":6,"area":"inference"},{"id":"2509.02121","title":"Batch Query Processing and Optimization for Agentic Workflows","created":"2025-09-02","cited_by_count":6,"area":"inference"},{"id":"2601.10729","title":"OrbitFlow: SLO-Aware Long-Context LLM Serving with Fine-Grained KV Cache Reconfiguration","created":"2026-01-05","cited_by_count":6,"area":"inference"},{"id":"2404.18322","title":"BlockLLM: Multi-tenant Finer-grained Serving for Large Language Models","created":"2024-04-28","cited_by_count":5,"area":"inference"},{"id":"2408.01890","title":"Cross-layer Attention Sharing for Pre-trained Large Language Models","created":"2024-08-04","cited_by_count":5,"area":"inference"},{"id":"2411.18424","title":"FastSwitch: Optimizing Context Switching Efficiency in Fairness-aware Large Language Model Serving","created":"2024-11-27","cited_by_count":5,"area":"inference"},{"id":"2509.19228","title":"CompLLM: Compression for Long Context Q&A","created":"2025-09-23","cited_by_count":5,"area":"inference"},{"id":"2602.04541","title":"LycheeDecode: Accelerating Long-Context LLM Inference via Hybrid-Head Sparse Decoding","created":"2026-02-04","cited_by_count":5,"area":"inference"},{"id":"2604.10539","title":"IceCache: Memory-efficient KV-cache Management for Long-Sequence LLMs","created":"2026-04-12","cited_by_count":5,"area":"inference"},{"id":"2604.19157","title":"SAW-INT4: System-Aware 4-Bit KV-Cache Quantization for Real-World LLM Serving","created":"2026-04-21","cited_by_count":5,"area":"inference"},{"id":"2608.30135","title":"Verification-Aware Training for Speculative Decoding","created":"2026-08-31","cited_by_count":5,"area":"inference"},{"id":"2506.00307","title":"Lossless Token Sequence Compression via Meta-Tokens","created":"2025-05-30","cited_by_count":4,"area":"inference"},{"id":"2510.02329","title":"SelfJudge: Faster Speculative Decoding via Self-Supervised Judge Verification","created":"2025-09-26","cited_by_count":4,"area":"inference"},{"id":"2510.13847","title":"DynaSpec: Context-aware Dynamic Speculative Sampling for Large-Vocabulary Language Models","created":"2025-10-11","cited_by_count":4,"area":"inference"},{"id":"2511.00321","title":"Scalable Processing-Near-Memory for 1M-Token LLM Inference: CXL-Enabled KV-Cache Management Beyond GPU Limits","created":"2025-10-31","cited_by_count":4,"area":"inference"},{"id":"2602.12029","title":"PrefillShare: A Shared Prefill Module for KV Reuse in Multi-LLM Disaggregated Serving","created":"2026-02-12","cited_by_count":4,"area":"inference"},{"id":"2604.04987","title":"Cactus: Accelerating Auto-Regressive Decoding with Constrained Acceptance Speculative Sampling","created":"2026-04-05","cited_by_count":4,"area":"inference"},{"id":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-08","cited_by_count":4,"area":"inference"},{"id":"2604.26837","title":"Unifying Sparse Attention with Hierarchical Memory for Scalable Long-Context LLM Serving","created":"2026-04-29","cited_by_count":4,"area":"inference"},{"id":"2605.17304","title":"Compress the Context, Keep the Commitments: A Formal Framework for Verifiable LLM Context Compression","created":"2026-05-17","cited_by_count":3,"area":"inference"},{"id":"2411.05894","title":"SSSD: Simply-Scalable Speculative Decoding","created":"2024-11-08","cited_by_count":2,"area":"inference"},{"id":"2504.09775","title":"MIST: A Co-Design Framework for Heterogeneous, Multi-Stage LLM Inference","created":"2025-04-14","cited_by_count":2,"area":"inference"},{"id":"2511.03092","title":"SnapStream: Efficient Long Sequence Decoding on Dataflow Accelerators","created":"2025-11-05","cited_by_count":2,"area":"inference"},{"id":"2603.02188","title":"Multi-Head Low-Rank Attention","created":"2026-03-02","cited_by_count":2,"area":"inference"},{"id":"2605.04426","title":"Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting","created":"2026-05-06","cited_by_count":2,"area":"inference"},{"id":"2605.06225","title":"Memory Inception: Latent-Space KV Cache Manipulation for Steering LLMs","created":"2026-05-07","cited_by_count":2,"area":"inference"},{"id":"2605.12110","title":"AB-Sparse: Sparse Attention with Adaptive Block Size for Accurate and Efficient Long-Context Inference","created":"2026-05-12","cited_by_count":2,"area":"inference"},{"id":"2607.02484","title":"Combating Textual Noise and Redundancy: Entropy-Aware Dense Visual Token Pruning","created":"2026-07-02","cited_by_count":2,"area":"inference"},{"id":"2509.19368","title":"Pipeline Parallelism is All You Need for Optimized Early-Exit Based Self-Speculative Decoding","created":"2025-09-19","cited_by_count":1,"area":"inference"},{"id":"2512.09238","title":"Training-free Context-adaptive Attention for Efficient Long Context Modeling","created":"2025-12-10","cited_by_count":1,"area":"inference"},{"id":"2608.12385","title":"Decode-Branch Transformers: Decoupling the Primary Prefill Path from Additional Decode Computation","created":"2026-07-31","cited_by_count":1,"area":"inference"},{"id":"2609.02737","title":"Language Models Can Control Their Own Attention","created":"2026-09-02","cited_by_count":1,"area":"inference"},{"id":"2609.17943","title":"ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference","created":"2026-09-16","cited_by_count":1,"area":"inference"},{"id":"2409.00855","title":"LanguaShrink: Reducing Token Overhead with Psycholinguistics","created":"2024-09-01","cited_by_count":0,"area":"inference"},{"id":"2411.18010","title":"JPPO: Joint Power and Prompt Optimization for Accelerated Large Language Model Services","created":"2024-11-27","cited_by_count":0,"area":"inference"},{"id":"2502.13374","title":"Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor","created":"2025-02-19","cited_by_count":0,"area":"inference"},{"id":"2504.12526","title":"MOM: Memory-Efficient Offloaded Mini-Sequence Inference for Long Context Language Models","created":"2025-04-16","cited_by_count":0,"area":"inference"},{"id":"2506.03296","title":"APEX: Asynchronous Parallel CPU-GPU Execution for Online LLM Inference on Constrained GPUs","created":"2025-06-03","cited_by_count":0,"area":"inference"},{"id":"2508.21495","title":"Rethinking Calibration for Early-Exit Neural Networks","created":"2025-08-29","cited_by_count":0,"area":"inference"},{"id":"2509.11155","title":"AQUA: Attention via QUery mAgnitudes for Memory and Compute Efficient Inference in LLMs","created":"2025-09-14","cited_by_count":0,"area":"inference"},{"id":"2603.03333","title":"Training-free Dropout Sampling for Semantic Token Acceptance in Speculative Decoding","created":"2026-02-11","cited_by_count":0,"area":"inference"},{"id":"2603.04797","title":"Hardware-Software Co-design for 3D-DRAM-based LLM Serving Accelerator","created":"2026-03-05","cited_by_count":0,"area":"inference"},{"id":"2604.16864","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","created":"2026-04-18","cited_by_count":0,"area":"inference"},{"id":"2605.06914","title":"Regulating Branch Parallelism in LLM Serving","created":"2026-05-07","cited_by_count":0,"area":"inference"},{"id":"2605.14292","title":"Minimal-Intervention KV Retention via Set-Conditioned Diversity","created":"2026-05-14","cited_by_count":0,"area":"inference"},{"id":"2607.12550","title":"A JoLT for the KV cache: Near-Lossless KV Cache Compression via Joint Rank-bit Allocation","created":"2026-07-14","cited_by_count":0,"area":"inference"},{"id":"2608.04974","title":"AsymSpec: Efficient Cloud-Edge Speculative Decoding over Asymmetric Networks","created":"2026-08-05","cited_by_count":0,"area":"inference"},{"id":"2608.06007","title":"TensorCast: The Missing Tensor Management Layer in Large Language Model Infrastructure","created":"2026-08-06","cited_by_count":0,"area":"inference"},{"id":"2608.23843","title":"PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression","created":"2026-08-24","cited_by_count":0,"area":"inference"},{"id":"2609.13154","title":"Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories","created":"2026-07-08","cited_by_count":0,"area":"inference"},{"id":"2609.16450","title":"Early-Bird Decoding: Accelerating Diffusion LLMs with Learnable Block Sizes and Parallel Sampling","created":"2026-09-15","cited_by_count":0,"area":"inference"},{"id":"2609.26763","title":"SARA: SLO-Aware Resource Allocation for Disaggregated Agentic LLM Services","created":"2026-09-22","cited_by_count":0,"area":"inference"},{"id":"2609.29913","title":"MILO: Efficient Many-shot In-Context Learning with Block-wise Low-rank Compression","created":"2026-09-24","cited_by_count":0,"area":"inference"},{"id":"2610.14571","title":"Dissecting the Carbon-SLO Tension in Geo-Distributed LLM Serving","created":"2026-10-10","cited_by_count":0,"area":"inference"}],"next_cursor":null}