{"total":19,"rows":[{"id":"2509.08827","title":"A Survey of Reinforcement Learning for Large Reasoning Models","created":"2025-09-10","cited_by_count":180,"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":"2505.19640","title":"Interleaved Reasoning for Large Language Models via Reinforcement Learning","created":"2025-05-26","cited_by_count":21,"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":"2509.07339","title":"Performative Thinking? The Brittle Correlation Between CoT Length and Problem Complexity","created":"2025-09-09","cited_by_count":9,"area":"lr"},{"id":"2510.01459","title":"LSPO: Length-aware Dynamic Sampling for Policy Optimization in LLM Reasoning","created":"2025-10-01","cited_by_count":9,"area":"lr"},{"id":"2509.23129","title":"C$^2$GSPG: Confidence-calibrated Group Sequence Policy Gradient towards Self-aware Reasoning","created":"2025-09-27","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":"2510.27419","title":"DeepCompress: A Dual Reward Strategy for Dynamically Exploring and Compressing Reasoning Chains","created":"2025-10-31","cited_by_count":7,"area":"lr"},{"id":"2605.03314","title":"When to Think, When to Speak: Learning Disclosure Policies for LLM Reasoning","created":"2026-05-05","cited_by_count":5,"area":"lr"},{"id":"2509.07558","title":"VL Norm: Rethink Loss Aggregation in RLVR","created":"2025-09-09","cited_by_count":4,"area":"lr"},{"id":"2605.05365","title":"ZAYA1-8B Technical Report","created":"2026-05-06","cited_by_count":4,"area":"lr"},{"id":"2606.22716","title":"Beyond Penalizing Mistakes: Stabilizing Efficiency Training in Large Reasoning Models via Adaptive Correct-Only Rewards","created":"2026-06-21","cited_by_count":3,"area":"lr"},{"id":"2602.11639","title":"PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning","created":"2026-02-12","cited_by_count":2,"area":"lr"},{"id":"2510.07685","title":"LiveThinking: Enabling Real-Time Efficient Reasoning for AI-Powered Livestreaming via Reinforcement Learning","created":"2025-10-09","cited_by_count":1,"area":"lr"},{"id":"2602.00425","title":"Segment-Level Attribution for Selective Learning of Long Reasoning Traces","created":"2026-01-31","cited_by_count":1,"area":"lr"},{"id":"2605.22211","title":"CLORE: Content-Level Optimization for Reasoning Efficiency","created":"2026-05-21","cited_by_count":0,"area":"lr"},{"id":"2606.31260","title":"Plan Right, Then Plan Tight: Symbolic RL for Efficient Embodied Reasoning","created":"2026-06-30","cited_by_count":0,"area":"lr"},{"id":"2609.38854","title":"Mitigating the Length-Scaling Tax with Online Distillation","created":"2026-09-30","cited_by_count":0,"area":"lr"}],"next_cursor":null}