U Berkeley, Jack Parker-Holder, Aldo Pacchiano, Krzysztof Choromanski, Daiyi Peng, Yunhao Tang, Xingyou Song, Tamas Sarlos, Qiuyi Zhang, Deepali Jain, Wenbo Gao, Yuxiang Yang, and 1 more
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.
In this paper, we approach the problem of optimizing blackbox functions over large hybrid search spaces consisting of both combinatorial and continuous parameters. We demonstrate that previous evolutionary algorithms which rely on mutationbased approaches, while flexible over combinatorial spaces, suffer from a curse of dimensionality in high dimensional continuous spaces both theoretically and empirically, which thus limits their scope over hybrid search spaces as well. In order to combat this curse, we propose ES-ENAS, a simple and modular joint optimization procedure combining the class of sample-efficient smoothed gradient techniques, commonly known as Evolutionary Strategies (ES), with combinatorial optimizers in a highly scalable and intuitive way, inspired by the one-shot or supernet paradigm introduced in Efficient Neural Architecture Search (ENAS). By doing so, we achieve significantly more sample efficiency, which we empirically demonstrate over synthetic benchmarks, and are further able to apply ES-ENAS for architecture search over popular RL benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2101.07415")
get_code_for_paper("2101.07415")
have("2101.07415")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2101.07415.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2101.07415)
Connect an agent — have() is free.