arXiv:2407. 00966v3 Announce Type: replace Abstract: In traditional models of supervised learning, the goal of a learner-- given examples from an arbitrary joint distribution on $\mathbb{R}^d \times \{\pm 1\}$-- is to output a hypothesis that is competitive (to within $\epsilon$) of the best fitting concept from some class.
By Gautam Chandrasekaran, Adam Klivans, Vasilis Kontonis, Raghu Meka, Konstantinos Stavropoulos
The paper introduces a new algorithmic framework for learning Boolean concept classes under logconcave distributions, focusing on multi‑index models. It leverages a boosting approach based on weak partial learners, overcoming the need for distribution‑free weak learners by using a recursive moment‑based partitioning procedure that aligns low‑degree moments of conditioned distributions with the original logconcave distribution. This yields faster robust learners for fundamental concept classes such as functions of halfspaces and multiclass linear classifiers, and includes an efficient method for detecting moment discrepancies that may be useful beyond this work.
By Ilias Diakonikolas, Daniel M. Kane, Mingchen Ma
The paper extends the study of relatively smart learning, showing that ERM and any proper consistent learner are relatively smart for binary classification in the distribution‑free setting, achieving a quadratic sample‑complexity blowup. It further demonstrates that semi‑supervised relatively smart learning is possible with only a quadratic blowup in unlabeled data and no blowup in labeled data, though this requires a leave‑most‑out transductive approach and incurs intractability when only an agnostic ERM oracle is available. The results clarify the trade‑offs between sample efficiency, label efficiency, and computational tractability in relatively smart learning.
By Shaddin Dughmi, Alireza F. Pour
arXiv:2610. 10499v1 Announce Type: new Abstract: Online learning is an attractive framework in many domains because it permits well-defined learning even when data are dependent or chosen adversarially.
By Sasha Voitovych, Adam Block, Alexander Rakhlin, Abhishek Shetty
arXiv:2605. 18662v2 Announce Type: replace Abstract: Noise-tolerant PAC learning of linear models has been of central interests in machine learning community since the last century.
By Rita Adhikari, Shiwei Zeng
The paper introduces a distributionally robust method for learning hyperparameters of first‑order convex optimization algorithms. By minimizing a Wasserstein‑robust performance estimation problem over a dataset of problem instances, the approach interpolates between classical learning‑to‑optimize (L2O) and worst‑case PEP design. The authors solve the resulting problem with stochastic gradient descent, provide high‑probability risk bounds, and demonstrate that the learned algorithms outperform both worst‑case optimal and vanilla L2O baselines on logistic regression, LASSO, and linear programming tasks.
By Vinit Ranjan, Jisun Park, Bartolomeo Stellato