arXiv Machine Learning
Exact Recovery Thresholds for Weighted Data Selection in Vector-Valued Linear Regression
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Aug 31
Exact Recovery Thresholds for Weighted Data Selection in Vector-Valued Linear Regression
We resolve the threshold part of Question 4 of the COLT 2025 open problem "Data Selection for Regression Tasks" of Hanneke, Moran, Shlimovich and Yehudayoff. In vector-valued linear regression with sq...
arXiv Machine Learning
Aug 31
Exact Risk Ratios for Weighted Data Selection in Linear Regression
arXiv:2608. 28007v1 Announce Type: new Abstract: Hanneke, Moran, Shlimovich and Yehudayoff (COLT 2025) posed the following open problem.
arXiv AI
Aug 18
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.
arXiv Machine Learning
Aug 21
The Price of Hidden Curvature: Improved Lower Bounds for Bandit Convex Optimization
arXiv:2607. 18652v3 Announce Type: replace-cross Abstract: We establish improved lower bounds on the minimax expected regret of stochastic bandit convex optimization for $1$-Lipschitz functions on the $d$-dimensional Euclidean ball.
Hugging Face Trending Papers
Sep 10
Thompson Sampling for Non-Monotone Convex Ridge Bandits: Monotonicity Is Not Needed for Polynomial Regret
Bakhtiari, Lattimore and Szepesvári (COLT 2025) proved that Thompson sampling (TS) has Bayesian regret $\tilde O(d^{5/2}\sqrt n)$ for bandit convex optimisation with convex \emph{monotone} ridge losse...
arXiv Machine Learning
Sep 4
Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size
arXiv:2609. 03762v1 Announce Type: new Abstract: The computation of the Bures-Wasserstein (BW) barycenter of an ensemble of positive definite matrices arises throughout machine learning, optimal transport, and quantum information.