SGD vs GD: Rank Deficiency in Linear Networks

A. Varre, Margarita Sagitova, Nicolas Flammarion
2/3/2026

No confident code implementation found for this paper.

Abstract

In this article, we study the behaviour of continuous-time gradient methods on a two-layer linear network with square loss. A dichotomy between SGD and GD is revealed: GD preserves the rank at initialization while (label noise) SGD diminishes the rank regardless of the initialization. We demonstrate this rank deficiency by studying the time evolution of the determinant of a matrix of parameters. To further understand this phenomenon, we derive the stochastic differential equation (SDE) governing the eigenvalues of the parameter matrix. This SDE unveils a replusive force between the eigenvalues: a key regularization mechanism which induces rank deficiency. Our results are well supported by experiments illustrating the phenomenon beyond linear networks and regression tasks.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{varre2026rank,
  title  = {SGD vs GD: Rank Deficiency in Linear Networks},
  author = {A. Varre and Margarita Sagitova and Nicolas Flammarion},
  year   = {2026},
  doi    = {10.52202/079017-1921},
  url    = {https://doi.org/10.52202/079017-1921},
  journal = {NEURIPS 2024 2024}
}

Discussion