13/04/2021

The sample complexity of level set approximation

François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz

Keywords:

Abstract Paper Similar Papers

Abstract: 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.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AISTATS 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 3:00 
 0
 0
 0
 0
 15:16 
 0
 0
 0
 0
 12:27 
 0
 0
 0
 0
 16:03 
 0
 0
 0
 0
 14:00 
 0
 0
 0
 0
 15:02 
 0
 0
 0
 0
 13:54 
 0
 0
 0
 0
 3:33 
 0
 0
 0
 0
 2:44 
 0
 0
 0
 0
 22:51 
 0
 0
 0
 0
 14:06 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 3:55 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 14:51 
 0
 0
 0
 0
 15:10 
 0
 0
 0
 0
 5:41 
 0
 0
 0
 0
 20:50 
 0
 0
 0
 0
 3:29 
 0
 0
 0
 0
 14:38 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 1
 3:14 
 0
 0
 0
 0
 15:15 
 0
 0
 0
 0
 12:11 
 0
 0
 0
 0
 17:40 
 0
 0
 0
 0
 13:52 
 0
 0
 0
 0
 21:04 
 0
 0
 0
 0
 12:09 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 15:51 
 0
 0
 0
 0
 3:04 
 1
 1
 0
 0
 9:31 
 0
 0
 0
 0
 14:41 
 0
 0
 0
 0
 14:07 
 0
 0
 0
 0
 18:01 
 0
 0
 0
 0
 13:06 
 0
 0
 0
 0
 8:30 
 0
 0
 0
 0
 14:44 
 1
 0
 0
 0
 2:43 
 0
 1
 0
 0
 5:10