{"total":121,"rows":[{"id":"2404.16710","title":"LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding","created":"2024-04-25","cited_by_count":307,"area":"inference"},{"id":"2506.00413","title":"Accelerating Diffusion LLMs via Adaptive Parallel Decoding","created":"2025-05-31","cited_by_count":112,"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":"2510.04767","title":"ParallelBench: Understanding the Trade-offs of Parallel Decoding in Diffusion LLMs","created":"2025-10-06","cited_by_count":43,"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":"2605.29707","title":"Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding","created":"2026-05-28","cited_by_count":34,"area":"inference"},{"id":"2510.14973","title":"Attention Is All You Need for KV Cache in Diffusion LLMs","created":"2025-10-16","cited_by_count":32,"area":"inference"},{"id":"2509.26432","title":"AdaBlock-dLLM: Semantic-Aware Diffusion LLM Inference via Adaptive Block Size","created":"2025-09-30","cited_by_count":31,"area":"inference"},{"id":"2510.04147","title":"Self Speculative Decoding for Diffusion Large Language Models","created":"2025-10-05","cited_by_count":30,"area":"inference"},{"id":"2509.18085","title":"Structuring The Future: Diffusion LLM Speculative Decoding via Calibrated Draft Graphs","created":"2025-09-22","cited_by_count":21,"area":"inference"},{"id":"2510.07081","title":"Accelerating Diffusion LLM Inference via Local Determinism Propagation","created":"2025-10-08","cited_by_count":21,"area":"inference"},{"id":"2510.00294","title":"Free Draft-and-Verification: Toward Lossless Parallel Decoding for Diffusion Large Language Models","created":"2025-09-30","cited_by_count":19,"area":"inference"},{"id":"2512.03324","title":"Cache What Lasts: Token Retention for Memory-Bounded KV Cache in LLMs","created":"2025-12-03","cited_by_count":19,"area":"inference"},{"id":"2410.11305","title":"QSpec: Speculative Decoding with Complementary Quantization Schemes","created":"2024-10-15","cited_by_count":18,"area":"inference"},{"id":"2512.16229","title":"LoPA: Scaling dLLM Inference via Lookahead Parallel Decoding","created":"2025-12-18","cited_by_count":17,"area":"inference"},{"id":"2605.18810","title":"D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Drafting","created":"2026-05-12","cited_by_count":17,"area":"inference"},{"id":"2411.18462","title":"Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation","created":"2024-11-27","cited_by_count":16,"area":"inference"},{"id":"2601.17668","title":"Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Eviction","created":"2026-01-25","cited_by_count":16,"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":"2505.13109","title":"FreeKV: Boosting KV Cache Retrieval for Efficient LLM Inference","created":"2025-05-19","cited_by_count":14,"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":"2603.12996","title":"DAPD: Dependency-Aware Parallel Decoding via Attention for Diffusion LLMs","created":"2026-03-13","cited_by_count":14,"area":"inference"},{"id":"2506.07851","title":"Learning to Focus: Causal Attention Distillation via Gradient-Guided Token Pruning","created":"2025-06-09","cited_by_count":13,"area":"inference"},{"id":"2509.02718","title":"Efficient Training-Free Online Routing for High-Volume Multi-LLM Serving","created":"2025-09-02","cited_by_count":13,"area":"inference"},{"id":"2510.06133","title":"CreditDecoding: Accelerating Parallel Decoding in Diffusion Large Language Models with Trace Credit","created":"2025-10-07","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":"2512.14681","title":"Fast and Accurate Causal Parallel Decoding using Jacobi Forcing","created":"2025-12-16","cited_by_count":13,"area":"inference"},{"id":"2602.06953","title":"DAWN: Dependency-Aware Fast Inference for Diffusion LLMs","created":"2026-02-06","cited_by_count":13,"area":"inference"},{"id":"2505.16162","title":"KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization","created":"2025-05-22","cited_by_count":11,"area":"inference"},{"id":"2507.01438","title":"EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices","created":"2025-07-02","cited_by_count":11,"area":"inference"},{"id":"2508.08895","title":"ASPD: Unlocking Adaptive Serial-Parallel Decoding by Exploring Intrinsic Parallelism in LLMs","created":"2025-08-12","cited_by_count":11,"area":"inference"},{"id":"2605.09649","title":"Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction","created":"2026-05-10","cited_by_count":11,"area":"inference"},{"id":"2605.29343","title":"Draft-OPD: On-Policy Distillation for Speculative Draft Models","created":"2026-05-28","cited_by_count":11,"area":"inference"},{"id":"2502.00085","title":"Efficient Beam Search for Large Language Models Using Trie-Based Decoding","created":"2025-01-31","cited_by_count":10,"area":"inference"},{"id":"2506.04108","title":"Rectified Sparse Attention","created":"2025-06-04","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":"2410.01485","title":"A Little Goes a Long Way: Efficient Long Context Training and Inference with Partial Contexts","created":"2024-10-02","cited_by_count":9,"area":"inference"},{"id":"2602.11812","title":"Predicting LLM Output Length via Entropy-Guided Representations","created":"2026-02-12","cited_by_count":9,"area":"inference"},{"id":"2605.17757","title":"OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization","created":"2026-05-18","cited_by_count":9,"area":"inference"},{"id":"2606.02091","title":"DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding","created":"2026-06-01","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":"2510.19779","title":"AdaSPEC: Selective Knowledge Distillation for Efficient Speculative Decoders","created":"2025-10-22","cited_by_count":8,"area":"inference"},{"id":"2602.03152","title":"FASA: Frequency-aware Sparse Attention","created":"2026-02-03","cited_by_count":8,"area":"inference"},{"id":"2602.05992","title":"DSB: Dynamic Sliding Block Scheduling for Diffusion LLMs","created":"2026-02-05","cited_by_count":7,"area":"inference"},{"id":"2607.07847","title":"When Does Continual Learning Require Learning","created":"2026-07-08","cited_by_count":7,"area":"inference"},{"id":"2608.27513","title":"DAMP: Decay-Aware Mixed-Precision Recurrent-State Quantization","created":"2026-08-27","cited_by_count":6,"area":"inference"},{"id":"2508.11661","title":"Sparse Attention across Multiple-context KV Cache","created":"2025-08-06","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":"2510.06175","title":"VecInfer: Efficient LLM Inference with Low-Bit KV Cache via Outlier-Suppressed Vector Quantization","created":"2025-10-07","cited_by_count":4,"area":"inference"},{"id":"2510.11292","title":"LouisKV: Efficient KV Cache Retrieval for Long Input-Output Sequences","created":"2025-10-13","cited_by_count":4,"area":"inference"},{"id":"2510.13602","title":"NOSA: Native and Offloadable Sparse Attention","created":"2025-10-15","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":"2602.22868","title":"Rejection Mixing: Fast Semantic Propagation of Mask Tokens for Efficient DLLM Inference","created":"2026-02-26","cited_by_count":4,"area":"inference"},{"id":"2607.07409","title":"DeLS-Spec: Decoupled Long-Short Contexts for Parallel Speculative Drafting","created":"2026-07-08","cited_by_count":4,"area":"inference"},{"id":"2607.25852","title":"AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding","created":"2026-07-28","cited_by_count":4,"area":"inference"},{"id":"2502.02493","title":"EasySpec: Layer-Parallel Speculative Decoding for Efficient Multi-GPU Utilization","created":"2025-02-04","cited_by_count":3,"area":"inference"},{"id":"2512.23765","title":"Entropy-Aware Token Rejection for Improving Speculative Decoding","created":"2025-12-29","cited_by_count":3,"area":"inference"},{"id":"2602.03708","title":"Beyond Tokens: Semantic-Aware Speculative Decoding for Efficient Inference by Probing Internal States","created":"2026-02-03","cited_by_count":3,"area":"inference"},{"id":"2605.07243","title":"SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting","created":"2026-05-08","cited_by_count":3,"area":"inference"},{"id":"2605.09329","title":"Test-Time Speculation","created":"2026-05-10","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":"2601.04766","title":"JuDi: Revisiting Judge Decoding from First Principles via Training-Free Distributional Divergence","created":"2026-01-08","cited_by_count":2,"area":"inference"},{"id":"2602.07721","title":"ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs","created":"2026-02-07","cited_by_count":2,"area":"inference"},{"id":"2603.23527","title":"Compression Method Matters: Benchmark-Dependent Output Dynamics in LLM Prompt Compression","created":"2026-03-06","cited_by_count":2,"area":"inference"},{"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":"2606.04446","title":"D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models","created":"2026-06-03","cited_by_count":2,"area":"inference"},{"id":"2606.28831","title":"HARD-KV: Head-Adaptive Regularization for Decoding-time KV Compression","created":"2026-06-27","cited_by_count":2,"area":"inference"},{"id":"2608.04074","title":"Spend Bits Where Queries Look: KV Cache Vector Quantization with Attention-Preserving Transforms","created":"2026-08-04","cited_by_count":2,"area":"inference"},{"id":"2608.29748","title":"ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding","created":"2026-08-30","cited_by_count":2,"area":"inference"},{"id":"2609.06498","title":"DFlow: Enabling Verifier Information Flow in Block Diffusion Speculative Decoding","created":"2026-09-06","cited_by_count":2,"area":"inference"},{"id":"2609.17184","title":"LoopSpec: Pipelined Self-Speculative Decoding for Looped Transformers","created":"2026-09-15","cited_by_count":2,"area":"inference"},{"id":"2610.13778","title":"ReplaySSM: Cache SSM Inputs, Not State","created":"2026-10-09","cited_by_count":2,"area":"inference"},{"id":"2509.18344","title":"Speculate Deep and Accurate: Lossless and Training-Free Acceleration for Offloaded LLMs via Substitute Speculative Decoding","created":"2025-09-22","cited_by_count":1,"area":"inference"},{"id":"2510.18525","title":"From Quarter to All: Accelerating Speculative LLM Decoding via Floating-Point Exponent Remapping and Parameter Sharing","created":"2025-10-21","cited_by_count":1,"area":"inference"},{"id":"2604.14682","title":"Acceptance Dynamics Across Cognitive Domains in Speculative Decoding","created":"2026-04-16","cited_by_count":1,"area":"inference"},{"id":"2604.18396","title":"River-LLM: Large Language Model Seamless Exit Based on KV Share","created":"2026-04-20","cited_by_count":1,"area":"inference"},{"id":"2605.30753","title":"Efficient Diffusion LLMs via Temporal-Spatial Parallel Decoding and Confidence Extrapolation","created":"2026-05-29","cited_by_count":1,"area":"inference"},{"id":"2606.12487","title":"DynamicPTQ: Mitigating Activation Quantization Collapse via Residual-Stream Dynamics","created":"2026-06-10","cited_by_count":1,"area":"inference"},{"id":"2607.14107","title":"Polestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs","created":"2026-05-07","cited_by_count":1,"area":"inference"},{"id":"2607.27600","title":"Back from the Future: Key-Value Cache Management by Counter-Causal Surprise","created":"2026-07-30","cited_by_count":1,"area":"inference"},{"id":"2608.00026","title":"Request-Level Energy Attribution for Batched LLM Serving","created":"2026-07-11","cited_by_count":1,"area":"inference"},{"id":"2608.14191","title":"KV Cache Compression Through the Lens of Transform Coding","created":"2026-08-14","cited_by_count":1,"area":"inference"},{"id":"2609.20186","title":"To Copy or Not to Copy: Controlling Speculative Decoding via Intrinsic Model Signals","created":"2026-09-17","cited_by_count":1,"area":"inference"},{"id":"2609.26368","title":"HySparse2: Hybrid Sparse Attention with Two-Level KV Sharing","created":"2026-09-22","cited_by_count":1,"area":"inference"},{"id":"2408.00539","title":"Intermittent Semi-Working Mask: A New Masking Paradigm for LLMs","created":"2024-08-01","cited_by_count":0,"area":"inference"},{"id":"2511.22481","title":"OmniInfer: System-Wide Acceleration Techniques for Optimizing LLM Serving Throughput and Latency","created":"2025-11-27","cited_by_count":0,"area":"inference"},{"id":"2602.16961","title":"Greedy Multi-Path Block Verification for Faster Decoding in Speculative Sampling","created":"2026-02-18","cited_by_count":0,"area":"inference"},{"id":"2602.16994","title":"Dynamic Delayed Tree Expansion For Improved Multi-Path Speculative Decoding","created":"2026-02-19","cited_by_count":0,"area":"inference"},{"id":"2603.23528","title":"The Compression Paradox in LLM Inference: Provider-Dependent Energy Effects of Prompt Compression","created":"2026-03-06","cited_by_count":0,"area":"inference"},{"id":"2604.13634","title":"Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference","created":"2026-04-15","cited_by_count":0,"area":"inference"},{"id":"2604.26951","title":"Turning the TIDE: Cross-Architecture Distillation for Diffusion Large Language Models","created":"2026-04-29","cited_by_count":0,"area":"inference"},{"id":"2605.04263","title":"Parallel Prefix Verification for Speculative Generation","created":"2026-05-05","cited_by_count":0,"area":"inference"},{"id":"2605.11317","title":"SOMA: Efficient Multi-turn LLM Serving via Small Language Model","created":"2026-05-11","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":"2606.05868","title":"YouZhi: Towards High-Concurrency Financial LLMs via Adaptive GQA-to-MLA Transition","created":"2026-06-04","cited_by_count":0,"area":"inference"},{"id":"2606.19755","title":"SafeSpec: Fast and Safe LLM via Dynamic Reflective Sampling","created":"2026-06-18","cited_by_count":0,"area":"inference"},{"id":"2606.26744","title":"HyperDFlash: Hyper-Connection-Aligned Block Speculative Decoding with Gated Residual Reduction","created":"2026-06-25","cited_by_count":0,"area":"inference"},{"id":"2606.31580","title":"LASER: Load-Aware Serving with Early-Exit for Reasoning LLMs at the Edge","created":"2026-06-30","cited_by_count":0,"area":"inference"},{"id":"2607.08930","title":"BlockServe: Block-Grained Continuous Batching for High-Throughput Diffusion LLM Serving","created":"2026-07-09","cited_by_count":0,"area":"inference"},{"id":"2607.20467","title":"DC-Leap: Training-Free Acceleration of dLLMs via Draft-Guided Contiguous Leaping Decoding","created":"2026-05-19","cited_by_count":0,"area":"inference"}],"next_cursor":"100"}