{"total":61,"rows":[{"id":"2507.02833","title":"Generalizing Verifiable Instruction Following","created":"2025-07-03","cited_by_count":194,"area":null},{"id":"2505.24760","title":"REASONING GYM: Reasoning Environments for Reinforcement Learning with Verifiable Rewards","created":"2025-05-30","cited_by_count":130,"area":null},{"id":"2510.18874","title":"Retaining by Doing: The Role of On-Policy Data in Mitigating Forgetting","created":"2025-10-21","cited_by_count":94,"area":null},{"id":"2507.11948","title":"Kevin: Multi-Turn RL for Generating CUDA Kernels","created":"2025-07-16","cited_by_count":78,"area":null},{"id":"2511.23473","title":"ThetaEvolve: Test-time Learning on Open Problems","created":"2025-11-28","cited_by_count":64,"area":null},{"id":"2505.11711","title":"Reinforcement Learning Finetunes Small Subnetworks in Large Language Models","created":"2025-05-16","cited_by_count":49,"area":null},{"id":"2510.01135","title":"Prompt Curriculum Learning for Efficient LLM Post-Training","created":"2025-10-01","cited_by_count":45,"area":null},{"id":"2509.25123","title":"From $f(x)$ and $g(x)$ to $f(g(x))$: LLMs Learn New Skills in RL by Composing Old Ones","created":"2025-09-29","cited_by_count":42,"area":null},{"id":"2506.08007","title":"Reinforcement Pre-Training","created":"2025-06-09","cited_by_count":40,"area":null},{"id":"2505.20282","title":"One-shot Entropy Minimization","created":"2025-05-26","cited_by_count":32,"area":null},{"id":"2601.14525","title":"Towards Execution-Grounded Automated AI Research","created":"2026-01-20","cited_by_count":28,"area":null},{"id":"2602.13035","title":"Look Inward to Explore Outward: Learning Temperature Policy from LLM Internal States via Hierarchical RL","created":"2026-02-13","cited_by_count":27,"area":null},{"id":"2507.12549","title":"The Serial Scaling Hypothesis","created":"2025-07-16","cited_by_count":13,"area":null},{"id":"2505.19030","title":"RECAST: Expanding the Boundaries of LLMs' Complex Instruction Following with Multi-Constraint Data","created":"2025-05-25","cited_by_count":12,"area":null},{"id":"2505.11614","title":"Using Reinforcement Learning to Train Large Language Models to Explain Human Decisions","created":"2025-05-16","cited_by_count":9,"area":null},{"id":"2511.00796","title":"AReaL-Hex: Accommodating Asynchronous RL Training over Heterogeneous GPUs","created":"2025-11-02","cited_by_count":9,"area":null},{"id":"2509.09177","title":"Clip Your Sequences Fairly: Enforcing Length Fairness for Sequence-Level RL","created":"2025-09-11","cited_by_count":7,"area":null},{"id":"2510.18147","title":"LLMs Encode How Difficult Problems Are","created":"2025-10-20","cited_by_count":7,"area":null},{"id":"2506.12217","title":"From Emergence to Control: Probing and Modulating Self-Reflection in Language Models","created":"2025-06-13","cited_by_count":6,"area":null},{"id":"2508.21188","title":"Mirage or Method? How Model-Task Alignment Induces Divergent RL Conclusions","created":"2025-08-28","cited_by_count":6,"area":null},{"id":"2510.09259","title":"Detecting Data Contamination from Reinforcement Learning Post-training for Large Language Models","created":"2025-10-10","cited_by_count":6,"area":null},{"id":"2505.21537","title":"OpenReview Should be Protected and Leveraged as a Community Asset for Research in the Era of Large Language Models","created":"2025-05-24","cited_by_count":5,"area":null},{"id":"2506.03703","title":"Learning-at-Criticality in Large Language Models for Quantum Field Theory and Beyond","created":"2025-06-04","cited_by_count":5,"area":null},{"id":"2602.12351","title":"LongNav-R1: Horizon-Adaptive Multi-Turn RL for Long-Horizon VLA Navigation","created":"2026-02-12","cited_by_count":5,"area":null},{"id":"2511.05933","title":"Reinforcement Learning Improves Traversal of Parametric Knowledge in LLMs","created":"2025-11-08","cited_by_count":4,"area":null},{"id":"2512.23701","title":"Eliciting Behaviors in Multi-Turn Conversations","created":"2025-12-29","cited_by_count":4,"area":null},{"id":"2510.00496","title":"Agent-ScanKit: Unraveling Memory and Reasoning of Multimodal Agents via Sensitivity Perturbations","created":"2025-10-01","cited_by_count":3,"area":null},{"id":"2510.03341","title":"OpusAnimation: Code-Based Dynamic Chart Generation","created":"2025-10-02","cited_by_count":3,"area":null},{"id":"2510.12072","title":"EmboMatrix: A Scalable Training-Ground for Embodied Decision-Making","created":"2025-10-14","cited_by_count":3,"area":null},{"id":"2603.06958","title":"Chart-RL: Generalized Chart Comprehension via Reinforcement Learning with Verifiable Rewards","created":"2026-03-07","cited_by_count":3,"area":null},{"id":"2605.08441","title":"DUET: Optimize Token-Budget Allocation for Reinforcement Learning with Verifiable Rewards","created":"2026-05-08","cited_by_count":3,"area":null},{"id":"2506.03077","title":"StreamBP: Memory-Efficient Exact Backpropagation for Long Sequence Training of LLMs","created":"2025-06-03","cited_by_count":2,"area":null},{"id":"2510.13551","title":"Tandem Training for Language Models","created":"2025-10-15","cited_by_count":2,"area":null},{"id":"2605.28631","title":"Single-Rollout Hidden-State Dynamics for Training-Free RLVR Data Selection","created":"2026-05-27","cited_by_count":2,"area":null},{"id":"2606.07812","title":"Scaling Participation in Modular AI Systems","created":"2026-06-05","cited_by_count":2,"area":null},{"id":"2607.07435","title":"RLVP: Penalize the Path, Reward the Outcome","created":"2026-07-08","cited_by_count":2,"area":null},{"id":"2607.26253","title":"Early Verdicts, Better Budgets: Sequential Adaptive Rollout Allocation for Compute-Efficient RLVR","created":"2026-07-28","cited_by_count":2,"area":null},{"id":"2608.27147","title":"Thomson: Continual Learning of Frontier Models for SovereignAI","created":"2026-08-27","cited_by_count":2,"area":null},{"id":"2508.10839","title":"Reinforced Language Models for Sequential Decision Making","created":"2025-08-14","cited_by_count":1,"area":null},{"id":"2512.02882","title":"OptPO: Optimal Rollout Allocation for Test-time Policy Optimization","created":"2025-12-02","cited_by_count":1,"area":null},{"id":"2602.00482","title":"AREAL-DTA: Dynamic Tree Attention for Efficient Reinforcement Learning of Large Language Models","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2602.11217","title":"The Magic Correlations: Understanding Knowledge Transfer from Pretraining to Supervised Fine-Tuning","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2604.08209","title":"OmniJigsaw: Enhancing Omni-Modal Reasoning via Modality-Orchestrated Reordering","created":"2026-04-09","cited_by_count":1,"area":null},{"id":"2604.28020","title":"Cost-Aware Learning","created":"2026-04-30","cited_by_count":1,"area":null},{"id":"2605.07244","title":"Experience Sharing in Mutual Reinforcement Learning for Heterogeneous Language Models","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2609.07183","title":"CircuitLens: Reasoning Circuits as Data Selection Signals for Reinforcement Learning with Verifiable Rewards","created":"2026-09-07","cited_by_count":1,"area":null},{"id":"2609.40115","title":"Unlearnable, or Unmeasured? On the Reliability of Difficulty Labels in RLVR","created":"2026-09-30","cited_by_count":1,"area":null},{"id":"2512.21580","title":"Gamayun's Path to Multilingual Mastery: Cost-Efficient Training of a 1.5B-Parameter LLM","created":"2025-12-25","cited_by_count":0,"area":null},{"id":"2601.22532","title":"Demystifying Design Choices of Reinforcement Fine-tuning: A Batched Contextual Bandit Learning Perspective","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2602.02708","title":"BinaryPPO: Efficient Policy Optimization for Binary Classification","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2603.12875","title":"Test-time RL alignment exposes task familiarity artifacts in LLM benchmarks","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2604.18354","title":"PRISMA: Preference-Reinforced Self-Training Approach for Interpretable Emotionally Intelligent Negotiation Dialogues","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2604.18381","title":"Learning from Less: Measuring the Effectiveness of RLVR in Low Data and Compute Regimes","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2604.19825","title":"SolidCoder: Bridging the Mental-Reality Gap in LLM Code Generation through Concrete Execution","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2606.01436","title":"Learning from Saturated Data: Signals Beyond Correctness for LLM Training","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2607.17479","title":"TraversRL: Traversable Pedestrian Pathway Generation With Reinforcement Learning","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2609.01422","title":"From Rollouts to Recipes: Self-Contained Post-Training for LLMs","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.28765","title":"Reinforcement Learning with Verifiable Rewards for Small Search Agents","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2609.36587","title":"Learned Reporting Preferences in RLVR Can Conflict with the Current Request","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.04978","title":"What Will Post-Training Fix? Per-Problem Gains Are Shared Across Independent RL Runs, and Existing Checkpoints Predict Them Better Than A Priori Signals","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.17093","title":"SFT Leaves a Reproducible Signature in Activation Geometry: Calibrating Post-Training Interpretability Against Run-to-Run Noise","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}