Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Learning Nearest-Neighbor Maps from Adaptive Queries
Hadley Black, Geelon So
We study the problem of learning nearest-neighbor maps from adaptive queries, which is equivalent to the following problem of reconstructing a hidden set via a nearest-neighbor…
cs.DS2026
Actively Learning Halfspaces without Synthetic Data
Hadley Black, Kasper Green Larsen, Arya Mazumdar +2
In the classic point location problem, one is given an arbitrary dataset of points with query access to an unknown halfspace $f : \mathbb{R}^d \to \{0,…