Nearly Optimal Algorithms for Level Set Estimation
Published in Artifical Intelligence and Statistics (AIStats), 2022
This paper provides the first instance-dependent, non-asymptotic upper bounds on sample complexity of level-set estimation that match information theoretic lower bounds.
Recommended citation: Mason, B., Camilleri, R., Mukherjee, S., Jamieson, K., Nowak, R., & Jain, L. (2021). Nearly Optimal Algorithms for Level Set Estimation. arXiv preprint arXiv:2111.01768. (To appear at AIStats, 2022) https://arxiv.org/pdf/2111.01768