{"total":67,"rows":[{"id":"2502.08773","title":"Universal Model Routing for Efficient LLM Inference","created":"2025-02-12","cited_by_count":86,"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":"2504.06261","title":"Hogwild! Inference: Parallel LLM Generation via Concurrent Attention","created":"2025-04-08","cited_by_count":32,"area":"inference"},{"id":"2604.12989","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","created":"2026-04-14","cited_by_count":29,"area":"inference"},{"id":"2601.19278","title":"DART: Diffusion-Inspired Speculative Decoding for Fast LLM Inference","created":"2026-01-27","cited_by_count":24,"area":"inference"},{"id":"2603.18567","title":"SpecForge: A Flexible and Efficient Open-Source Training Framework for Speculative Decoding","created":"2026-03-19","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":"2504.20039","title":"AutoJudge: Judge Decoding Without Manual Annotation","created":"2025-04-28","cited_by_count":13,"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.18362","title":"FastMTP: Accelerating LLM Inference with Enhanced Multi-Token Prediction","created":"2025-09-16","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":"2604.09557","title":"SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding","created":"2026-02-10","cited_by_count":10,"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":"2605.25475","title":"IndexMem: Learned KV-Cache Eviction with Latent Memory for Long-Context LLM Inference","created":"2026-05-25","cited_by_count":7,"area":"inference"},{"id":"2602.21233","title":"AngelSlim: A more accessible, comprehensive, and efficient toolkit for large model compression","created":"2026-02-07","cited_by_count":6,"area":"inference"},{"id":"2606.01813","title":"Cost-Aware Diffusion Draft Trees for Speculative Decoding","created":"2026-06-01","cited_by_count":6,"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":"2511.11907","title":"KVSwap: Disk-aware KV Cache Offloading for Long-Context On-device Inference","created":"2025-11-14","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":"2508.09001","title":"Retrospective Sparse Attention for Efficient Long-Context Generation","created":"2025-08-12","cited_by_count":4,"area":"inference"},{"id":"2509.10798","title":"Judge Q: Trainable Queries for Optimized Information Retention in KV Cache Eviction","created":"2025-09-13","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":"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":"2602.12151","title":"OServe: Accelerating LLM Serving via Spatial-Temporal Workload Orchestration","created":"2026-02-12","cited_by_count":3,"area":"inference"},{"id":"2605.09329","title":"Test-Time Speculation","created":"2026-05-10","cited_by_count":3,"area":"inference"},{"id":"2607.06763","title":"Trees from Marginals: Autoregressive drafting with factorized priors","created":"2026-07-07","cited_by_count":3,"area":"inference"},{"id":"2607.08690","title":"A Practical Investigation of Training-free Relaxed Speculative Decoding","created":"2026-07-09","cited_by_count":3,"area":"inference"},{"id":"2607.22634","title":"PRESTO: Prefix-Aligned Tree Drafting for Diffusion Speculative Decoding","created":"2026-06-20","cited_by_count":3,"area":"inference"},{"id":"2608.02123","title":"From Chains to Trees: Parent-Conditioned Drafting for Semi-Autoregressive Speculative Decoding","created":"2026-08-03","cited_by_count":3,"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":"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":"2608.02691","title":"Output-Aware Rotation for INT2 KV-Cache Quantization","created":"2026-08-03","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":"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":"2608.00531","title":"CURE: Local Uncertainty Repair for Block-Parallel Speculative Decoding","created":"2026-08-01","cited_by_count":1,"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.03333","title":"Training-free Dropout Sampling for Semantic Token Acceptance in Speculative Decoding","created":"2026-02-11","cited_by_count":0,"area":"inference"},{"id":"2605.26558","title":"Cassandra: Enabling Reasoning LLMs at Edge via Self-Speculative Decoding","created":"2026-05-26","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.26744","title":"HyperDFlash: Hyper-Connection-Aligned Block Speculative Decoding with Gated Residual Reduction","created":"2026-06-25","cited_by_count":0,"area":"inference"},{"id":"2607.26627","title":"Revisiting Lossy Verification in Speculative Decoding: Mechanisms, Trade-offs, and Failure Modes","created":"2026-07-29","cited_by_count":0,"area":"inference"},{"id":"2608.10362","title":"MemSpec: Memory-Aware Runtime for Adaptive Draft Scheduling in Speculative Decoding on Edge Devices","created":"2026-08-11","cited_by_count":0,"area":"inference"},{"id":"2609.09338","title":"Osprey: Target-agnostic Pre-training Makes Stronger Drafters in Speculative Decoding","created":"2026-09-08","cited_by_count":0,"area":"inference"},{"id":"2609.19169","title":"SiliconBench: Speed, Memory, and Fidelity for LLM Serving on Unified-Memory Desktops","created":"2026-09-12","cited_by_count":0,"area":"inference"},{"id":"2609.34388","title":"Reciprocal Guidance: Orchestrating Draft and Verify Budgets for Advancing the Diffusion-AR Self-Speculation Frontier","created":"2026-09-28","cited_by_count":0,"area":"inference"},{"id":"2609.34832","title":"BV Loss: Block Verification-Aware Loss for Block Diffusion Speculative Decoding","created":"2026-09-28","cited_by_count":0,"area":"inference"},{"id":"2609.37029","title":"LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.38121","title":"WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.38169","title":"STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.38510","title":"DEdit: Iterative Draft Editing for Speculative Decoding","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.38795","title":"Recovering Off-Policy Supervision for Speculative Decoding","created":"2026-09-30","cited_by_count":0,"area":"inference"},{"id":"2609.39972","title":"UBTree: Parallel Tree Drafting via Unigram and Bigram Models for Speculative Decoding","created":"2026-09-30","cited_by_count":0,"area":"inference"},{"id":"2610.01439","title":"DRelay: Global Draft Context for Prefix-Aware Parallel Speculative Decoding Repair","created":"2026-10-01","cited_by_count":0,"area":"inference"},{"id":"2610.03027","title":"Tailoring the Quantization Space for 1-Bit KV Cache Compression","created":"2026-10-02","cited_by_count":0,"area":"inference"},{"id":"2610.06011","title":"D-Loop: Looped Diffusion Drafting for Speculative Decoding","created":"2026-10-05","cited_by_count":0,"area":"inference"},{"id":"2610.07659","title":"DLoop: Looped Speculative Decoding","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.12570","title":"Contextual Correction of Parallel Draftsfor Speculative Decoding","created":"2026-10-08","cited_by_count":0,"area":"inference"},{"id":"2610.19605","title":"PN-Mix: Pair-Norm Guided Mixed-Precision Key Cache Quantization for Efficient Long-Output LLM Inference","created":"2026-10-14","cited_by_count":0,"area":"inference"},{"id":"2610.19792","title":"JetSpec++: Foresight Parallel Drafting with Self Refinements","created":"2026-10-14","cited_by_count":0,"area":"inference"},{"id":"2610.20175","title":"TreeSpark: Learning to Draft the Trees You Verify for Speculative Decoding","created":"2026-10-14","cited_by_count":0,"area":"inference"},{"id":"2610.20503","title":"ReaDy: Recurrent States as Dynamic Context for Speculative Drafting in Hybrid Linear Attention Large Language Models","created":"2026-10-14","cited_by_count":0,"area":"inference"}],"next_cursor":null}