{"total":159,"rows":[{"id":"2402.03300","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","created":"2024-02-05","cited_by_count":9379,"area":"lr"},{"id":"2312.08935","title":"Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations","created":"2023-12-14","cited_by_count":928,"area":"lr"},{"id":"2304.06767","title":"RAFT: Reward rAnked FineTuning for Generative Foundation Model Alignment","created":"2023-04-13","cited_by_count":686,"area":"lr"},{"id":"2401.15077","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","created":"2024-01-26","cited_by_count":578,"area":"lr"},{"id":"2503.22020","title":"CoT-VLA: Visual Chain-of-Thought Reasoning for Vision-Language-Action Models","created":"2025-03-27","cited_by_count":451,"area":"lr"},{"id":"2502.17419","title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","created":"2025-02-24","cited_by_count":320,"area":"lr"},{"id":"2309.17179","title":"Alphazero-like Tree-Search can Guide Large Language Model Decoding and Training","created":"2023-09-29","cited_by_count":295,"area":"lr"},{"id":"2412.18547","title":"Token-Budget-Aware LLM Reasoning","created":"2024-12-24","cited_by_count":247,"area":"lr"},{"id":"2502.04463","title":"Training Language Models to Reason Efficiently","created":"2025-02-06","cited_by_count":247,"area":"lr"},{"id":"2506.15841","title":"MEM1: Learning to Synergize Memory and Reasoning for Efficient Long-Horizon Agents","created":"2025-06-18","cited_by_count":238,"area":"lr"},{"id":"2403.17887","title":"The Unreasonable Ineffectiveness of the Deeper Layers","created":"2024-03-26","cited_by_count":226,"area":"lr"},{"id":"2402.10200","title":"Chain-of-Thought Reasoning Without Prompting","created":"2024-02-15","cited_by_count":210,"area":"lr"},{"id":"2309.15402","title":"Navigate through Enigmatic Labyrinth A Survey of Chain of Thought Reasoning: Advances, Frontiers and Future","created":"2023-09-27","cited_by_count":184,"area":"lr"},{"id":"2312.04511","title":"An LLM Compiler for Parallel Function Calling","created":"2023-12-07","cited_by_count":179,"area":"lr"},{"id":"2310.03094","title":"Large Language Model Cascades with Mixture of Thoughts Representations for Cost-efficient Reasoning","created":"2023-10-04","cited_by_count":143,"area":"lr"},{"id":"2412.19442","title":"A Survey on Large Language Model Acceleration based on KV Cache Management","created":"2024-12-27","cited_by_count":131,"area":"lr"},{"id":"2505.07608","title":"MiMo: Unlocking the Reasoning Potential of Language Model -- From Pretraining to Posttraining","created":"2025-05-12","cited_by_count":121,"area":"lr"},{"id":"2502.12134","title":"SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs","created":"2025-02-17","cited_by_count":116,"area":"lr"},{"id":"2501.19324","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","created":"2025-01-31","cited_by_count":106,"area":"lr"},{"id":"2307.15337","title":"Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation","created":"2023-07-28","cited_by_count":105,"area":"lr"},{"id":"2406.09136","title":"Chain of Preference Optimization: Improving Chain-of-Thought Reasoning in LLMs","created":"2024-06-13","cited_by_count":96,"area":"lr"},{"id":"2407.21018","title":"ThinK: Thinner Key Cache by Query-Driven Pruning","created":"2024-07-30","cited_by_count":68,"area":"lr"},{"id":"2410.01707","title":"Interpretable Contrastive Monte Carlo Tree Search Reasoning","created":"2024-10-02","cited_by_count":64,"area":"lr"},{"id":"2503.01422","title":"Sampling-Efficient Test-Time Scaling: Self-Estimating the Best-of-N Sampling in Early Decoding","created":"2025-03-03","cited_by_count":63,"area":"lr"},{"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":"2504.07891","title":"SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning","created":"2025-04-10","cited_by_count":59,"area":"lr"},{"id":"2310.08582","title":"Tree-Planner: Efficient Close-loop Task Planning with Large Language Models","created":"2023-10-12","cited_by_count":48,"area":"lr"},{"id":"2504.12329","title":"Speculative Thinking: Enhancing Small-Model Reasoning with Large Model Guidance at Inference Time","created":"2025-04-12","cited_by_count":48,"area":"lr"},{"id":"2504.13171","title":"Sleep-time Compute: Beyond Inference Scaling at Test-time","created":"2025-04-17","cited_by_count":43,"area":"lr"},{"id":"2502.16235","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","created":"2025-02-22","cited_by_count":42,"area":"lr"},{"id":"2501.02497","title":"A Survey of Test-Time Compute: From Intuitive Inference to Deliberate Reasoning","created":"2025-01-05","cited_by_count":40,"area":"lr"},{"id":"2506.04301","title":"The Cost of Dynamic Reasoning: Demystifying AI Agents and Test-Time Scaling from an AI Infrastructure Perspective","created":"2025-06-04","cited_by_count":39,"area":"lr"},{"id":"2508.18588","title":"History Rhymes: Accelerating LLM Reinforcement Learning with RhymeRL","created":"2025-08-26","cited_by_count":38,"area":"lr"},{"id":"2506.08889","title":"SeerAttention-R: Sparse Attention Adaptation for Long Reasoning","created":"2025-06-10","cited_by_count":30,"area":"lr"},{"id":"2509.18521","title":"APRIL: Active Partial Rollouts in Reinforcement Learning to Tame Long-tail Generation","created":"2025-09-23","cited_by_count":30,"area":"lr"},{"id":"2505.18962","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","created":"2025-05-25","cited_by_count":27,"area":"lr"},{"id":"2507.15375","title":"STITCH: Simultaneous Thinking and Talking with Chunked Reasoning for Spoken Language Models","created":"2025-07-21","cited_by_count":26,"area":"lr"},{"id":"2504.13626","title":"Thought Manipulation: External Thought Can Be Efficient for Large Reasoning Models","created":"2025-04-18","cited_by_count":23,"area":"lr"},{"id":"2510.05069","title":"SwiReasoning: Switch-Thinking in Latent and Explicit for Pareto-Superior Reasoning LLMs","created":"2025-10-06","cited_by_count":22,"area":"lr"},{"id":"2410.05563","title":"Rational Metareasoning for Large Language Models","created":"2024-10-07","cited_by_count":20,"area":"lr"},{"id":"2502.15964","title":"Minions: Cost-efficient Collaboration Between On-device and Cloud Language Models","created":"2025-02-21","cited_by_count":20,"area":"lr"},{"id":"2603.22446","title":"Sparse but Critical: A Token-Level Analysis of Distributional Shifts in RLVR Fine-Tuning of LLMs","created":"2026-03-23","cited_by_count":20,"area":"lr"},{"id":"2510.06917","title":"SHANKS: Simultaneous Hearing and Thinking for Spoken Language Models","created":"2025-10-08","cited_by_count":19,"area":"lr"},{"id":"2510.26475","title":"ReSpec: Towards Optimizing Speculative Decoding in Reinforcement Learning Systems","created":"2025-10-30","cited_by_count":18,"area":"lr"},{"id":"2312.01279","title":"TextGenSHAP: Scalable Post-hoc Explanations in Text Generation with Long Documents","created":"2023-12-03","cited_by_count":17,"area":"lr"},{"id":"2505.02865","title":"Accelerating Large Language Model Reasoning via Speculative Search","created":"2025-05-03","cited_by_count":16,"area":"lr"},{"id":"2604.10739","title":"When More Thinking Hurts: Overthinking in LLM Test-Time Compute Scaling","created":"2026-04-12","cited_by_count":16,"area":"lr"},{"id":"2502.20548","title":"$Q\\sharp$: Provably Optimal Distributional RL for LLM Post-Training","created":"2025-02-27","cited_by_count":15,"area":"lr"},{"id":"2505.14733","title":"The Energy Cost of Reasoning: Analyzing Energy Usage in LLMs with Test-time Compute","created":"2025-05-20","cited_by_count":15,"area":"lr"},{"id":"2510.24051","title":"Pie: A Programmable Serving System for Emerging LLM Applications","created":"2025-10-28","cited_by_count":14,"area":"lr"},{"id":"2506.19830","title":"Scaling Speculative Decoding with Lookahead Reasoning","created":"2025-06-24","cited_by_count":13,"area":"lr"},{"id":"2509.23232","title":"SPEC-RL: Accelerating On-Policy Reinforcement Learning with Speculative Rollouts","created":"2025-09-27","cited_by_count":12,"area":"lr"},{"id":"2505.12601","title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","created":"2025-05-19","cited_by_count":11,"area":"lr"},{"id":"2509.07604","title":"K2-Think: A Parameter-Efficient Reasoning System","created":"2025-09-09","cited_by_count":11,"area":"lr"},{"id":"2510.12164","title":"A Survey on Parallel Reasoning","created":"2025-10-14","cited_by_count":11,"area":"lr"},{"id":"2512.01278","title":"Accelerating Large-Scale Reasoning Model Inference with Sparse Self-Speculative Decoding","created":"2025-12-01","cited_by_count":10,"area":"lr"},{"id":"2509.11961","title":"Spec-LLaVA: Accelerating Vision-Language Models with Dynamic Tree-Based Speculative Decoding","created":"2025-09-15","cited_by_count":9,"area":"lr"},{"id":"2509.21792","title":"FastGRPO: Accelerating Policy Optimization via Concurrency-aware Speculative Decoding and Online Draft Learning","created":"2025-09-26","cited_by_count":9,"area":"lr"},{"id":"2509.24248","title":"SpecExit: Accelerating Large Reasoning Model via Speculative Exit","created":"2025-09-29","cited_by_count":9,"area":"lr"},{"id":"2510.12680","title":"Demystifying Hybrid Thinking: Can LLMs Truly Switch Between Think and No-Think?","created":"2025-10-14","cited_by_count":9,"area":"lr"},{"id":"2511.06190","title":"Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning","created":"2025-11-09","cited_by_count":9,"area":"lr"},{"id":"2512.15176","title":"DEER: Draft with Diffusion, Verify with Autoregressive Models","created":"2025-12-17","cited_by_count":9,"area":"lr"},{"id":"2604.14853","title":"Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization","created":"2026-04-16","cited_by_count":9,"area":"lr"},{"id":"2410.01556","title":"Integrative Decoding: Improve Factuality via Implicit Self-consistency","created":"2024-10-02","cited_by_count":8,"area":"lr"},{"id":"2502.13329","title":"Language Models Can Predict Their Own Behavior","created":"2025-02-18","cited_by_count":8,"area":"lr"},{"id":"2506.03616","title":"Learning to Insert [PAUSE] Tokens for Better Reasoning","created":"2025-06-04","cited_by_count":8,"area":"lr"},{"id":"2511.20048","title":"Reducing Latency of LLM Search Agent via Speculation-based Algorithm-System Co-Design","created":"2025-11-25","cited_by_count":8,"area":"lr"},{"id":"2406.06576","title":"OccamLLM: Fast and Exact Language Model Arithmetic in a Single Step","created":"2024-06-04","cited_by_count":7,"area":"lr"},{"id":"2503.09620","title":"Exploiting Edited Large Language Models as General Scientific Optimizers","created":"2025-03-08","cited_by_count":7,"area":"lr"},{"id":"2505.07861","title":"Scalable LLM Reasoning Acceleration with Low-rank Distillation","created":"2025-05-08","cited_by_count":7,"area":"lr"},{"id":"2505.12992","title":"Fractured Chain-of-Thought Reasoning","created":"2025-05-19","cited_by_count":7,"area":"lr"},{"id":"2506.03700","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","created":"2025-06-04","cited_by_count":7,"area":"lr"},{"id":"2506.11578","title":"Efficient LLM Collaboration via Planning","created":"2025-06-13","cited_by_count":7,"area":"lr"},{"id":"2606.01476","title":"OmniOPD: Logit-Free On-Policy Distillation via Speculative Verification","created":"2026-05-31","cited_by_count":7,"area":"lr"},{"id":"2503.20533","title":"Accelerate Parallelizable Reasoning via Parallel Decoding within One Sequence","created":"2025-03-26","cited_by_count":6,"area":"lr"},{"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":"2602.01469","title":"P-EAGLE: Parallel-Drafting EAGLE with Scalable Training","created":"2026-02-01","cited_by_count":6,"area":"lr"},{"id":"2603.13319","title":"LightningRL: Breaking the Accuracy-Parallelism Trade-off of Block-wise dLLMs via Reinforcement Learning","created":"2026-03-04","cited_by_count":6,"area":"lr"},{"id":"2603.16219","title":"SpecSteer: Synergizing Local Context and Global Reasoning for Efficient Personalized Generation","created":"2026-03-17","cited_by_count":6,"area":"lr"},{"id":"2606.15079","title":"Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale","created":"2026-06-13","cited_by_count":6,"area":"lr"},{"id":"2606.18967","title":"EfficientRollout: System-Aware Self-Speculative Decoding for RL Rollouts","created":"2026-06-17","cited_by_count":6,"area":"lr"},{"id":"2502.12214","title":"Zero Token-Driven Deep Thinking in LLMs: Unlocking the Full Potential of Existing Parameters via Cyclic Refinement","created":"2025-02-17","cited_by_count":5,"area":"lr"},{"id":"2503.05330","title":"Speculative Decoding for Multi-Sample Inference","created":"2025-03-07","cited_by_count":5,"area":"lr"},{"id":"2509.24238","title":"Learning to Ponder: Adaptive Reasoning in Latent Space","created":"2025-09-29","cited_by_count":5,"area":"lr"},{"id":"2601.09083","title":"SRT: Accelerating Reinforcement Learning via Speculative Rollout with Tree-Structured Cache","created":"2026-01-14","cited_by_count":5,"area":"lr"},{"id":"2602.06107","title":"Jackpot: Optimal Budgeted Rejection Sampling for Extreme Actor-Policy Mismatch Reinforcement Learning","created":"2026-02-05","cited_by_count":5,"area":"lr"},{"id":"2606.08446","title":"Sparrow: Sparse Rollout for Stable and Efficient Long-context RL of Large Language Models","created":"2026-06-07","cited_by_count":5,"area":"lr"},{"id":"2407.03951","title":"Uncertainty-Guided Likelihood Tree Search","created":"2024-07-04","cited_by_count":4,"area":"lr"},{"id":"2504.01931","title":"On the Role of Feedback in Test-Time Scaling of Agentic AI Workflows","created":"2025-04-02","cited_by_count":4,"area":"lr"},{"id":"2505.07858","title":"Scaling Laws for Speculative Decoding","created":"2025-05-08","cited_by_count":4,"area":"lr"},{"id":"2509.20368","title":"LATTS: Locally Adaptive Test-Time Scaling","created":"2025-09-16","cited_by_count":4,"area":"lr"},{"id":"2510.09354","title":"Logit Arithmetic Elicits Long Reasoning Capabilities Without Training","created":"2025-10-10","cited_by_count":4,"area":"lr"},{"id":"2511.19473","title":"WavefrontDiffusion: Dynamic Decoding Schedule for Improved Reasoning","created":"2025-11-22","cited_by_count":4,"area":"lr"},{"id":"2603.02023","title":"PonderLM-3: Adaptive Token-Wise Pondering with Differentiable Masking","created":"2026-03-02","cited_by_count":4,"area":"lr"},{"id":"2506.17296","title":"Semantic uncertainty in advanced decoding methods for LLM generation","created":"2025-06-17","cited_by_count":3,"area":"lr"},{"id":"2509.15148","title":"ATTS: Asynchronous Test-Time Scaling via Conformal Prediction","created":"2025-09-18","cited_by_count":3,"area":"lr"},{"id":"2510.16276","title":"What Limits Agentic Systems Efficiency?","created":"2025-10-18","cited_by_count":3,"area":"lr"},{"id":"2512.03057","title":"A note on conditional PAC-efficient reasoning in large language model routing","created":"2025-11-25","cited_by_count":3,"area":"lr"},{"id":"2601.15296","title":"Entropy-Tree: Tree-Based Decoding with Entropy-Guided Exploration","created":"2026-01-02","cited_by_count":3,"area":"lr"},{"id":"2603.06619","title":"Not all tokens are needed(NAT): token efficient reinforcement learning","created":"2026-02-20","cited_by_count":3,"area":"lr"}],"next_cursor":"100"}