{"total":61,"rows":[{"id":"2405.00451","title":"Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning","created":"2024-05-01","cited_by_count":241,"area":"lr"},{"id":"2205.11491","title":"HyperTree Proof Search for Neural Theorem Proving","created":"2022-05-23","cited_by_count":197,"area":null},{"id":"2104.06303","title":"Learning and Planning in Complex Action Spaces","created":"2021-04-13","cited_by_count":77,"area":null},{"id":"2104.03113","title":"Scaling Scaling Laws with Board Games","created":"2021-04-07","cited_by_count":63,"area":null},{"id":"2309.15028","title":"Don't throw away your value model! Generating more preferable text with Value-Guided Monte-Carlo Tree Search decoding","created":"2023-09-26","cited_by_count":60,"area":"lr"},{"id":"2112.07544","title":"Modeling Strong and Human-Like Gameplay with KL-Regularized Search","created":"2021-12-14","cited_by_count":50,"area":"offlinerl"},{"id":"2503.02039","title":"Dynamic Search for Inference-Time Alignment in Diffusion Models","created":"2025-03-03","cited_by_count":37,"area":"diffusion"},{"id":"2111.01587","title":"Procedural Generalization by Planning with Self-Supervised World Models","created":"2021-11-02","cited_by_count":31,"area":"wm"},{"id":"2510.20817","title":"KL-Regularized Reinforcement Learning is Designed to Mode Collapse","created":"2025-10-23","cited_by_count":31,"area":"deeprl"},{"id":"2506.09477","title":"On a few pitfalls in KL divergence gradient estimation for RL","created":"2025-06-11","cited_by_count":29,"area":null},{"id":"2109.15316","title":"Scalable Online Planning via Reinforcement Learning Fine-Tuning","created":"2021-09-30","cited_by_count":18,"area":null},{"id":"2406.10667","title":"UniZero: Generalized and Efficient Planning with Scalable Latent World Models","created":"2024-06-15","cited_by_count":12,"area":"wm"},{"id":"2410.03893","title":"Human-aligned Chess with a Bit of Search","created":"2024-10-04","cited_by_count":11,"area":null},{"id":"2402.08078","title":"Large Language Models as Agents in Two-Player Games","created":"2024-02-12","cited_by_count":10,"area":"agents"},{"id":"2405.05066","title":"Designing Skill-Compatible AI: Methodologies and Frameworks in Chess","created":"2024-05-08","cited_by_count":10,"area":null},{"id":"2504.07091","title":"AssistanceZero: Scalably Solving Assistance Games","created":"2025-04-09","cited_by_count":10,"area":"alignment"},{"id":"2407.12021","title":"Adaptive Draft-Verification for Efficient Large Language Model Decoding","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2102.04881","title":"Measuring Progress in Deep Reinforcement Learning Sample Efficiency","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2111.02994","title":"Towards an Understanding of Default Policies in Multitask Policy Optimization","created":"2021-11-04","cited_by_count":8,"area":null},{"id":"2210.05980","title":"Efficient Offline Policy Optimization with a Learned Model","created":"2022-10-12","cited_by_count":8,"area":"offlinerl"},{"id":"2306.00840","title":"What model does MuZero learn?","created":"2023-06-01","cited_by_count":7,"area":null},{"id":"2406.01423","title":"Value Improved Actor Critic Algorithms","created":"2024-06-03","cited_by_count":7,"area":"deeprl"},{"id":"2501.09766","title":"iTool: Reinforced Fine-Tuning with Dynamic Deficiency Calibration for Advanced Tool Use","created":"2025-01-15","cited_by_count":7,"area":null},{"id":"2111.01009","title":"Fragment-based Sequential Translation for Molecular Optimization","created":"2021-10-26","cited_by_count":6,"area":null},{"id":"2202.07071","title":"A Unified Perspective on Value Backup and Exploration in Monte-Carlo Tree Search","created":"2022-02-11","cited_by_count":6,"area":null},{"id":"2403.14156","title":"Policy Mirror Descent with Lookahead","created":"2024-03-21","cited_by_count":6,"area":"deeprl"},{"id":"2406.00614","title":"Efficient Monte Carlo Tree Search via On-the-Fly State-Conditioned Action Abstraction","created":"2024-06-02","cited_by_count":6,"area":null},{"id":"2504.06048","title":"Trust-Region Twisted Policy Improvement","created":"2025-04-08","cited_by_count":6,"area":"deeprl"},{"id":"2101.04788","title":"Scalable Anytime Planning for Multi-Agent MDPs","created":"2021-01-12","cited_by_count":5,"area":null},{"id":"2211.15068","title":"Learning to design without prior data: Discovering generalizable design strategies using deep learning and tree search","created":"2022-11-28","cited_by_count":5,"area":null},{"id":"2402.07963","title":"SPO: Sequential Monte Carlo Policy Optimisation","created":"2024-02-12","cited_by_count":5,"area":null},{"id":"2602.04417","title":"EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL","created":"2026-02-04","cited_by_count":5,"area":"lr"},{"id":"2102.12194","title":"Combining Off and On-Policy Training in Model-Based Reinforcement Learning","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2210.01426","title":"Continuous Monte Carlo Graph Search","created":"2022-10-04","cited_by_count":4,"area":null},{"id":"2210.12628","title":"Spending Thinking Time Wisely: Accelerating MCTS with Virtual Expansions","created":"2022-10-23","cited_by_count":4,"area":null},{"id":"2102.06808","title":"Planning and Learning Using Adaptive Entropy Tree Search","created":"2021-02-12","cited_by_count":3,"area":null},{"id":"2306.04403","title":"Policy-Based Self-Competition for Planning Problems","created":"2023-06-07","cited_by_count":3,"area":null},{"id":"2312.04030","title":"Modeling Boundedly Rational Agents with Latent Inference Budgets","created":"2023-12-07","cited_by_count":3,"area":null},{"id":"2507.18858","title":"Weak-to-Strong Generalization with Failure Trajectories: A Tree-based Approach to Elicit Optimal Policy in Strong Models","created":"2025-07-25","cited_by_count":3,"area":null},{"id":"2511.14220","title":"Twice Sequential Monte Carlo for Tree Search","created":"2025-11-18","cited_by_count":3,"area":"deeprl"},{"id":"2101.04167","title":"First-Order Problem Solving through Neural MCTS based Reinforcement Learning","created":"2021-01-11","cited_by_count":2,"area":null},{"id":"2109.00619","title":"Learning compositional programs with arguments and sampling","created":"2021-09-01","cited_by_count":2,"area":null},{"id":"2110.07232","title":"Procrastinated Tree Search: Black-box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback","created":"2021-10-14","cited_by_count":2,"area":null},{"id":"2206.01011","title":"Policy Gradient Algorithms with Monte Carlo Tree Learning for Non-Markov Decision Processes","created":"2022-06-02","cited_by_count":2,"area":null},{"id":"2207.05991","title":"Brick Tic-Tac-Toe: Exploring the Generalizability of AlphaZero to Novel Test Environments","created":"2022-07-13","cited_by_count":2,"area":null},{"id":"2312.05257","title":"Autonomous Port Navigation With Ranging Sensors Using Model-Based Reinforcement Learning","created":"2023-11-17","cited_by_count":2,"area":null},{"id":"2407.05511","title":"Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization","created":"2024-07-07","cited_by_count":1,"area":null},{"id":"2602.10894","title":"Revisiting Regularized Policy Optimization for Stable and Efficient Reinforcement Learning in Two-Player Games","created":"2026-02-11","cited_by_count":1,"area":"deeprl"},{"id":"2102.07495","title":"ScrofaZero: Mastering Trick-taking Poker Game Gongzhu by Deep Reinforcement Learning","created":"2021-02-15","cited_by_count":0,"area":null},{"id":"2103.11517","title":"Dual Monte Carlo Tree Search","created":"2021-03-21","cited_by_count":0,"area":null},{"id":"2306.10587","title":"Acceleration in Policy Optimization","created":"2023-06-18","cited_by_count":0,"area":null},{"id":"2406.16151","title":"Improved Monte Carlo Planning via Causal Disentanglement for Structurally-Decomposed Markov Decision Processes","created":"2024-06-23","cited_by_count":0,"area":null},{"id":"2504.14636","title":"When Search Teaches Style: Causal Internalization of Tactical Priors in AlphaZero","created":"2025-04-20","cited_by_count":0,"area":null},{"id":"2510.19348","title":"A Markov Decision Process for Variable Selection in Branch & Bound","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2601.01301","title":"Accelerating Monte-Carlo Tree Search with Optimized Posterior Policies","created":"2026-01-03","cited_by_count":0,"area":null},{"id":"2605.08982","title":"Particle Monte Carlo Tree Search","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2609.09094","title":"The Surprising Effectiveness of Approximate Value Iteration in Self-Play","created":"2026-09-08","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.01566","title":"Towards Optimal Policy Improvement","created":"2026-10-01","cited_by_count":0,"area":"deeprl"},{"id":"2610.15046","title":"Belief Embedding Tree Search","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.17252","title":"Value-Preserving Action Quantization","created":"2026-10-12","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}