Conference paper · 2022 · Open access
Monte Carlo Tree Descent for Black-Box Optimization
neural information processing systems, 12581–12593 · Published 1 January 2022 · DOI 10.52202/068431-0914
In brief
“Monte Carlo Tree Descent for Black-Box Optimization” is a 2022 conference paper by Yaoguang Zhai and Sicun Gao, published in neural information processing systems. OpenAlex counts 4 citations as of 19 November 2026, which puts it in the top 7% of works published in 2022 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 4
- Most cited in
- 2024 (2)
- Field-weighted impact
- 0.78
- References
- 28
- Authors
- 2
Abstract
The key to Black-Box Optimization is to efficiently search through input regions with potentially widely-varying numerical properties, to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods have recently been introduced to improve Bayesian optimization by computing better partitioning of the search space that balances exploration and exploitation. Extending this promising framework, we study how to further integrate sample-based descent for faster optimization. We design novel ways of expanding Monte Carlo search trees, with new descent methods at vertices that incorporate stochastic search and Gaussian Processes. We propose the corresponding rules for balancing progress and uncertainty, branch selection, tree expansion, and backpropagation. The designed search process puts more emphasis on sampling for faster descent and uses localized Gaussian Processes as auxiliary metrics for both exploitation and exploration. We show empirically that the proposed algorithms can outperform state-of-the-art methods on many challenging benchmark problems.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zhai, Y., & Gao, S. (2022). Monte Carlo Tree Descent for Black-Box Optimization. neural information processing systems, 12581–12593. https://doi.org/10.52202/068431-0914
MLA 9
Zhai, Yaoguang, and Sicun Gao. “Monte Carlo Tree Descent for Black-Box Optimization.” neural information processing systems, 2022, pp. 12581–12593. https://doi.org/10.52202/068431-0914.
Chicago
Zhai, Yaoguang and Sicun Gao. 2022. “Monte Carlo Tree Descent for Black-Box Optimization.” neural information processing systems: 12581–12593. https://doi.org/10.52202/068431-0914.
Harvard
Zhai, Y. and Gao, S. (2022) ‘Monte Carlo Tree Descent for Black-Box Optimization’, neural information processing systems, pp. 12581–12593. doi:10.52202/068431-0914.
IEEE
Y. Zhai and S. Gao, “Monte Carlo Tree Descent for Black-Box Optimization,” neural information processing systems, pp. 12581–12593, 2022, doi: 10.52202/068431-0914.
BibTeX
@inproceedings{zhai2022monte,
title = {{Monte Carlo Tree Descent for Black-Box Optimization}},
author = {Zhai, Yaoguang and Gao, Sicun},
booktitle = {neural information processing systems},
year = {2022},
pages = {12581--12593},
doi = {10.52202/068431-0914},
url = {https://doi.org/10.52202/068431-0914}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 2 | |
| 2025 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 0.78: it has been cited 0.78 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Monte Carlo tree search
- black-box optimization
- Bayesian optimization
- Gaussian processes
- exploration-exploitation balance
- branch selection
- backpropagation
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Zhai, Y., & Gao, S. (2022). Monte Carlo Tree Descent for Black-Box Optimization. neural information processing systems, 12581–12593. https://doi.org/10.52202/068431-0914
How many times has this paper been cited?
4 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Yaoguang Zhai, Sicun Gao.
What is the DOI of this paper?
10.52202/068431-0914, permanently at https://doi.org/10.52202/068431-0914. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.