Lei Song, Ke Xue, Xiaobin Huang, Chao Qian
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Bayesian optimization (BO) is a class of popular methods for expensive black-box optimization, and has been widely applied to many scenarios. However, BO suffers from the curse of dimensionality, and scaling it to high-dimensional problems is still a challenge. In this paper, we propose a variable selection method MCTS-VS based on Monte Carlo tree search (MCTS), to iteratively select and optimize a subset of variables. That is, MCTS-VS constructs a low-dimensional subspace via MCTS and optimizes in the subspace with any BO algorithm. We give a theoretical analysis of the general variable selection method to reveal how it can work. Experiments on high-dimensional synthetic functions and real-world problems (i.e., NAS-bench problems and MuJoCo locomotion tasks) show that MCTS-VS equipped with a proper BO optimizer can achieve state-of-the-art performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.01628")
get_code_for_paper("2210.01628")
have("2210.01628")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.01628.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.01628)
Connect an agent — have() is free.