← Search

Thanh Tan Nguyen

2 accepted papers

2019

Sample Efficient Graph-Based Optimization with Noisy Observations

AISTATS 2019poster

We study sample complexity of optimizing “hill-climbing friendly” functions defined on a graph under noisy observations. We define a notion of convexity, and we show that a variant of best-arm identification can find a near-optimal solution after a small number of queries that is independent of the…