{"total":70,"rows":[{"id":"2412.21187","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","created":"2024-12-30","cited_by_count":570,"area":"lr"},{"id":"2504.05419","title":"Reasoning Models Know When They're Right: Probing Hidden States for Self-Verification","created":"2025-04-07","cited_by_count":159,"area":"lr"},{"id":"2505.00127","title":"Between Underthinking and Overthinking: An Empirical Study of Reasoning Length and correctness in LLMs","created":"2025-04-30","cited_by_count":117,"area":"lr"},{"id":"2411.07279","title":"The Surprising Effectiveness of Test-Time Training for Few-Shot Learning","created":"2024-11-11","cited_by_count":96,"area":null},{"id":"2410.10347","title":"A Unified Approach to Routing and Cascading for LLMs","created":"2024-10-14","cited_by_count":80,"area":"agents"},{"id":"2511.17006","title":"Budget-Aware Tool Use Enables Effective Agent Scaling","created":"2025-11-21","cited_by_count":44,"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":"2505.18237","title":"Think or Not? Exploring Thinking Efficiency in Large Reasoning Models via an Information-Theoretic Lens","created":"2025-05-23","cited_by_count":34,"area":"lr"},{"id":"2501.01054","title":"Dynamic Scaling of Unit Tests for Code Reward Modeling","created":"2025-01-02","cited_by_count":33,"area":"lr"},{"id":"2507.02076","title":"Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs","created":"2025-07-02","cited_by_count":31,"area":"lr"},{"id":"2508.17196","title":"BudgetThinker: Empowering Budget-aware LLM Reasoning with Control Tokens","created":"2025-08-24","cited_by_count":29,"area":"lr"},{"id":"2508.11126","title":"AI Agentic Programming: A Survey of Techniques, Challenges, and Opportunities","created":"2025-08-15","cited_by_count":28,"area":"agents"},{"id":"2505.19435","title":"Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection","created":"2025-05-26","cited_by_count":23,"area":"lr"},{"id":"2503.17979","title":"Trade-offs in Large Reasoning Models: An Empirical Analysis of Deliberative and Adaptive Reasoning over Foundational Capabilities","created":"2025-03-23","cited_by_count":20,"area":"lr"},{"id":"2502.06258","title":"Emergent Response Planning in LLMs","created":"2025-02-10","cited_by_count":19,"area":"lr"},{"id":"2412.02674","title":"Mind the Gap: Examining the Self-Improvement Capabilities of Large Language Models","created":"2024-12-03","cited_by_count":18,"area":"synth"},{"id":"2505.12392","title":"SLOT: Sample-specific Language Model Optimization at Test-time","created":"2025-05-18","cited_by_count":18,"area":null},{"id":"2504.14350","title":"An Empirical Study of LLM Reasoning Ability Under Strict Output Length Constraint","created":"2025-04-19","cited_by_count":17,"area":"lr"},{"id":"2601.05110","title":"GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts","created":"2026-01-08","cited_by_count":17,"area":"lr"},{"id":"2602.16699","title":"Calibrate-Then-Act: Cost-Aware Exploration in LLM Agents","created":"2026-02-18","cited_by_count":17,"area":"agents"},{"id":"2410.07627","title":"Automatic Curriculum Expert Iteration for Reliable LLM Reasoning","created":"2024-10-10","cited_by_count":16,"area":"lr"},{"id":"2410.22480","title":"Scaling LLM Inference with Optimized Sample Compute Allocation","created":"2024-10-29","cited_by_count":16,"area":"lr"},{"id":"2412.14234","title":"Syzygy: Dual Code-Test C to (safe) Rust Translation using LLMs and Dynamic Analysis","created":"2024-12-18","cited_by_count":16,"area":null},{"id":"2504.19720","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","created":"2025-04-28","cited_by_count":16,"area":"inference"},{"id":"2602.01970","title":"Small Generalizable Prompt Predictive Models Can Steer Efficient RL Post-Training of Large Reasoning Models","created":"2026-02-02","cited_by_count":14,"area":"lr"},{"id":"2504.07081","title":"Self-Steering Language Models","created":"2025-04-09","cited_by_count":13,"area":"lr"},{"id":"2505.12050","title":"AdaBoN: Adaptive Best-of-N Alignment","created":"2025-05-17","cited_by_count":9,"area":"alignment"},{"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":"2506.12721","title":"Strategic Scaling of Test-Time Compute: A Bandit Learning Approach","created":"2025-06-15","cited_by_count":8,"area":"lr"},{"id":"2508.11847","title":"Dropping Just a Handful of Preferences Can Change Top Large Language Model Rankings","created":"2025-08-16","cited_by_count":8,"area":null},{"id":"2509.09864","title":"Latency and Token-Aware Test-Time Compute","created":"2025-09-11","cited_by_count":8,"area":"lr"},{"id":"2506.16043","title":"DynScaling: Efficient Verifier-free Inference Scaling via Dynamic and Integrated Sampling","created":"2025-06-19","cited_by_count":7,"area":"lr"},{"id":"2602.13540","title":"On Calibration of Large Language Models: From Response To Capability","created":"2026-02-14","cited_by_count":7,"area":null},{"id":"2512.01457","title":"Zero-Overhead Introspection for Adaptive Test-Time Compute","created":"2025-12-01","cited_by_count":6,"area":"lr"},{"id":"2506.03978","title":"Structured Pruning for Diverse Best-of-N Reasoning Optimization","created":"2025-06-04","cited_by_count":4,"area":"lr"},{"id":"2509.05226","title":"Less is More Tokens: Efficient Math Reasoning via Difficulty-Aware Chain-of-Thought Distillation","created":"2025-09-05","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":"2511.02130","title":"Re-FORC: Adaptive Reward Prediction for Efficient Chain-of-Thought Reasoning","created":"2025-11-03","cited_by_count":4,"area":"lr"},{"id":"2606.01667","title":"ATLAS: Agentic Test-time Learning-to-Allocate Scaling","created":"2026-06-01","cited_by_count":4,"area":"lr"},{"id":"2606.11576","title":"AVIS: Adaptive Test-Time Scaling for Vision-Language Models","created":"2026-06-10","cited_by_count":4,"area":"lr"},{"id":"2606.31511","title":"Falsification, Not Exposure: An Internally Preregistered Placebo-Controlled Decomposition of Self-Repair Feedback in Frozen Small Code Models","created":"2026-06-30","cited_by_count":4,"area":null},{"id":"2503.09029","title":"DAST: Difficulty-Aware Self-Training on Large Language Models","created":"2025-03-12","cited_by_count":3,"area":"synth"},{"id":"2602.01237","title":"Predictive Scheduling for Efficient Inference-Time Reasoning in Large Language Models","created":"2026-02-01","cited_by_count":3,"area":"lr"},{"id":"2606.04402","title":"Not All Errors Are Equal: Consequence-Aware Reasoning Compute Allocation","created":"2026-06-03","cited_by_count":3,"area":"lr"},{"id":"2606.08854","title":"sGPO: Trading Inference FLOPs for Training Efficiency in RLVR","created":"2026-06-07","cited_by_count":3,"area":null},{"id":"2609.30652","title":"Recursive Self-Improvement via On-Policy Distillation for Reasoning","created":"2026-09-25","cited_by_count":3,"area":"distill"},{"id":"2505.17242","title":"Optimal Policy Minimum Bayesian Risk","created":"2025-05-22","cited_by_count":2,"area":"lr"},{"id":"2509.19996","title":"Choosing to Be Green: Advancing Green AI via Dynamic Model Selection","created":"2025-09-24","cited_by_count":2,"area":null},{"id":"2510.05064","title":"Boomerang Distillation Enables Zero-Shot Model Size Interpolation","created":"2025-10-06","cited_by_count":2,"area":null},{"id":"2511.00521","title":"Reasoning Planning for Language Models","created":"2025-11-01","cited_by_count":2,"area":"lr"},{"id":"2605.15761","title":"A Unified Perturbation Framework for Analyzing Leaderboard Stability and Manipulation","created":"2026-05-15","cited_by_count":2,"area":null},{"id":"2605.17609","title":"Adaptive Generate-Rank-Verify: Inference-Time Search with Costly Verification","created":"2026-05-17","cited_by_count":2,"area":"lr"},{"id":"2606.16999","title":"Selection Without Signal, Recovery Through Expression: A Measurement Study of Post-Hoc Falsification Operators for Frozen Small Code Models","created":"2026-06-15","cited_by_count":2,"area":null},{"id":"2607.12962","title":"Form, Not Content? A Preregistered, Placebo-Controlled Evaluation of Learned Error-Conditioned Self-Repair Through Prompts and Weights in Frozen Small Code Models","created":"2026-07-14","cited_by_count":2,"area":null},{"id":"2608.17124","title":"A decodability criterion predicts when hidden-state selection beats majority voting in large language models","created":"2026-08-17","cited_by_count":2,"area":null},{"id":"2608.26070","title":"Prefix Sliding for efficient test-time scaling","created":"2026-08-26","cited_by_count":2,"area":"lr"},{"id":"2505.16312","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","created":"2025-05-22","cited_by_count":1,"area":"lr"},{"id":"2512.09386","title":"CONCUR: A Framework for Continual Constrained and Unconstrained Routing","created":"2025-12-10","cited_by_count":1,"area":null},{"id":"2602.14681","title":"ST-EVO: Towards Generative Spatio-Temporal Evolution of Multi-Agent Communication Topologies","created":"2026-02-16","cited_by_count":1,"area":"agents"},{"id":"2605.15706","title":"Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Models","created":"2026-05-15","cited_by_count":1,"area":"agents"},{"id":"2606.15841","title":"Heteroskedastic Signals in Budgeted LLM Verification: Structural Heterogeneity Limits Optimization Gains","created":"2026-06-14","cited_by_count":1,"area":null},{"id":"2509.06174","title":"From Long to Short: LLMs Excel at Trimming Own Reasoning Chains","created":"2025-09-07","cited_by_count":0,"area":"lr"},{"id":"2604.00414","title":"Decision-Centric Design for LLM Systems","created":"2026-04-01","cited_by_count":0,"area":null},{"id":"2605.06656","title":"Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2608.13087","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","created":"2026-08-13","cited_by_count":0,"area":null},{"id":"2609.33003","title":"Certified Interface Aliases: Exact Collisions in Vision-Language Preprocessing, and When They Exist","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.34322","title":"Test-Time Scaling via Budgeted Multi-Attribute Verification","created":"2026-09-28","cited_by_count":0,"area":"lr"},{"id":"2610.01110","title":"How Much Can Language Models Gain from Test-Time Computation?","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04889","title":"ForkPilot: Self-Evolving Policy for Retrospective Search in Long-Horizon Agents","created":"2026-10-04","cited_by_count":0,"area":"agents"},{"id":"2610.17917","title":"Batch-Paced: Fixed-Budget Batch Decoding in Discrete Diffusion Language Models","created":"2026-10-13","cited_by_count":0,"area":"diffusion"}],"next_cursor":null}