arXiv Machine Learning June 5, 2026 By Eugene Golikov, Yaroslav Gusev, Dmitry Yarotsky

A prism hierarchy of learning regimes in large linear autoencoders

Read the original on arXiv Machine Learning →

arXiv:2606. 05335v1 Announce Type: new Abstract: Theoretical studies of machine learning models commonly consider different limiting regimes in which the learning dynamics of gradient descent becomes theoretically tractable.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 8

Beyond Linear and Overcomplete Regimes: A Mean-Field Analysis of Bottleneck Autoencoders

arXiv:2606. 07120v1 Announce Type: new Abstract: Autoencoders (AEs) learn low-dimensional representations by mapping data into a latent space while minimizing reconstruction error.

By Santanu Das, Ramyak Bilas, Pascal Esser, Satyaki Mukherjee

diffusion

arXiv AI

Jun 29

Derivation of effective gradient flow equations and dynamical truncation of training data in Deep Learning

arXiv:2501. 07400v2 Announce Type: replace-cross Abstract: We derive explicit equations governing the cumulative biases and weights in Deep Learning with ReLU activation function, based on gradient descent for the Euclidean loss in the input layer, and under the assumption that the weights are, in a precise sense, adapted to the coordinate system distinguished by the activations.

By Thomas Chen

safety

arXiv Machine Learning

Sep 10

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

arXiv:2609.07755v1 Announce Type: new Abstract: Understanding generalization remains a central challenge in machine learning because it requires jointly considering data, architecture, and training d...

By Yuqing Wang, Ioannis G. Kevrekidis, Mikhail Belkin

arXiv Machine Learning

Sep 10

The Dynamics of Generalization in Deep Learning

arXiv:2504.16450v4 Announce Type: replace Abstract: We derive a differential equation that governs the evolution of the generalization gap when a model is trained by gradient descent-based methods. T...

By Rubing Yang, Pratik Chaudhari

arXiv Machine Learning

Jun 30

Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization

arXiv:2505. 22578v2 Announce Type: replace Abstract: The optimization of neural networks under weight decay remains poorly understood from a theoretical standpoint.

By Etienne Boursier, Matthew Bowditch, Matthias Englert, Ranko Lazic

arXiv AI

Jul 7

The Map Behind the Flow: Finite-Step Gradient Descent as a Dynamical System

arXiv:2607. 04993v1 Announce Type: cross Abstract: Many phenomena of deep learning are dynamical: they concern not only which minima exist, but how gradient descent reaches, avoids, or selects among them.

By Thomas Hofmann

rag safety

One email a morning, machine-written

Related stories

Beyond Linear and Overcomplete Regimes: A Mean-Field Analysis of Bottleneck Autoencoders

Derivation of effective gradient flow equations and dynamical truncation of training data in Deep Learning

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

The Dynamics of Generalization in Deep Learning

Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization

The Map Behind the Flow: Finite-Step Gradient Descent as a Dynamical System