arXiv Machine Learning

Minimax Optimal Early-Stopped Gradient Descent for Gaussian Mixture Classification

arXiv:2608. 06250v1 Announce Type: cross Abstract: In overparameterised classification, training data can be linearly separable even when the underlying distribution is not.

arXiv Machine Learning
22h ago

Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixtures

arXiv:2506. 06584v2 Announce Type: replace Abstract: Learning Gaussian Mixture Models (GMMs) is a fundamental problem in statistics and machine learning, with the Expectation-Maximization (EM) algorithm and its popular variant gradient EM being arguably the most widely used algorithms in practice.

By Mo Zhou, Weihang Xu, Maryam Fazel, Simon S. Du
arXiv Machine Learning
Jul 27

Smart predict-then-robustly-optimize

arXiv:2607. 21773v1 Announce Type: new Abstract: In this paper, we propose and study a robust variant of the smart predict-then-optimize approach that accounts for prediction shifts due to disturbance in the covariate feature space.

By Aakil Caunhye, Xuefei Lu, Belen Martin-Barragan
arXiv Machine Learning
Jun 5

How abundant are good interpolators?

arXiv:2606. 06469v1 Announce Type: cross Abstract: Let $S$ be the set of unit norm linear classifiers $\theta \in \mathbb{R}^d$ which correctly classify every point of a labeled dataset $(X_i,y_i)_{i=1}^n$, $X_i \in \mathbb{R}^d$, $y_i \in \{-1,+1\}$, with a possibly negative margin $\kappa$ fixed in advance.

By August Y. Chen, Ahmed El Alaoui