MonteCarloTreeSearchbasedVariableSelection forHighDimensionalBayesianOptimization

Feb-11-2026, 12:58:07 GMT–Neural Information Processing Systems

Our regret bound generalizes that of GP-UCB [38] which always selects all variables, aswellasthatofDropout [21]whichselectsdvariables randomly ineachiteration.

artificial intelligence, machine learning, optimization, (16 more...)

Neural Information Processing Systems

Feb-11-2026, 12:58:07 GMT

Conferences PDF

Add feedback

Country:
- Africa > Ethiopia (0.04)
- Asia
  - China (0.04)
  - Japan > Honshū
    - Kantō > Kanagawa Prefecture > Yokohama (0.04)
  - South Korea > Seoul
    - Seoul (0.04)
- Europe
  - France > Hauts-de-France
    - Nord > Lille (0.05)
  - Spain (0.04)
  - Sweden > Stockholm
    - Stockholm (0.04)
- North America
  - Canada
    - British Columbia > Metro Vancouver Regional District
      - Vancouver (0.05)
    - Quebec > Montreal (0.04)
  - United States > Massachusetts
    - Middlesex County > Cambridge (0.04)
- Oceania > Australia
  - Victoria > Melbourne (0.04)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning (1.00)
  - Representation & Reasoning > Search (0.47)

Duplicate Docs Excel Report

Title
Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization Lei Song

Similar Docs Excel Report more

Title	Similarity	Source
None found