The sample complexity of level set approximation

10/26/2020
by   François Bachoc, et al.
0

We study the problem of approximating the level set of an unknown function by sequentially querying its values. We introduce a family of algorithms called Bisect and Approximate through which we reduce the level set approximation problem to a local function approximation problem. We then show how this approach leads to rate-optimal sample complexity guarantees for Hölder functions, and we investigate how such rates improve when additional smoothness or other structural assumptions hold true.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset