OpenReview
.net
OpenReview
.net
Login
OpenReview
.net
Login
Go to
AISTATS 2019
homepage
Noisy Blackbox Optimization using Multi-fidelity Queries: A Tree Search Approach
Rajat Sen
,
Kirthevasan Kandasamy
,
Sanjay Shakkottai
2019 (modified: 24 Apr 2023)
AISTATS 2019
Readers:
Everyone
Abstract:
We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-par...
0 Replies
Loading