{"total":161,"rows":[{"id":"2312.08935","title":"Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations","created":"2023-12-14","cited_by_count":928,"area":"lr"},{"id":"2310.04406","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","created":"2023-10-06","cited_by_count":574,"area":"lr"},{"id":"2406.06592","title":"Improve Mathematical Reasoning in Language Models by Automated Process Supervision","created":"2024-06-05","cited_by_count":441,"area":"lr"},{"id":"2502.17419","title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","created":"2025-02-24","cited_by_count":320,"area":"lr"},{"id":"2503.07608","title":"AlphaDrive: Unleashing the Power of VLMs in Autonomous Driving via Reinforcement Learning and Reasoning","created":"2025-03-10","cited_by_count":108,"area":"lr"},{"id":"2503.07065","title":"Boosting the Generalization and Reasoning of Vision Language Models with Curriculum Reinforcement Learning","created":"2025-03-10","cited_by_count":71,"area":"lr"},{"id":"2410.02052","title":"ExACT: Teaching AI Agents to Explore with Reflective-MCTS and Exploratory Learning","created":"2024-10-02","cited_by_count":62,"area":"lr"},{"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":"2411.18478","title":"Beyond Examples: High-level Automated Reasoning Paradigm in In-Context Learning via MCTS","created":"2024-11-27","cited_by_count":54,"area":"lr"},{"id":"2502.07350","title":"KABB: Knowledge-Aware Bayesian Bandits for Dynamic Expert Coordination in Multi-Agent Systems","created":"2025-02-11","cited_by_count":37,"area":"agents"},{"id":"2410.07927","title":"Efficient Reinforcement Learning with Large Language Model Priors","created":"2024-10-10","cited_by_count":30,"area":null},{"id":"2502.11520","title":"AURORA:Automated Training Framework of Universal Process Reward Models via Ensemble Prompting and Reverse Verification","created":"2025-02-17","cited_by_count":23,"area":"lr"},{"id":"2410.01920","title":"Step-by-Step Reasoning for Math Problems via Twisted Sequential Monte Carlo","created":"2024-10-02","cited_by_count":22,"area":"lr"},{"id":"2410.15644","title":"Procedural Content Generation in Games: A Survey with Insights on Emerging LLM Integration","created":"2024-10-21","cited_by_count":22,"area":null},{"id":"2501.18922","title":"KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search","created":"2025-01-31","cited_by_count":22,"area":"agents"},{"id":"2504.16855","title":"Monte Carlo Planning with Large Language Model for Text-Based Game Agents","created":"2025-04-23","cited_by_count":22,"area":"agents"},{"id":"2412.15118","title":"Reasoning Through Execution: Unifying Process and Outcome Rewards for Code Generation","created":"2024-12-19","cited_by_count":21,"area":"lr"},{"id":"2502.20508","title":"TripCraft: A Benchmark for Spatio-Temporally Fine Grained Travel Planning","created":"2025-02-27","cited_by_count":21,"area":null},{"id":"2506.15196","title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","created":"2025-06-18","cited_by_count":21,"area":null},{"id":"2507.04370","title":"WebSynthesis: World-Model-Guided MCTS for Efficient WebUI-Trajectory Synthesis","created":"2025-07-06","cited_by_count":21,"area":"wm"},{"id":"2309.03224","title":"No Train Still Gain. Unleash Mathematical Reasoning of Large Language Models with Monte Carlo Tree Search Guided by Energy Function","created":"2023-09-01","cited_by_count":20,"area":"lr"},{"id":"2310.08348","title":"LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios","created":"2023-10-12","cited_by_count":20,"area":null},{"id":"2510.10035","title":"Failure-Driven Workflow Refinement","created":"2025-10-11","cited_by_count":20,"area":null},{"id":"2502.11741","title":"SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL","created":"2025-02-17","cited_by_count":19,"area":"synth"},{"id":"2303.08060","title":"Beyond Games: A Systematic Review of Neural Monte Carlo Tree Search Applications","created":"2023-03-14","cited_by_count":16,"area":null},{"id":"2410.12934","title":"Enhancing Mathematical Reasoning in LLMs by Stepwise Correction","created":"2024-10-16","cited_by_count":16,"area":"lr"},{"id":"2510.22391","title":"Top-Down Semantic Refinement for Image Captioning","created":"2025-10-25","cited_by_count":16,"area":"mllm"},{"id":"2508.03012","title":"Tool-integrated Reinforcement Learning for Repo Deep Search","created":"2025-08-05","cited_by_count":15,"area":"lr"},{"id":"2304.13269","title":"Games for Artificial Intelligence Research: A Review and Perspectives","created":"2023-04-26","cited_by_count":14,"area":null},{"id":"2409.05144","title":"QuantFactor REINFORCE: Mining Steady Formulaic Alpha Factors with Variance-bounded REINFORCE","created":"2024-09-08","cited_by_count":14,"area":"deeprl"},{"id":"2508.12211","title":"Improving Pre-Trained Vision-Language-Action Policies with Model-Based Search","created":"2025-08-17","cited_by_count":13,"area":"vla"},{"id":"2509.22643","title":"VLA-Reasoner: Empowering Vision-Language-Action Models with Reasoning via Online Monte Carlo Tree Search","created":"2025-09-26","cited_by_count":13,"area":"vla"},{"id":"2307.03290","title":"OmniBoost: Boosting Throughput of Heterogeneous Embedded Devices under Multi-DNN Workload","created":"2023-07-06","cited_by_count":12,"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":"2501.11877","title":"From Drafts to Answers: Unlocking LLM Potential via Aggregation Fine-Tuning","created":"2025-01-21","cited_by_count":12,"area":"lr"},{"id":"2511.13211","title":"3DAlign-DAER: Dynamic Attention Policy and Efficient Retrieval Strategy for Fine-grained 3D-Text Alignment at Scale","created":"2025-11-17","cited_by_count":12,"area":null},{"id":"2505.18229","title":"BEDI: A Comprehensive Benchmark for Evaluating Embodied Agents on UAVs","created":"2025-05-23","cited_by_count":10,"area":"agents"},{"id":"2509.16330","title":"Generalizability of Large Language Model-Based Agents: A Comprehensive Survey","created":"2025-09-19","cited_by_count":10,"area":"agents"},{"id":"2512.16424","title":"Synthelite: Chemist-aligned and feasibility-aware synthesis planning with LLMs","created":"2025-12-18","cited_by_count":10,"area":null},{"id":"2405.06758","title":"Scalable and Effective Arithmetic Tree Generation for Adder and Multiplier Designs","created":"2024-05-10","cited_by_count":9,"area":null},{"id":"2406.02717","title":"Reinforcement learning-based architecture search for quantum machine learning","created":"2024-06-04","cited_by_count":9,"area":"deeprl"},{"id":"2407.12021","title":"Adaptive Draft-Verification for Efficient Large Language Model Decoding","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2311.03583","title":"Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search","created":"2023-11-06","cited_by_count":8,"area":null},{"id":"2407.08642","title":"Towards Building Specialized Generalist AI with System 1 and System 2 Fusion","created":"2024-07-11","cited_by_count":8,"area":null},{"id":"2510.21329","title":"TripTide: A Benchmark for Adaptive Travel Planning under Disruptions","created":"2025-10-24","cited_by_count":8,"area":null},{"id":"2210.13455","title":"Epistemic Monte Carlo Tree Search","created":"2022-10-21","cited_by_count":7,"area":null},{"id":"2312.16767","title":"Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search","created":"2023-12-28","cited_by_count":7,"area":null},{"id":"2410.04683","title":"Towards Measuring Goal-Directedness in AI Systems","created":"2024-10-07","cited_by_count":7,"area":null},{"id":"2411.15645","title":"MC-NEST: Enhancing Mathematical Reasoning in Large Language Models leveraging a Monte Carlo Self-Refine Tree","created":"2024-11-23","cited_by_count":7,"area":"lr"},{"id":"2305.16209","title":"C-MCTS: Safe Planning with Monte Carlo Tree Search","created":"2023-05-25","cited_by_count":6,"area":null},{"id":"2601.20539","title":"PathWise: Planning through World Model for Automated Heuristic Design via Self-Evolving LLMs","created":"2026-01-28","cited_by_count":6,"area":"wm"},{"id":"2109.13419","title":"The Role of Lookahead and Approximate Policy Evaluation in Reinforcement Learning with Linear Value Function Approximation","created":"2021-09-28","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":"2303.04651","title":"MCTS-GEB: Monte Carlo Tree Search is a Good E-graph Builder","created":"2023-03-08","cited_by_count":5,"area":null},{"id":"2311.00971","title":"An Integrated Framework Integrating Monte Carlo Tree Search and Supervised Learning for Train Timetabling Problem","created":"2023-11-02","cited_by_count":5,"area":null},{"id":"2401.15315","title":"Learning Online Belief Prediction for Efficient POMDP Planning in Autonomous Driving","created":"2024-01-27","cited_by_count":5,"area":"driving"},{"id":"2411.03349","title":"RuAG: Learned-rule-augmented Generation for Large Language Models","created":"2024-11-04","cited_by_count":5,"area":"lr"},{"id":"2502.03962","title":"Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search","created":"2025-02-06","cited_by_count":5,"area":null},{"id":"2503.04959","title":"DB-Explore: Automated Database Exploration and Instruction Synthesis for Text-to-SQL","created":"2025-03-06","cited_by_count":5,"area":"synth"},{"id":"2503.21383","title":"Controlling Large Language Model with Latent Actions","created":"2025-03-27","cited_by_count":5,"area":null},{"id":"2505.20869","title":"Step-Wise Formal Verification for LLM-Based Mathematical Problem Solving","created":"2025-05-27","cited_by_count":5,"area":"lr"},{"id":"2401.08089","title":"A Study on Training and Developing Large Language Models for Behavior Tree Generation","created":"2024-01-16","cited_by_count":4,"area":null},{"id":"2411.17867","title":"RankMap: Priority-Aware Multi-DNN Manager for Heterogeneous Embedded Devices","created":"2024-11-26","cited_by_count":4,"area":null},{"id":"2504.14669","title":"Trans-Zero: Self-Play Incentivizes Large Language Models for Multilingual Translation Without Parallel Data","created":"2025-04-20","cited_by_count":4,"area":"synth"},{"id":"2508.21800","title":"Tree-Guided Diffusion Planner","created":"2025-08-29","cited_by_count":4,"area":"diffusion"},{"id":"2303.09449","title":"Proof Number Based Monte-Carlo Tree Search","created":"2023-03-16","cited_by_count":3,"area":null},{"id":"2401.05199","title":"Monte Carlo Tree Search for Recipe Generation using GPT-2","created":"2024-01-10","cited_by_count":3,"area":null},{"id":"2505.09029","title":"Monte Carlo Beam Search for Actor-Critic Reinforcement Learning in Continuous Control","created":"2025-05-13","cited_by_count":3,"area":"deeprl"},{"id":"2511.14220","title":"Twice Sequential Monte Carlo for Tree Search","created":"2025-11-18","cited_by_count":3,"area":"deeprl"},{"id":"2605.20061","title":"Rewarding Beliefs, Not Actions: Consistency-Guided Credit Assignment for Long-Horizon Agents","created":"2026-05-19","cited_by_count":3,"area":"agents"},{"id":"2109.00619","title":"Learning compositional programs with arguments and sampling","created":"2021-09-01","cited_by_count":2,"area":null},{"id":"2112.07761","title":"Split Moves for Monte-Carlo Tree Search","created":"2021-12-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":"2210.11152","title":"Machine Learning for K-adaptability in Two-stage Robust Optimization","created":"2022-10-20","cited_by_count":2,"area":null},{"id":"2308.04719","title":"JiangJun: Mastering Xiangqi by Tackling Non-Transitivity in Two-Player Zero-Sum Games","created":"2023-08-09","cited_by_count":2,"area":null},{"id":"2401.13770","title":"AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems","created":"2024-01-24","cited_by_count":2,"area":null},{"id":"2404.16364","title":"ReZero: Boosting MCTS-based Algorithms by Backward-view and Entire-buffer Reanalyze","created":"2024-04-25","cited_by_count":2,"area":null},{"id":"2406.09242","title":"Towards a Characterisation of Monte-Carlo Tree Search Performance in Different Games","created":"2024-06-13","cited_by_count":2,"area":null},{"id":"2409.13783","title":"A Value Based Parallel Update MCTS Method for Multi-Agent Cooperative Decision Making of Connected and Automated Vehicles","created":"2024-09-20","cited_by_count":2,"area":null},{"id":"2503.04148","title":"Ecomap: Sustainability-Driven Optimization of Multi-Tenant DNN Execution on Edge Servers","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2505.20700","title":"Beyond Templates: Dynamic Adaptation of Reasoning Demonstrations via Feasibility-Aware Exploration","created":"2025-05-27","cited_by_count":2,"area":"lr"},{"id":"2507.10281","title":"Toward Real-World Table Agents: Capabilities, Workflows, and Design Principles for LLM-based Table Intelligence","created":"2025-07-14","cited_by_count":2,"area":"agents"},{"id":"2510.17491","title":"Empowering Real-World: A Survey on the Technology, Practice, and Evaluation of LLM-driven Industry Agents","created":"2025-10-20","cited_by_count":2,"area":"lr"},{"id":"2601.01392","title":"SAFE-QAQ: End-to-End Slow-Thinking Audio-Text Fraud Detection via Reinforcement Learning","created":"2026-01-04","cited_by_count":2,"area":null},{"id":"2601.02196","title":"ACDZero: MCTS Agent for Mastering Automated Cyber Defense","created":"2026-01-05","cited_by_count":2,"area":null},{"id":"2602.14083","title":"Plan-MCTS: Plan Exploration for Action Exploitation in Web Navigation","created":"2026-02-15","cited_by_count":2,"area":null},{"id":"2609.18599","title":"Online Robust Reinforcement Learning Through Monte-Carlo Planning","created":"2026-09-16","cited_by_count":2,"area":"deeprl"},{"id":"2109.06966","title":"Searching for More Efficient Dynamic Programs","created":"2021-09-14","cited_by_count":1,"area":null},{"id":"2110.05478","title":"An In-depth Summary of Recent Artificial Intelligence Applications in Drug Design","created":"2021-10-10","cited_by_count":1,"area":null},{"id":"2203.09608","title":"Developing a Successful Bomberman Agent","created":"2022-03-17","cited_by_count":1,"area":null},{"id":"2204.12043","title":"An Efficient Dynamic Sampling Policy For Monte Carlo Tree Search","created":"2022-04-26","cited_by_count":1,"area":null},{"id":"2307.08024","title":"Bayesian inference for data-efficient, explainable, and safe robotic motion planning: A review","created":"2023-07-16","cited_by_count":1,"area":null},{"id":"2308.04292","title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding","created":"2023-08-08","cited_by_count":1,"area":null},{"id":"2308.14350","title":"Simple Modification of the Upper Confidence Bound Algorithm by Generalized Weighted Averages","created":"2023-08-28","cited_by_count":1,"area":null},{"id":"2401.17044","title":"Scalable Mechanism Design for Multi-Agent Path Finding","created":"2024-01-30","cited_by_count":1,"area":null},{"id":"2402.08511","title":"Amplifying Exploration in Monte-Carlo Tree Search by Focusing on the Unknown","created":"2024-02-13","cited_by_count":1,"area":null},{"id":"2406.09322","title":"Active Inference Meeting Energy-Efficient Control of Parallel and Identical Machines","created":"2024-06-13","cited_by_count":1,"area":null},{"id":"2408.05488","title":"Structure and Reduction of MCTS for Explainable-AI","created":"2024-08-10","cited_by_count":1,"area":null},{"id":"2409.18335","title":"A Fairness-Driven Method for Learning Human-Compatible Negotiation Strategies","created":"2024-09-26","cited_by_count":1,"area":null},{"id":"2411.07171","title":"Anytime Sequential Halving in Monte-Carlo Tree Search","created":"2024-11-11","cited_by_count":1,"area":null}],"next_cursor":"100"}