Preprint · 2020 · Open access

Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search

Linnan Wang, Rodrigo Fonseca, Yuandong Tian

arXiv (Cornell University) · Published 1 July 2020 · DOI 10.48550/arxiv.2007.00708

Open PDFView at the publisherCite this paper

In brief

“Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search” is a 2020 preprint by Linnan Wang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 108 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
108
Most cited in
2024 (28)
References
58
Authors
3

Abstract

High dimensional black-box optimization has broad applications but remains a challenging problem to solve. Given a set of samples $\{\vx_i, y_i\}$, building a global model (like Bayesian Optimization (BO)) suffers from the curse of dimensionality in the high-dimensional search space, while a greedy search may lead to sub-optimality. By recursively splitting the search space into regions with high/low function values, recent works like LaNAS shows good performance in Neural Architecture Search (NAS), reducing the sample complexity empirically. In this paper, we coin LA-MCTS that extends LaNAS to other domains. Unlike previous approaches, LA-MCTS learns the partition of the search space using a few samples and their function values in an online fashion. While LaNAS uses linear partition and performs uniform sampling in each region, our LA-MCTS adopts a nonlinear decision boundary and learns a local model to pick good candidates. If the nonlinear partition function and the local model fits well with ground-truth black-box function, then good partitions and candidates can be reached with much fewer samples. LA-MCTS serves as a \emph{meta-algorithm} by using existing black-box optimizers (e.g., BO, TuRBO) as its local models, achieving strong performance in general black-box optimization and reinforcement learning benchmarks, in particular for high-dimensional problems.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Wang, L., Fonseca, R., & Tian, Y. (2020). Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.00708

MLA 9

Wang, Linnan, et al. “Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search.” arXiv (Cornell University), 2020. https://doi.org/10.48550/arxiv.2007.00708.

Chicago

Wang, Linnan, Rodrigo Fonseca, and Yuandong Tian. 2020. “Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.00708.

Harvard

Wang, L., Fonseca, R. and Tian, Y. (2020) ‘Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search’, arXiv (Cornell University). doi:10.48550/arxiv.2007.00708.

IEEE

L. Wang, R. Fonseca, and Y. Tian, “Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search,” arXiv (Cornell University), 2020, doi: 10.48550/arxiv.2007.00708.

BibTeX

@misc{wang2020learning,
  title     = {{Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search}},
  author    = {Wang, Linnan and Fonseca, Rodrigo and Tian, Yuandong},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  doi       = {10.48550/arxiv.2007.00708},
  url       = {https://doi.org/10.48550/arxiv.2007.00708}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202044
20211414
20222020
20231111
20242828
20251919
20261212

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • black-box optimization
  • Monte Carlo tree search
  • LANA
  • meta-algorithms
  • nonlinear decision boundaries
  • local models
  • high-dimensional optimization
  • sample complexity

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Wang, L., Fonseca, R., & Tian, Y. (2020). Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Search. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2007.00708

How many times has this paper been cited?

108 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?

Linnan Wang, Rodrigo Fonseca, Yuandong Tian.

What is the DOI of this paper?

10.48550/arxiv.2007.00708, permanently at https://doi.org/10.48550/arxiv.2007.00708. 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.