Luigi Nardi, Leonard Papenmeier, Matthias Poloczek
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.
Recent advances have extended the scope of Bayesian optimization (BO) to expensive-to-evaluate black-box functions with dozens of dimensions, aspiring to unlock impactful applications, for example, in the life sciences, neural architecture search, and robotics. However, a closer examination reveals that the state-of-the-art methods for high-dimensional Bayesian optimization (HDBO) suffer from degrading performance as the number of dimensions increases or even risk failure if certain unverifiable assumptions are not met. This paper proposes BAXUS that leverages a novel family of nested random subspaces to adapt the space it optimizes over to the problem. This ensures high performance while removing the risk of failure, which we assert via theoretical guarantees. A comprehensive evaluation demonstrates that BAXUS achieves better results than the state-of-the-art methods for a broad set of applications. * The work was done before Matthias joined Amazon. 36th Conference on Neural Information Processing Systems (NeurIPS 2022).
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2304.11468")
get_code_for_paper("2304.11468")
have("2304.11468")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2304.11468.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2304.11468)
Connect an agent — have() is free.