5 papers
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…
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,…
Clustering with Non-adaptive Subset Queries
Hadley Black, Euiwoong Lee, Arya Mazumdar +1
Recovering the underlying -clustering of a set of points by asking pair-wise same-cluster queries has garnered significant interest in the past few years. Given a query…
Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
Hadley Black, Arya Mazumdar, Barna Saha +1
The graph reconstruction problem has been extensively studied under various query models. In this paper, we propose a new query model regarding the number of connected components,…
Learning Partitions with Optimal Query and Round Complexities
Hadley Black, Arya Mazumdar, Barna Saha
We consider the basic problem of learning an unknown partition of elements into at most sets using simple queries that reveal information about a small subset of elements.…