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 popular approach to optimize expensive-to-evaluate black-box functions. A significant challenge in BO is to scale to high-dimensional parameter spaces while retaining sample efficiency. A solution considered in existing literature is to embed the high-dimensional space in a lower-dimensional manifold, often via a random linear embedding. In this paper, we identify several crucial issues and misconceptions about the use of linear embeddings for BO. We study the properties of linear embeddings from the literature and show that some of the design choices in current approaches adversely impact their performance. We show empirically that properly addressing these issues significantly improves the efficacy of linear embeddings for BO on a range of problems, including learning a gait policy for robot locomotion.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.11659")
get_code_for_paper("2001.11659")
have("2001.11659")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.11659.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.11659)
Connect an agent — have() is free.