arXiv Machine Learning
Aug 10
Online Conformal Prediction Beyond Feedback
arXiv:2608. 07139v1 Announce Type: new Abstract: Uncertainty quantification is essential when deploying machine learning models in safety-critical applications.
Robust Regression of General ReLUs with Queries
arXiv:2606. 11130v1 Announce Type: new Abstract: We study the task of agnostically learning general (as opposed to homogeneous) ReLUs under the Gaussian distribution with respect to the squared loss.
Related stories
arXiv AI
Jul 1
A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guarantees
arXiv:2511. 22823v2 Announce Type: replace-cross Abstract: Weakly supervised learning has emerged as a practical alternative to fully supervised learning when complete and accurate labels are costly or infeasible to acquire.
arXiv Machine Learning
Jun 9
LARP: Learner-Agnostic Robust Data Prefiltering
arXiv:2506. 20573v4 Announce Type: replace-cross Abstract: Public datasets, crucial for modern machine learning and statistical inference, often contain low-quality or contaminated samples that can harm model performance.
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.
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.
arXiv Machine Learning
Jun 15
A Complexity Measure for Active Learning in Multi-group Mean Estimation
arXiv:2606. 14690v1 Announce Type: new Abstract: We study a \emph{max-risk} objective for active learning in a multi-group mean estimation $d$-armed bandits: a learner adaptively allocates a budget of $T$ samples across $d$ groups to minimize the worst-case uncertainty index $\max_{k\in[d]}\sigma_k^2/n_k$, where $\sigma_k$ is the standard deviation of the distribution of arm $d$, and $n_k$ is the number of times arm $d$ is sampled.
arXiv Machine Learning
2d ago
Active Regression via Linear-Sample Sparsification
arXiv:1711. 10051v4 Announce Type: replace Abstract: We present an approach that improves the sample complexity for a variety of curve fitting problems, including active learning for linear regression, polynomial regression, and continuous sparse Fourier transforms.
arXiv Machine Learning
Aug 11
The Cost of Adaptivity: Matching Lower Bounds Across Learning Problems
arXiv:2608. 08826v1 Announce Type: new Abstract: Adaptive procedures must work without nuisance information an oracle may use, such as a gradient scale or smoothness index, and robust procedures may have to answer queries whose coordinate and inspection time are chosen only after the data are seen.
arXiv Machine Learning
Jun 17
On Randomized Algorithms in Online Strategic Classification
arXiv:2602. 06257v2 Announce Type: replace Abstract: Online strategic classification studies settings in which agents strategically modify their features to obtain favorable predictions.
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.
arXiv AI
Aug 5
One Knob to Rule Them All: A Unified Optimal Transport View of Cold-Start Active Learning
arXiv:2608. 03249v1 Announce Type: new Abstract: Cold-Start Active Learning (CSAL) aims to select a valuable subset from an unlabeled pool without any prior knowledge or human assistance.
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$.