Recursive binary partitioning enables Bayesian optimization with linear time complexity and superior performance on test functions up to 124 dimensions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bayesian Optimization in Linear Time
Recursive binary partitioning enables Bayesian optimization with linear time complexity and superior performance on test functions up to 124 dimensions.