1 research outputs found
Active Learning a Convex Body in Low Dimensions
Consider a set of points, and a convex body
provided via a separation oracle. The task at hand is to decide for each point
of if it is in using the fewest number of oracle queries. We show that
one can solve this problem in two and three dimensions using
queries, where is the largest subset of points of in convex
position. Furthermore, we show that in two dimensions one can solve this
problem using oracle queries, where is a lower
bound on the minimum number of queries that any algorithm for this specific
instance requires.Comment: Talk based on results in the paper is available here:
https://youtu.be/5Epyh2lHrF