{"total":80,"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":"2509.21240","title":"Tree Search for LLM Agent Reinforcement Learning","created":"2025-09-25","cited_by_count":79,"area":"agents"},{"id":"2508.17445","title":"TreePO: Bridging the Gap of Policy Optimization and Efficacy and Inference Efficiency with Heuristic Tree-based Modeling","created":"2025-08-24","cited_by_count":61,"area":"lr"},{"id":"2510.14545","title":"Agentic Entropy-Balanced Policy Optimization","created":"2025-10-16","cited_by_count":40,"area":"agents"},{"id":"2508.11356","title":"ETTRL: Balancing Exploration and Exploitation in LLM Test-Time Reinforcement Learning Via Entropy Mechanism","created":"2025-08-15","cited_by_count":36,"area":null},{"id":"2509.16679","title":"Reinforcement Learning Meets Large Language Models: A Survey of Advancements and Applications Across the LLM Lifecycle","created":"2025-09-20","cited_by_count":35,"area":null},{"id":"2509.18314","title":"Exploiting Tree Structure for Credit Assignment in RL Training of LLMs","created":"2025-09-22","cited_by_count":27,"area":"lr"},{"id":"2509.25849","title":"Knapsack RL: Unlocking Exploration of LLMs via Optimizing Budget Allocation","created":"2025-09-30","cited_by_count":22,"area":null},{"id":"2510.01123","title":"Rethinking Thinking Tokens: LLMs as Improvement Operators","created":"2025-10-01","cited_by_count":21,"area":"lr"},{"id":"2606.01779","title":"HarnessForge: Joint Harness and Policy Evolution for Adaptive Agent Systems","created":"2026-06-01","cited_by_count":21,"area":"agents"},{"id":"2510.06672","title":"XRPO: Pushing the limits of GRPO with Targeted Exploration and Exploitation","created":"2025-10-08","cited_by_count":18,"area":"lr"},{"id":"2510.24698","title":"ParallelMuse: Agentic Parallel Thinking for Deep Information Seeking","created":"2025-10-28","cited_by_count":14,"area":"agents"},{"id":"2607.05378","title":"CompactionRL: Reinforcement Learning with Context Compaction for Long-Horizon Agents","created":"2026-07-06","cited_by_count":14,"area":"lr"},{"id":"2510.24302","title":"Lookahead Tree-Based Rollouts for Enhanced Trajectory-Level Exploration in Reinforcement Learning with Verifiable Rewards","created":"2025-10-28","cited_by_count":13,"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":"2510.24694","title":"Repurposing Synthetic Data for Fine-grained Search Agent Supervision","created":"2025-10-28","cited_by_count":11,"area":"lr"},{"id":"2512.07733","title":"SpatialDreamer: Incentivizing Spatial Reasoning via Active Mental Imagery","created":"2025-12-08","cited_by_count":11,"area":"lr"},{"id":"2601.20209","title":"Spark: Strategic Policy-Aware Exploration via Dynamic Branching for Long-Horizon Agentic Learning","created":"2026-01-28","cited_by_count":11,"area":"agents"},{"id":"2509.21154","title":"GRPO is Secretly a Process Reward Model","created":"2025-09-25","cited_by_count":10,"area":"lr"},{"id":"2509.24494","title":"Why Tree-Style Branching Matters for Thought Advantage Estimation in GRPO","created":"2025-09-29","cited_by_count":10,"area":"lr"},{"id":"2606.11119","title":"TRACE: A Unified Rollout Budget Allocation Framework for Efficient Agentic Reinforcement Learning","created":"2026-06-09","cited_by_count":10,"area":"agents"},{"id":"2602.13691","title":"PhGPO: Pheromone-Guided Policy Optimization for Long-Horizon Tool Planning","created":"2026-02-14","cited_by_count":9,"area":"agents"},{"id":"2605.02913","title":"Generate, Filter, Control, Replay: A Comprehensive Survey of Rollout Strategies for LLM Reinforcement Learning","created":"2026-04-08","cited_by_count":9,"area":"lr"},{"id":"2605.22511","title":"Search-E1: Self-Distillation Drives Self-Evolution in Search-Augmented Reasoning","created":"2026-05-21","cited_by_count":9,"area":"lr"},{"id":"2510.02286","title":"Tree-based Dialogue Reinforced Policy Optimization for Red-Teaming Attacks","created":"2025-10-02","cited_by_count":8,"area":"safety"},{"id":"2601.04767","title":"AT$^2$PO: Agentic Turn-based Policy Optimization via Tree Search","created":"2026-01-08","cited_by_count":8,"area":"agents"},{"id":"2603.02216","title":"ATPO: Adaptive Tree Policy Optimization for Multi-Turn Medical Dialogue","created":"2026-02-10","cited_by_count":8,"area":null},{"id":"2511.04800","title":"Explore Data Left Behind in Reinforcement Learning for Reasoning Language Models","created":"2025-11-06","cited_by_count":7,"area":"lr"},{"id":"2512.04949","title":"CARL: Criticality-Aware Agentic Reinforcement Learning","created":"2025-12-04","cited_by_count":5,"area":"agents"},{"id":"2601.03703","title":"TreeAdv: Tree-Structured Advantage Redistribution for Group-Based RL","created":"2026-01-07","cited_by_count":5,"area":"lr"},{"id":"2601.06922","title":"TreePS-RAG: Tree-based Process Supervision for Reinforcement Learning in Agentic RAG","created":"2026-01-11","cited_by_count":5,"area":"rag"},{"id":"2606.18089","title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","created":"2026-06-16","cited_by_count":5,"area":"lr"},{"id":"2602.02150","title":"ECHO: Entropy-Confidence Hybrid Optimization for Test-Time Reinforcement Learning","created":"2026-02-02","cited_by_count":4,"area":"lr"},{"id":"2602.22642","title":"Compress the Easy, Explore the Hard: Difficulty-Aware Entropy Regularization for Efficient LLM Reasoning","created":"2026-02-26","cited_by_count":4,"area":"lr"},{"id":"2605.28814","title":"Self-Improving Language Models with Bidirectional Evolutionary Search","created":"2026-05-27","cited_by_count":4,"area":"agents"},{"id":"2606.12384","title":"APPO: Agentic Procedural Policy Optimization","created":"2026-06-10","cited_by_count":4,"area":"agents"},{"id":"2606.26453","title":"Optimizing CUDA like a Human: Micro-Profiling Tools as Expert Surrogates for LLM-Based GPU Kernel Optimization","created":"2026-06-24","cited_by_count":4,"area":null},{"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.20046","title":"Experience is the Best Teacher: Motivating Effective Exploration in Reinforcement Learning for LLMs","created":"2026-03-20","cited_by_count":3,"area":"lr"},{"id":"2605.18864","title":"SAGE: Shaping Anchors for Guided Exploration in RLVR of LLMs","created":"2026-05-15","cited_by_count":3,"area":"lr"},{"id":"2606.18954","title":"GraphPO: Graph-based Policy Optimization for Reasoning Models","created":"2026-06-17","cited_by_count":3,"area":"lr"},{"id":"2510.15502","title":"The Road Less Traveled: Enhancing Exploration in LLMs via Sequential Sampling","created":"2025-10-17","cited_by_count":2,"area":"lr"},{"id":"2602.14917","title":"BFS-PO: Best-First Search for Large Reasoning Models","created":"2026-02-16","cited_by_count":2,"area":"lr"},{"id":"2605.06200","title":"A$^2$TGPO: Agentic Turn-Group Policy Optimization with Adaptive Turn-level Clipping","created":"2026-05-07","cited_by_count":2,"area":"agents"},{"id":"2605.28295","title":"Where Rollouts Begin: Low-Load, High-Leverage First-Token Diversification for RLVR","created":"2026-05-27","cited_by_count":2,"area":"lr"},{"id":"2605.29697","title":"Beyond Trajectory Rewards: Step-level Credit Assignment for Agentic Search via Graph Modeling","created":"2026-05-28","cited_by_count":2,"area":"agents"},{"id":"2606.25354","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","created":"2026-06-24","cited_by_count":2,"area":"lr"},{"id":"2608.19803","title":"MileGPO: Milestone Inference with Local Evidence for Graph-Based Policy Optimization of Long-Horizon LLM Agents","created":"2026-08-20","cited_by_count":2,"area":"agents"},{"id":"2609.08650","title":"Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR","created":"2026-09-08","cited_by_count":2,"area":"lr"},{"id":"2609.18708","title":"Rethinking Critic Learning in PPO: Understanding and Mitigating Value Flattening","created":"2026-09-16","cited_by_count":2,"area":"lr"},{"id":"2602.08533","title":"Dialogue Model Optimization via Agent Game and Adaptive Tree-based GRPO","created":"2026-02-09","cited_by_count":1,"area":"lr"},{"id":"2604.10029","title":"Self-Distilled Reinforcement Learning for Co-Evolving Agentic Recommender Systems","created":"2026-04-11","cited_by_count":1,"area":"agents"},{"id":"2604.14564","title":"MARS$^2$: Scaling Multi-Agent Tree Search via Reinforcement Learning for Code Generation","created":"2026-04-16","cited_by_count":1,"area":null},{"id":"2605.04811","title":"Tree-based Credit Assignment for Multi-Agent Memory System","created":"2026-05-06","cited_by_count":1,"area":"agents"},{"id":"2607.16205","title":"It Takes 8 Tokens: Weak-to-Strong Off-Policy RL via Auxiliary Branches","created":"2026-05-07","cited_by_count":1,"area":"lr"},{"id":"2608.24300","title":"Contrastive Branch Policy Optimization","created":"2026-08-25","cited_by_count":1,"area":null},{"id":"2609.07821","title":"A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM","created":"2026-09-07","cited_by_count":1,"area":"lr"},{"id":"2609.20004","title":"EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning","created":"2026-09-17","cited_by_count":1,"area":"lr"},{"id":"2602.14169","title":"Deep Dense Exploration for LLM Reinforcement Learning via Pivot-Driven Resampling","created":"2026-02-15","cited_by_count":0,"area":"lr"},{"id":"2604.10827","title":"Know Thy Reasoner: Not All Language Models Explore Alike","created":"2026-04-12","cited_by_count":0,"area":"lr"},{"id":"2604.14518","title":"Mind DeepResearch Technical Report","created":"2026-04-16","cited_by_count":0,"area":null},{"id":"2604.15830","title":"Placing Puzzle Pieces Where They Matter: A Question Augmentation Framework for Reinforcement Learning","created":"2026-04-17","cited_by_count":0,"area":"lr"},{"id":"2605.08315","title":"Reflective Prompted Policy Optimization: Trajectory-Grounded Revision and Salience Bias","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.28109","title":"Long Live The Balance: Information Bottleneck Driven Tree-based Policy Optimization","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.03489","title":"Learn from Your Mistakes: Tree-like Self-Play for Secure Code LLMs","created":"2026-06-02","cited_by_count":0,"area":"synth"},{"id":"2606.07610","title":"LEAF: Growing Trees Without Branching for Speech-Aware Large Language Model Post-Training","created":"2026-05-29","cited_by_count":0,"area":"lr"},{"id":"2608.01804","title":"LEAP: Lean Environment-Feedback via Adaptive Pruning for Code RL in GPU Kernel Generation","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2608.04588","title":"EASy: Towards Efficient LLM-Based Agentic System","created":"2026-08-05","cited_by_count":0,"area":"agents"},{"id":"2609.11061","title":"Fork Where the Model Changes Its Mind: Belief-Shift Branching for Tree-Structured Reinforcement Learning","created":"2026-09-10","cited_by_count":0,"area":"lr"},{"id":"2609.12757","title":"GraphAHA: Graph-Based Adaptive Search with Heterogeneous Actions for Test-Time Code Generation","created":"2026-09-11","cited_by_count":0,"area":"lr"},{"id":"2609.32235","title":"Solving Every Step Is Not Enough: Milestone Oracles Reveal a Composition Gap in LLM Math Reasoning","created":"2026-09-26","cited_by_count":0,"area":"lr"},{"id":"2609.34805","title":"SIPO: Selective-Inference Policy Optimization for Tree-Structured Agentic RL","created":"2026-09-28","cited_by_count":0,"area":"agents"},{"id":"2609.36178","title":"Targeting Pivotal Decisions for Credit Assignment in Agentic Reinforcement Learning","created":"2026-09-28","cited_by_count":0,"area":"lr"},{"id":"2609.36864","title":"Where the Model Changes Its Mind: Hindsight-Divergence Localization for Efficient Reinforcement Learning with Verifiable Rewards","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.40035","title":"OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.03372","title":"SCAD: Structured Credit Assignment and Distillation for Long-Horizon Agents","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.14405","title":"SPROUT: Scaling Agentic Reinforcement Learning for Long-Horizon Software Engineering","created":"2026-10-09","cited_by_count":0,"area":"agents"},{"id":"2610.16794","title":"TPPO: Tracking-Value PPO For Language Model Reasoning","created":"2026-10-12","cited_by_count":0,"area":"lr"},{"id":"2610.17224","title":"CodeLift: Your Test Suite Is Secretly a Dense SWE Curriculum","created":"2026-10-12","cited_by_count":0,"area":"agents"},{"id":"2610.19408","title":"ForkGRPO: Efficient Exploration and Fine-Grained Credit Assignment for Diffusion Language Models","created":"2026-10-14","cited_by_count":0,"area":"diffusion"}],"next_cursor":null}