Vu Nguyen, Binxin Ru, Xingchen Wan, Michael Osborne, Huong Ha, Cong Lu
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.
High-dimensional black-box optimisation remains an important yet notoriously challenging problem. Despite the success of Bayesian optimisation methods on continuous domains, domains that are categorical, or that mix continuous and categorical variables, remain challenging. We propose a novel solution -we combine local optimisation with a tailored kernel design, effectively handling high-dimensional categorical and mixed search spaces, whilst retaining sample efficiency. We further derive convergence guarantee for the proposed approach. Finally, we demonstrate empirically that our method outperforms the current baselines on a variety of synthetic and real-world tasks in terms of performance, computational costs, or both.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.07188")
get_code_for_paper("2102.07188")
have("2102.07188")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.07188.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.07188)
Connect an agent — have() is free.