{"total":75,"rows":[{"id":"2410.16033","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","created":"2024-10-18","cited_by_count":61,"area":"lr"},{"id":"2501.19309","title":"Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment","created":"2025-01-31","cited_by_count":59,"area":"alignment"},{"id":"2407.06089","title":"Merge, Ensemble, and Cooperate! A Survey on Collaborative Strategies in the Era of Large Language Models","created":"2024-07-08","cited_by_count":44,"area":null},{"id":"2508.08712","title":"A Survey on Parallel Text Generation: From Parallel Decoding to Diffusion Language Models","created":"2025-08-12","cited_by_count":30,"area":"diffusion"},{"id":"2411.00841","title":"A Theoretical Perspective for Speculative Decoding Algorithm","created":"2024-10-30","cited_by_count":29,"area":"inference"},{"id":"2410.18351","title":"AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability","created":"2024-10-24","cited_by_count":25,"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":"2406.11477","title":"How Can We Effectively Expand the Vocabulary of LLMs with 0.01GB of Target Language Text?","created":"2024-06-17","cited_by_count":22,"area":null},{"id":"2410.05589","title":"ParallelSpec: Parallel Drafter for Efficient Speculative Decoding","created":"2024-10-08","cited_by_count":22,"area":"inference"},{"id":"2409.00142","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","created":"2024-08-30","cited_by_count":20,"area":"inference"},{"id":"2505.15141","title":"BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms","created":"2025-05-21","cited_by_count":20,"area":"inference"},{"id":"2412.18910","title":"AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures","created":"2024-12-25","cited_by_count":18,"area":"inference"},{"id":"2410.03804","title":"Mixture of Attentions For Speculative Decoding","created":"2024-10-04","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":"2502.15197","title":"TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding","created":"2025-02-21","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":"2601.07353","title":"TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees","created":"2026-01-12","cited_by_count":13,"area":"inference"},{"id":"2502.20704","title":"Fuzzy Speculative Decoding for a Tunable Accuracy-Runtime Tradeoff","created":"2025-02-28","cited_by_count":12,"area":"inference"},{"id":"2502.04557","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","created":"2025-02-06","cited_by_count":11,"area":"inference"},{"id":"2502.13652","title":"C2T: A Classifier-Based Tree Construction Method in Speculative Decoding","created":"2025-02-19","cited_by_count":9,"area":"inference"},{"id":"2504.05598","title":"DEL: Context-Aware Dynamic Exit Layer for Efficient Self-Speculative Decoding","created":"2025-04-08","cited_by_count":8,"area":"inference"},{"id":"2411.13157","title":"Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding","created":"2024-11-20","cited_by_count":7,"area":"inference"},{"id":"2506.03700","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","created":"2025-06-04","cited_by_count":7,"area":"lr"},{"id":"2510.20064","title":"Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs","created":"2025-10-22","cited_by_count":7,"area":"inference"},{"id":"2504.00030","title":"Token-Driven GammaTune: Adaptive Calibration for Enhanced Speculative Decoding","created":"2025-03-28","cited_by_count":6,"area":"inference"},{"id":"2512.22420","title":"Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving","created":"2025-12-27","cited_by_count":6,"area":"inference"},{"id":"2607.02807","title":"SwarmResearch: Orchestrating Coding Agents for Open-Ended Discovery","created":"2026-07-02","cited_by_count":6,"area":"agents"},{"id":"2607.14647","title":"D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decoding","created":"2026-07-16","cited_by_count":5,"area":"moe"},{"id":"2608.30135","title":"Verification-Aware Training for Speculative Decoding","created":"2026-08-31","cited_by_count":5,"area":"inference"},{"id":"2502.18890","title":"TokenSwift: Lossless Acceleration of Ultra Long Sequence Generation","created":"2025-02-26","cited_by_count":4,"area":null},{"id":"2505.17074","title":"Semi-Clairvoyant Scheduling of Speculative Decoding Requests to Minimize LLM Inference Latency","created":"2025-05-20","cited_by_count":4,"area":"inference"},{"id":"2507.02659","title":"OmniDraft: A Cross-vocabulary, Online Adaptive Drafter for On-device Speculative Decoding","created":"2025-07-03","cited_by_count":4,"area":"inference"},{"id":"2511.09844","title":"Steering Pretrained Drafters during Speculative Decoding","created":"2025-11-13","cited_by_count":4,"area":"inference"},{"id":"2512.20573","title":"Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs","created":"2025-12-23","cited_by_count":4,"area":"lr"},{"id":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-08","cited_by_count":4,"area":"inference"},{"id":"2605.13319","title":"PipeSD: An Efficient Cloud-Edge Collaborative Pipeline Inference Framework with Speculative Decoding","created":"2026-05-13","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":"2511.20340","title":"Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarios","created":"2025-11-25","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":"2607.08690","title":"A Practical Investigation of Training-free Relaxed Speculative Decoding","created":"2026-07-09","cited_by_count":3,"area":"inference"},{"id":"2505.13254","title":"HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding","created":"2025-05-19","cited_by_count":2,"area":"inference"},{"id":"2506.03566","title":"POSS: Position Specialist Generates Better Draft for Speculative Decoding","created":"2025-06-04","cited_by_count":2,"area":"inference"},{"id":"2508.13828","title":"Revisiting RAG Ensemble: A Theoretical and Mechanistic Analysis of Multi-RAG System Collaboration","created":"2025-08-19","cited_by_count":2,"area":"rag"},{"id":"2511.02017","title":"TapOut: A Bandit-Based Approach to Dynamic Speculative Decoding","created":"2025-11-03","cited_by_count":2,"area":"inference"},{"id":"2512.11280","title":"AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference","created":"2025-12-12","cited_by_count":2,"area":"inference"},{"id":"2602.01274","title":"PACER: Blockwise Pre-verification for Speculative Decoding with Adaptive Length","created":"2026-02-01","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":"2601.23180","title":"TriSpec: Ternary Speculative Decoding via Lightweight Proxy Verification","created":"2026-01-30","cited_by_count":1,"area":"inference"},{"id":"2602.01956","title":"Efficient Epistemic Uncertainty Estimation for Large Language Models via Knowledge Distillation","created":"2026-02-02","cited_by_count":1,"area":"distill"},{"id":"2602.05145","title":"TIDE: Temporal Incremental Draft Engine for Self-Improving LLM Inference","created":"2026-02-05","cited_by_count":1,"area":"synth"},{"id":"2604.09731","title":"SMART: When is it Actually Worth Expanding a Speculative Tree?","created":"2026-04-09","cited_by_count":1,"area":"inference"},{"id":"2606.20591","title":"Delay-Adaptive Speculation Control for Low-Latency Edge-Cloud LLM Inference","created":"2026-05-17","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":"2608.24411","title":"ResiSpec: Enhancing Multi-Candidate Speculative Sampling via Residual Distribution Shaping","created":"2026-08-25","cited_by_count":1,"area":"inference"},{"id":"2609.01068","title":"OUTLETS: Output-Length Prediction from Speculative Decoding Backbones","created":"2026-09-01","cited_by_count":1,"area":"inference"},{"id":"2609.02897","title":"Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding","created":"2026-07-03","cited_by_count":1,"area":"inference"},{"id":"2505.08600","title":"Automatic Task Detection and Heterogeneous LLM Speculative Decoding","created":"2025-05-13","cited_by_count":0,"area":"inference"},{"id":"2512.14069","title":"RADAR: Accelerate Large Language Model Inference With RL-Based Dynamic Draft Trees","created":"2025-12-16","cited_by_count":0,"area":"inference"},{"id":"2601.12212","title":"Speculative Sampling with Reinforcement Learning","created":"2026-01-18","cited_by_count":0,"area":"lr"},{"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":"2604.09562","title":"StreamServe: Adaptive Speculative Flows for Low-Latency Disaggregated LLM Serving","created":"2026-02-11","cited_by_count":0,"area":"inference"},{"id":"2604.15672","title":"Faster LLM Inference via Sequential Monte Carlo","created":"2026-04-17","cited_by_count":0,"area":"inference"},{"id":"2607.05148","title":"Fully Rotation-Equivariant Spectral-Spatial Learning for Multispectral Object Detection","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2608.05303","title":"EdgeXpert: An Edge Device for Memory-Efficient LLM Inference with Mixture-of-Experts and Speculative Decoding","created":"2026-08-05","cited_by_count":0,"area":"moe"},{"id":"2608.08721","title":"LibraSpec: Dynamic Diffusion-Based Speculative Decoding via Marginal-Gain-Driven Optimization","created":"2026-08-09","cited_by_count":0,"area":"inference"},{"id":"2608.14787","title":"From Positionwise Confidence to Prefix Scheduling: Verifier Skipping in Speculative Decoding","created":"2026-08-14","cited_by_count":0,"area":"inference"},{"id":"2609.00355","title":"Vision Is Not Overhead: One-Pass Block Drafting for Lossless Speculative Decoding in Vision-Language Models","created":"2026-08-31","cited_by_count":0,"area":"mllm"},{"id":"2609.37532","title":"DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verification","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2610.00321","title":"CAST: Cost-Aware Speculative Trees from One-Pass Block Drafters","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2610.01108","title":"AgSpec: Pushing the Limits of Retrieval-Based Speculative Decoding in Coding Agent Pipelines","created":"2026-10-01","cited_by_count":0,"area":"agents"},{"id":"2610.05774","title":"AdaSpark: Adaptive DSpark with Online Learning for Tree Verification and N-gram Fill","created":"2026-10-05","cited_by_count":0,"area":"moe"},{"id":"2610.07350","title":"Trajectory-Retrieval Speculative Decoding: When Does a Model's Own History Help?","created":"2026-10-05","cited_by_count":0,"area":"lr"},{"id":"2610.07659","title":"DLoop: Looped Speculative Decoding","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.10411","title":"Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds","created":"2026-10-07","cited_by_count":0,"area":"inference"},{"id":"2610.18735","title":"SP$^2$ec: Adaptive Self-Speculative Decoding for Vision-Language Models","created":"2026-10-13","cited_by_count":0,"area":"mllm"}],"next_cursor":null}