arXiv Machine Learning June 30, 2026 By Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So

Actively Learning Halfspaces without Synthetic Data

Read the original on arXiv Machine Learning →

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$.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 14

Learning Partition Trees for Nearest Neighbor Search

arXiv:2607. 09909v1 Announce Type: cross Abstract: We study nearest neighbor search from the perspective of data-driven algorithm design: given a dataset $P \subset \mathbb{R}^d$ of size $n$ and sample access to a query distribution over $\mathbb{R}^d$, the goal is to learn a data structure optimized for queries drawn from that specific distribution.

By Sanjeev Khanna, Ashwin Padaki, Erik Waingarten

arXiv AI

1d ago

Optimal Lower Bounds for Networked Information Aggregation

arXiv:2608. 15472v1 Announce Type: cross Abstract: The problem of networked information aggregation, studied in Kearns et al.

By Ambar Pal

arXiv Machine Learning

Aug 7

Optimal Rates for Learning with Monotone Adversaries

arXiv:2608. 06337v1 Announce Type: cross Abstract: A monotone adversary observes an i.

By Anay Mehrotra

arXiv Machine Learning

Aug 5

Provably Learning Multi-Head Attention with Queries

arXiv:2608. 03294v1 Announce Type: new Abstract: We study the problem of learning multi-head softmax attention from black-box input-output access.

By Sunyeop Kim, Insung Kim, Jian Guo

llms safety

arXiv Machine Learning

Jun 10

Efficiently Learning Drifting Halfspaces with Massart Noise

arXiv:2606. 11149v1 Announce Type: new Abstract: We study the problem of learning a drifting concept in the presence of Massart noise.

By Mingchen Ma, Guyang Cao, Jelena Diakonikolas, Ilias Diakonikolas

arXiv Machine Learning

Jul 28

Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue

arXiv:2607. 22889v1 Announce Type: new Abstract: Learning the natural parameters $z \in \mathbb{R}^n$ of discrete distributions $\mu_z$ from independent samples constrained to a subset $S \subseteq \{0,1\}^n$ is a foundational challenge in high-dimensional statistics.

By Rohan Chauhan, Ioannis Panageas

Related stories

Learning Partition Trees for Nearest Neighbor Search

Optimal Lower Bounds for Networked Information Aggregation

Optimal Rates for Learning with Monotone Adversaries

Provably Learning Multi-Head Attention with Queries

Efficiently Learning Drifting Halfspaces with Massart Noise

Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue