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.
The increasing demand for democratizing machine learning algorithms calls for hyperparameter optimization (HPO) solutions at low cost. Many machine learning algorithms have hyperparameters which can cause a large variation in the training cost. But this effect is largely ignored in existing HPO methods, which are incapable to properly control cost during the optimization process. To address this problem, we develop a new cost-frugal HPO solution. The core of our solution is a simple but new randomized direct-search method, for which we prove a convergence rate of $O(\frac{\sqrt{d}}{\sqrt{K}})$ and an $O(dε^{-2})$-approximation guarantee on the total cost. We provide strong empirical results in comparison with state-of-the-art HPO methods on large AutoML benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.01571")
get_code_for_paper("2005.01571")
have("2005.01571")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.01571.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.01571)
Connect an agent — have() is free.