arXiv Machine Learning By Shogo Nakakita

Improved generalization bounds for binary linear classification via isoperimetry

Read the original on arXiv Machine Learning →

arXiv:2505. 16713v3 Announce Type: replace-cross Abstract: We examine the concentration of uniform generalization errors around their expectation in binary linear classification problems via an isoperimetric argument.

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

arXiv Machine Learning
Jul 22

Fundamental limits of distributed multiclass classification from simple binary decisions

arXiv:2607. 19334v1 Announce Type: cross Abstract: We consider the problem of constructing a $K$-class classifier from the combination of $O(\log K)$ simple binary classifiers -- this is a natural paradigm to construct a sophisticated classifier in a distributed manner with each agent performing a relatively straightforward task.

By Ioannis Papageorgiou, Srinivas Nomula, Ayalvadi Ganesh, Sidharth Jaggi, Parimal Parag
arXiv Machine Learning
Jun 8

Stability beyond Bounded Differences: Sharp Generalization Bounds under Finite $L_p$ Moments

arXiv:2606. 06855v1 Announce Type: cross Abstract: While algorithmic stability is a central tool for understanding generalization of learning algorithms, existing high-probability guarantees typically rely on uniform boundedness or sub-Gaussian/sub-Weibull tail assumptions, which can be overly restrictive for modern settings with heavy-tailed or unbounded losses.

By Qianqian Lei, Soham Bonnerjee, Yuefeng Han, Wei Biao Wu
arXiv Machine Learning
Jul 30

Tight Generalization Bound for AdaBoost

arXiv:2607. 26838v1 Announce Type: new Abstract: In this paper we show that the generalization error of AdaBoost is $\Theta\big(\tfrac{d\ln(n\gamma^{2}/d)}{n\gamma^2}+\tfrac{\ln(1/\delta)}{n}\big)$, where $\gamma$ is the advantage guaranteed by the weak learner, $d$ is the VC-dimension of the class containing the weak hypotheses, $n$ is the sample size, and $\delta$ is the confidence parameter.

By Mikael M{\o}ller H{\o}gsgaard
arXiv Machine Learning
Jul 14

Exact Dynamics of Multi-class Stochastic Gradient Descent

arXiv:2510. 14074v2 Announce Type: replace-cross Abstract: We develop a framework for analyzing the learning dynamics of high-dimensional problems trained using one-pass stochastic gradient descent (SGD) with data from multiple anisotropic classes.

By Elizabeth Collins-Woodfin, Inbar Seroussi