{"total":24,"rows":[{"id":"2505.17813","title":"Don't Overthink it. Preferring Shorter Thinking Chains for Improved LLM Reasoning","created":"2025-05-23","cited_by_count":85,"area":"lr"},{"id":"2506.09026","title":"e3: Learning to Explore Enables Extrapolation of Test-Time Compute for LLMs","created":"2025-06-10","cited_by_count":59,"area":"lr"},{"id":"2508.02120","title":"Don't Overthink It: A Survey of Efficient R1-style Large Reasoning Models","created":"2025-08-04","cited_by_count":37,"area":"lr"},{"id":"2602.04879","title":"Rethinking the Trust Region in LLM Reinforcement Learning","created":"2026-02-04","cited_by_count":37,"area":"lr"},{"id":"2508.10293","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","created":"2025-08-14","cited_by_count":28,"area":"lr"},{"id":"2509.26522","title":"Entropy After </Think> for reasoning model early exiting","created":"2025-09-30","cited_by_count":24,"area":"lr"},{"id":"2511.06411","title":"SofT-GRPO: Surpassing Discrete-Token LLM Reinforcement Learning via Gumbel-Reparameterized Soft-Thinking Policy Optimization","created":"2025-11-09","cited_by_count":21,"area":"lr"},{"id":"2602.08354","title":"Does Your Reasoning Model Implicitly Know When to Stop Thinking?","created":"2026-02-09","cited_by_count":19,"area":"lr"},{"id":"2507.09662","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","created":"2025-07-13","cited_by_count":18,"area":"lr"},{"id":"2511.10788","title":"From Efficiency to Adaptivity: A Deeper Look at Adaptive Reasoning in Large Language Models","created":"2025-11-13","cited_by_count":12,"area":"lr"},{"id":"2601.19280","title":"Group Distributionally Robust Optimization-Driven Reinforcement Learning for LLM Reasoning","created":"2026-01-27","cited_by_count":12,"area":"lr"},{"id":"2506.07104","title":"How Far Are We from Optimal Reasoning Efficiency?","created":"2025-06-08","cited_by_count":8,"area":"lr"},{"id":"2509.22637","title":"Variational Reasoning for Language Models","created":"2025-09-26","cited_by_count":8,"area":"lr"},{"id":"2601.03822","title":"ROI-Reasoning: Rational Optimization for Inference via Pre-Computation Meta-Cognition","created":"2026-01-07","cited_by_count":8,"area":"lr"},{"id":"2601.11340","title":"Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models","created":"2026-01-16","cited_by_count":8,"area":"lr"},{"id":"2602.20945","title":"The Art of Efficient Reasoning: Data, Reward, and Optimization","created":"2026-02-24","cited_by_count":4,"area":"lr"},{"id":"2604.05164","title":"Not All Turns Are Equally Hard: Adaptive Thinking Budgets For Efficient Multi-Turn Reasoning in Agents","created":"2026-04-06","cited_by_count":4,"area":"lr"},{"id":"2608.23566","title":"Best Practice Critic Optimization","created":"2026-08-24","cited_by_count":4,"area":"lr"},{"id":"2604.23333","title":"Process Supervision of Confidence Margin for Calibrated LLM Reasoning","created":"2026-04-25","cited_by_count":2,"area":"lr"},{"id":"2609.00813","title":"One Policy, Any Budget: Internalizing Budget-Aware Search via Reinforcement Learning","created":"2026-09-01","cited_by_count":2,"area":"lr"},{"id":"2601.11038","title":"Budget-Aware Anytime Reasoning with LLM-Synthesized Preference Data","created":"2026-01-16","cited_by_count":1,"area":"lr"},{"id":"2602.01198","title":"A State-Transition Framework for Efficient LLM Reasoning","created":"2026-02-01","cited_by_count":1,"area":"lr"},{"id":"2604.19780","title":"Avoiding Overthinking and Underthinking: Curriculum-Aware Budget Scheduling for LLMs","created":"2026-03-29","cited_by_count":0,"area":"lr"},{"id":"2605.10195","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","created":"2026-05-11","cited_by_count":0,"area":"lr"}],"next_cursor":null}