The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Bandit Based Monte-Carlo Planning
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
Kearns, M., Mansour, Y., & Ng, A. Y. (2002) · Machine Learning · doi:10.1023/a:1017932429737 · Cited by 488
Billings, D., Davidson, A., Schaeffer, J., & Szafron, D. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00130-8 · Cited by 266
On-line policy improvement using Monte-Carlo search
Tesauro, G., & Galperin, G. R. (2025) · arXiv · doi:10.48550/arxiv.2501.05407 · Cited by 209
An Adaptive Sampling Algorithm for Solving Markov Decision Processes
Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2005) · Operations Research · doi:10.1287/opre.1040.0145 · Cited by 139
Bouzy, B., & Helmstetter, B. (2004) · Advances in Computer Games · doi:10.1007/978-0-387-35706-5_11 · Cited by 129
Sheppard, B. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00166-7 · Cited by 123
Monte Carlo planning in RTS games
Chung, M. (2005) · doi:10.7939/r3-1zkx-hg14 · Cited by 111
Cited by
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
A Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970
The Arcade Learning Environment: An Evaluation Platform for General Agents
Bellemare, M. G., Naddaf, Y., Veness, J., & Bowling, M. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3912 · Cited by 2,161
“The UCT algorithm, developed by Kocsis and Szepesvári (2006), deals with the exploration-exploitation dilemma by treating each node of a search tree as a multi-armed bandit problem.”
BackgroundMethodInformation-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Srinivas, N., Krause, A., Kakade, S. M., & Seeger, M. W. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2182033 · Cited by 1,850
Planning chemical syntheses with deep neural networks and symbolic AI
Segler, M. H. S., Preuss, M., & Waller, M. P. (2018) · Nature · doi:10.1038/nature25978 · Cited by 1,847
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · Nature · doi:10.1038/s41586-020-03051-4 · Cited by 1,214
What Is a Cognitive Map? Organizing Knowledge for Flexible Behavior
Behrens, T. E. J., Muller, T. H., Whittington, J. C. R., Mark, S., Baram, A. B., Stachenfeld, K. L., & Kurth-Nelson, Z. (2018) · Neuron · doi:10.1016/j.neuron.2018.10.002 · Cited by 1,055
Algorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
Self-citationOptimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
Moravčík, M., Schmid, M., Burch, N., Lisý, V., Morrill, D., Bard, N., Davis, T., Waugh, K., Johanson, M., & Bowling, M. (2017) · Science · doi:10.1126/science.aam6960 · Cited by 786
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
Self-citationSuperhuman AI for heads-up no-limit poker: Libratus beats top professionals
Brown, N., & Sandholm, T. (2018) · Science · doi:10.1126/science.aao1733 · Cited by 540
Model-based Reinforcement Learning: A Survey
M. Moerland, T., Broekens, J., Plaat, A., & M. Jonker, C. (2023) · Foundations and Trends in Machine Learning · doi:10.1561/2200000086 · Cited by 524
Combining online and offline knowledge in UCT
Gelly, S., & Silver, D. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273531 · Cited by 465
Reinforcement learning for control: Performance, stability, and deep approximators
Buşoniu, L., de Bruin, T., Tolić, D., Kober, J., & Palunko, I. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.09.005 · Cited by 463
A Survey of Multi-Objective Sequential Decision-Making
Roijers, D. M., Vamplew, P., Whiteson, S., & Dazeley, R. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3987 · Cited by 461
Benchmark and Survey of Automated Machine Learning Frameworks
Zöller, M.-A., & Huber, M. F. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11854 · Cited by 448
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Li, L., Chu, W., Langford, J., & Wang, X. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935878 · Cited by 443
PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
CHASLOT, G. M. J.-B., WINANDS, M. H. M., HERIK, H. J. V. D., UITERWIJK, J. W. H. M., & BOUZY, B. (2008) · New Mathematics and Natural Computation · doi:10.1142/s1793005708001094 · Cited by 435
Synthetic Data for Deep Learning
Nikolenko, S. I. (2021) · Springer Optimization and Its Applications · doi:10.1007/978-3-030-75178-4 · Cited by 423
Action-Conditional Video Prediction using Deep Networks in Atari Games
Oh, J., Guo, X., Lee, H., Lewis, R. L., & Singh, S. P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.08750 · Cited by 419
Autonomous agents modelling other agents: A comprehensive survey and open problems
Albrecht, S. V., & Stone, P. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.01.002 · Cited by 417
“Barrett et al. (2011) modify the sampling-based planner UCT (Kocsis and Szepesv´ari, 2006) such that each rollout in UCT samples a type for each other agent based the current belief over types.”
MethodNo Free Lunch Theorem: A Review
Adam, S. P., Alexandropoulos, S.-A. N., Pardalos, P. M., & Vrahatis, M. N. (2019) · Springer Optimization and Its Applications · doi:10.1007/978-3-030-12767-1_5 · Cited by 401
Lee, J. H., Shin, J., & Realff, M. J. (2018) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.10.008 · Cited by 387
Reinforcement learning improves behaviour from evaluative feedback
Littman, M. L. (2015) · Nature · doi:10.1038/nature14540 · Cited by 368
Monte-Carlo tree search and rapid action value estimation in computer Go
Gelly, S., & Silver, D. (2011) · Artificial Intelligence · doi:10.1016/j.artint.2011.03.007 · Cited by 367
Monte Carlo Tree Search: a review of recent modifications and applications
Świechowski, M., Godlewski, K., Sawicki, B., & Mańdziuk, J. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10228-y · Cited by 365
Pure Exploration in Multi-armed Bandits Problems
Bubeck, S., Munos, R., & Stoltz, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04414-4_7 · Cited by 362
Deal or No Deal? End-to-End Learning of Negotiation Dialogues
Lewis, M., Yarats, D., Dauphin, Y., Parikh, D., & Batra, D. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1259 · Cited by 347
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2021) · Nature · doi:10.1038/s41586-020-03157-9 · Cited by 330
Combining human and machine intelligence in large-scale crowdsourcing
Kamar, E. S., Hacker, S., & Horvitz, E. (2012) · doi:10.5555/2343576.2343643 · Cited by 318
Monte-Carlo Tree Search: A New Framework for Game AI
Chaslot, G., Bakkes, S., Szita, I., & Spronck, P. (2008) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v4i1.18700 · Cited by 312
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
Learning to Branch in Mixed Integer Programming
Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., & Dilkina, B. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10080 · Cited by 298
Deep Reinforcement Learning: An Overview
Mousavi, S. S., Schukat, M., & Howley, E. (2018) · Lecture Notes in Networks and Systems · doi:10.1007/978-3-319-56991-8_32 · Cited by 261
An object-oriented representation for efficient reinforcement learning
Diuk, C., Cohen, A., & Littman, M. L. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390187 · Cited by 226
Go-Explore: a New Approach for Hard-Exploration Problems
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1901.10995 · Cited by 205
Theoretical basis for stabilizing messenger RNA through secondary structure design
Wayment-Steele, H. K., Kim, D. S., Choe, C. A., Nicol, J. J., Wellington-Oguri, R., Watkins, A. M., Sperberg, R. A. P., Huang, P.-S., Participants, E., & Das, R. (2020) · doi:10.1101/2020.08.22.262931 · Cited by 199
Thinking Fast and Slow with Deep Learning and Tree Search
Anthony, T., Tian, Z., & Barber, D. (2017) · arXiv · doi:10.48550/arxiv.1705.08439 · Cited by 198
Theoretical basis for stabilizing messenger RNA through secondary structure design
Wayment-Steele, H. K., Kim, D. S., Choe, C. A., Nicol, J. J., Wellington-Oguri, R., Watkins, A. M., Parra Sperberg, R. A., Huang, P.-S., Participants, E., & Das, R. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab764 · Cited by 197
The algorithmic anatomy of model-based evaluation
Daw, N. D., & Dayan, P. (2014) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2013.0478 · Cited by 195
The Arcade Learning Environment: An Evaluation Platform for General Agents
Bellemare, M. G., Naddaf, Y., Veness, J., & Bowling, M. (2012) · arXiv · doi:10.48550/arxiv.1207.4708 · Cited by 187
DESPOT: Online POMDP Planning with Regularization
Ye, N., Somani, A., Hsu, D., & Lee, W. S. (2017) · Journal of Artificial Intelligence Research · doi:10.1613/jair.5328 · Cited by 179
Reasoning with Language Model is Planning with World Model
Hao, S., Gu, Y., Ma, H., Hong, J., Wang, Z., Wang, D., & Hu, Z. (2023) · Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2023.emnlp-main.507 · Cited by 168
Steps Toward Robust Artificial Intelligence
Dietterich, T. G. (2017) · AI Magazine · doi:10.1609/aimag.v38i3.2756 · Cited by 139
Neural Architecture Search Using Deep Neural Networks and Monte Carlo Tree Search
Wang, L., Zhao, Y., Jinnai, Y., Tian, Y., & Fonseca, R. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i06.6554 · Cited by 124
System Design Perspective for Human-Level Agents Using Deep Reinforcement Learning: A Survey
Nguyen, N. D., Nguyen, T., & Nahavandi, S. (2017) · IEEE Access · doi:10.1109/access.2017.2777827 · Cited by 100
Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search
Wei, X., Liu, M., Ling, Z., & Su, H. (2022) · ACM Transactions on Graphics · doi:10.1145/3528223.3530103 · Cited by 80
Deep active inference agents using Monte-Carlo methods
Fountas, Z., Sajid, N., Mediano, P. A. M., & Friston, K. (2020) · arXiv · doi:10.48550/arxiv.2006.04176 · Cited by 64
Using Spatial Reinforcement Learning to Build Forest Wildfire Dynamics Models From Satellite Images
Ganapathi Subramanian, S., & Crowley, M. (2018) · Frontiers in ICT · doi:10.3389/fict.2018.00006 · Cited by 56
A Survey of Exploration Methods in Reinforcement Learning
Amin, S., Gomrokchi, M., Satija, H., van Hoof, H., & Precup, D. (2021) · arXiv · doi:10.48550/arxiv.2109.00157 · Cited by 41
A0C: Alpha Zero in Continuous Action Space
Moerland, T. M., Broekens, J., Plaat, A., & Jonker, C. M. (2018) · arXiv · doi:10.48550/arxiv.1805.09613 · Cited by 34
A Promising Path Towards Autoformalization and General Artificial Intelligence
Szegedy, C. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-53518-6_1 · Cited by 29
Combining Gameplay Data with Monte Carlo Tree Search to Emulate Human Play
Devlin, S., Anspoka, A., Sephton, N., Cowling, P., & Rollason, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v12i1.12858 · Cited by 28
“If it is given too much weight in the UCT equation, the agent may start to perform poorly.”
BackgroundMethodInfluentialAutomated Playtesting of Matching Tile Games
Mugrai, L., Silva, F., Holmgard, C., & Togelius, J. (2019) · 2019 IEEE Conference on Games (CoG) · doi:10.1109/cig.2019.8848057 · Cited by 28
Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters
Snell, C., Lee, J., Xu, K., & Kumar, A. (2024) · arXiv · doi:10.48550/arxiv.2408.03314 · Cited by 27
“Additionally, a number of works in the RL literature have proposed methods, such as MCTS [19], which aim to navigate the tradeoff between test-time and training-time compute so as to enable a form of iterative self-play.”
MethodAutomated game balancing of asymmetric video games
Beau, P., & Bakkes, S. (2016) · 2016 IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2016.7860432 · Cited by 22
Zombori, Z., Csiszárik, A., Michalewski, H., Kaliszyk, C., & Urban, J. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-86059-2_10 · Cited by 22
Interpretable Goal Recognition in the Presence of Occluded Factors for Autonomous Vehicles
Hanna, J. P., Rahman, A., Fosong, E., Eiras, F., Dobre, M., Redford, J., Ramamoorthy, S., & Albrecht, S. V. (2021) · 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros51168.2021.9635903 · Cited by 21
“However, due to the fixed 1 Hz control frequency of the MCTS planner, these baselines still cannot always avoid collisions.”
BackgroundMethodInfluentialTang, H., Key, D., & Ellis, K. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-2243 · Cited by 20
Beyond games: a systematic review of neural Monte Carlo tree search applications
Kemmerling, M., Lütticke, D., & Schmitt, R. H. (2024) · Applied Intelligence · doi:10.1007/s10489-023-05240-w · Cited by 19
Li, G., Xu, J., Zhao, Y., & Peng, Y. (2025) · 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52734.2025.00850 · Cited by 12
Combining MCTS and A3C for Prediction of Spatially Spreading Processes in Forest Wildfire Settings
Ganapathi Subramanian, S., & Crowley, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-89656-4_28 · Cited by 11
(2021) · arXiv (Cornell University) · Cited by 11
Interpretable Goal-based Prediction and Planning for Autonomous Driving
Albrecht, S. V., Brewitt, C., Wilhelm, J., Gyevnar, B., Eiras, F., Dobre, M., & Ramamoorthy, S. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9560849 · Cited by 12
Unsupervised Active Visual Search With Monte Carlo Planning Under Uncertain Detections
Taioli, F., Giuliari, F., Wang, Y., Berra, R., Castellini, A., Bue, A. D., Farinelli, A., Cristani, M., & Setti, F. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3451994 · Cited by 8
“At each step, an action a is selected using UCT when the current history is inside the tree, and a uniform policy when the current history is outside the tree.”
MethodProcedural Generalization by Planning with Self-Supervised World Models
Anand, A., Walker, J., Li, Y., Vértes, E., Schrittwieser, J., Ozair, S., Weber, T., & Hamrick, J. B. (2021) · arXiv · doi:10.48550/arxiv.2111.01587 · Cited by 5
Mutual Reasoning Makes Smaller LLMs Stronger Problem-Solvers
Qi, Z., Ma, M., Xu, J., Zhang, L. L., Yang, F., & Yang, M. (2024) · arXiv · doi:10.48550/arxiv.2408.06195 · Cited by 4
Agentic Trading: When LLM Agents Meet Financial Markets
Xia, Y., You, P., Wang, T., Liu, F., Qi, H., Wu, X., & Zhang, S. (2026) · arXiv · doi:10.48550/arxiv.2605.19337 · Cited by 4
SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement
Antoniades, A., Örwall, A., Zhang, K., Xie, Y., Goyal, A., & Wang, W. (2024) · arXiv · doi:10.48550/arxiv.2410.20285 · Cited by 3
“The input to the value function consists of all state-action pairs up to and including the current state being evaluated, alongside specific instructions on how to assess the state.”
Learning State-Variable Relationships in POMCP: A Framework for Mobile Robots
Zuccotto, M., Piccinelli, M., Castellini, A., Marchesini, E., & Farinelli, A. (2022) · Frontiers in Robotics and AI · doi:10.3389/frobt.2022.819107 · Cited by 2
Empowering Large Language Model Agent through Step-Level Self-Critique and Self-Training
Zhai, Y., Liu, H., Zhang, Z., Lin, T., Xu, K., Yang, C., Feng, D., Ding, B., & Wang, H. (2025) · Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3726302.3729965 · Cited by 3
Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models
Sui, Y., Chuang, Y.-N., Wang, G., Zhang, J., Zhang, T., Yuan, J., Liu, H., Wen, A., Zhong, S., Zou, N., et al. (2025) · arXiv · Cited by 517
“The OpenAI o1 model is speculated to employ a tree-based search approach, such as Monte Carlo Tree Search (MCTS) [20,41], combined with a Process Reward Model (PRM) to explore reasoning paths and determine optimal solutions through guided simulations.”
ClinicalAgents: Multi-Agent Orchestration for Clinical Decision Making with Dual-Memory
Ge, Z., Li, H., Wang, Y., Hu, N., Zhang, C. J., & Li, Q. (2026) · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · doi:10.1145/3770855.3818931 · Cited by 2
“Formally, the working memory at step 𝑡 − 1 is defined as: , where E 𝑡 − 1 is the set of accumulated evidence (such as symptoms and test results), H 𝑡 − 1 is the evolving set of diagnostic hypotheses, and 𝜏 𝑡 − 1 records the sequence of actions taken up to step 𝑡 − 1.”
Wang, W., Piękos, P., Nanbo, L., Laakom, F., Chen, Y., Ostaszewski, M., Zhuge, M., & Schmidhuber, J. (2025) · arXiv · doi:10.48550/arxiv.2510.21614 · Cited by 40
“Monte-Carlo Tree Search and its UCT variants (Coulom, 2006; Kocsis & Szepesvári, 2006) alternate selection, expansion, and simulation, while their backup and selection rules typically target cumulative reward rather than fixed-budget final-choice objectives under noisy, low-signal feedback, with…”
Optimizing Neural Network Architecture for Medical Image Segmentation Using Monte Carlo Tree Search
Meng, L., Nie, F., Zhang, Y., & Han, C. (2026) · arXiv · doi:10.48550/arxiv.2602.22361
“In the selection step, MCTS employs the Upper Confidence Bound for Trees (UCT) [26] to determine the most promising nodes, ensuring a balance between exploring new possibilities and exploiting known successful paths.”
Automated Discovery Has No Universally Superior Harness
Gupta, A., Lei, J., Lu, A., Anumanchipalli, G., & Choshen, L. (2026) · arXiv · doi:10.48550/arxiv.2607.18235
PersistBench: When Should Long-Term Memories Be Forgotten by LLMs?
Pulipaka, S., Chen, O., Sharma, M., Bajwa, T. S., Raina, V., & Sheth, I. (2026) · arXiv · doi:10.48550/arxiv.2602.01146 · Cited by 29
What Does It Take to Be a Good AI Research Agent? Studying the Role of Ideation Diversity
Audran-Reiss, A., Armengol-Estapé, J., Hambardzumyan, K., Budhiraja, A., Josifoski, M., Toledo, E., Hazra, R., Magka, D., Shvartsman, M., Pathak, P., et al. (2025) · arXiv · doi:10.48550/arxiv.2511.15593
Recursive self-improvement of AI research agents
Srikanth, D., Zhao, B., Xu, D., Wu, Y., & Jiang, Z. (2026) · arXiv · doi:10.48550/arxiv.2609.26457
How Much of a Harness Does a Strong Agent Need for Autonomous ML Engineering?
Brilliantov, K., Hernández-Cano, A., & Abbé, E. (2026) · arXiv
Metadata
- Authors
- Kocsis, L., & Szepesvári, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 282-293
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1625390266
- Cited by
- 2,855
- References
- 11
- FWCI
- 32.66
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.