Noise misleads rotation invariant algorithms on sparse targets

It is well known that the class of rotation invariant algorithms are suboptimal even for learning sparse linear problems when the number of examples is below the "dimension" of the problem. This class includes any gradient descent trained neural net with a fully-connected input layer (initialized with a rotationally symmetric distribution). The simplest sparse problem is learning a single feature out of $d$ features. In that case the classification error or regression loss grows with $1-k/n$ where $k$ is the number of examples seen. These lower bounds become vacuous when the number of examples $k$ reaches the dimension $d$. We show that when noise is added to this sparse linear problem, rotation invariant algorithms are still suboptimal after seeing $d$ or more examples. We prove this via a lower bound for the Bayes optimal algorithm on a rotationally symmetrized problem. We then prove much lower upper bounds on the same problem for simple non-rotation invariant algorithms. Finally we analyze the gradient flow trajectories of many standard optimization algorithms in some simple cases and show how they veer toward or away from the sparse targets. We believe that our trajectory categorization will be useful in designing algorithms that can exploit sparse targets and our method for proving lower bounds will be crucial for analyzing other families of algorithms that admit different classes of invariances..

Medienart:	Preprint

Erscheinungsjahr:	2024
Erschienen:	2024

Enthalten in:	arXiv.org - (2024) vom: 05. März Zur Gesamtaufnahme - year:2024

Sprache:	Englisch

Beteiligte Personen:	Warmuth, Manfred K. [VerfasserIn] Kotłowski, Wojciech [VerfasserIn] Jones, Matt [VerfasserIn] Amid, Ehsan [VerfasserIn]

Links:	Volltext [kostenfrei]

Themen:	000 510 Computer Science - Machine Learning Statistics - Machine Learning

Förderinstitution / Projekttitel:

PPN (Katalog-ID):	XCH042732808