REVIEW 4 cited by
Vanilla Bayesian Optimization Performs Great in High Dimensions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
High-dimensional problems have long been considered the Achilles' heel of Bayesian optimization algorithms. Spurred by the curse of dimensionality, a large collection of algorithms aim to make it more performant in this setting, commonly by imposing various simplifying assumptions on the objective. In this paper, we identify the degeneracies that make vanilla Bayesian optimization poorly suited to high-dimensional tasks, and further show how existing algorithms address these degeneracies through the lens of lowering the model complexity. Moreover, we propose an enhancement to the prior assumptions that are typical to vanilla Bayesian optimization algorithms, which reduces the complexity to manageable levels without imposing structural restrictions on the objective. Our modification - a simple scaling of the Gaussian process lengthscale prior with the dimensionality - reveals that standard Bayesian optimization works drastically better than previously thought in high dimensions, clearly outperforming existing state-of-the-art algorithms on multiple commonly considered real-world high-dimensional tasks.
Forward citations
Cited by 4 Pith papers
-
Return of the Latent Space COWBOYS: Re-thinking the use of VAEs for Bayesian Optimisation of Structured Spaces
A decoupled Bayesian optimization method that samples candidate molecules from a VAE prior weighted by a structure-space Gaussian process's probability of improvement outperforms latent-space BO on low-budget molecula...
-
Constraining the lives and times of exoplanets through evolutionary Bayesian retrievals
Evolutionary Bayesian retrievals using the PROTEUS model can infer initial volatile inventories and interior conditions of exoplanets from synthetic observables, with best success for terrestrial-mass planets.
-
Information-Based Exploration via Random Features for Reinforcement Learning
Random-feature Gaussian-process information gain is turned into a closed-form exploration bonus for PPO that matches RND/VIME/#Explo on 12 control, navigation, and sparse-locomotion tasks, with error bounds on the app...
-
Modernizing HEBO: a robust Bayesian optimization baseline for practical heteroskedastic and non-stationary problems
tidyHEBO modernizes HEBO in BoTorch and shows competitive-to-better, more robust sequential optimization on scientific and HPO benchmarks under default hyperparameters.
Discussion (0). Sign in to comment.