arXiv Machine Learning By Deeparnab Chakrabarty, Aditi Dudeja, David Saulpic

Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds

Read the original on arXiv Machine Learning →

arXiv:2608. 02176v1 Announce Type: cross Abstract: We study the round complexity of learning a hidden partition $\mathcal{P}$ of an $n$-element universe using PAIR queries: PAIR($x,y$) tells us whether $x$ and $y$ belong to the same part of the partition or not.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 30

Clustering with Non-adaptive Subset Queries

arXiv:2409. 10908v3 Announce Type: replace-cross Abstract: Recovering the underlying $k$-clustering of a set $U$ of $n$ points by asking pair-wise same-cluster queries has garnered significant interest in the past few years.

By Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha
arXiv Machine Learning
Jul 9

Is Randomness Necessary for Adaptive Data Analysis?

arXiv:2607. 07085v1 Announce Type: cross Abstract: The Adaptive Data Analysis (ADA) problem formalizes the challenge of preventing false discovery and overfitting when a dataset is repeatedly reused.

By Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Sapir, Uri Stemmer
arXiv Machine Learning
Jul 28

Learning Distributions from Multiple Data Providers

arXiv:2607. 24732v1 Announce Type: cross Abstract: Motivated by learning from heterogeneous and overlapping data providers, we study a stylized model of distribution learning from restricted conditional samples.

By Jon Kleinberg, Amin Saberi, Xizhi Tan, Grigoris Velegkas
arXiv Machine Learning
Jun 30

Actively Learning Halfspaces without Synthetic Data

arXiv:2509. 20848v2 Announce Type: replace-cross Abstract: In the classic point location problem, one is given an arbitrary dataset $X \subset \mathbb{R}^d$ of $n$ points with query access to an unknown halfspace $f : \mathbb{R}^d \to \{0,1\}$, and the goal is to learn the label of every point in $X$.

By Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So