Gradient descent for deep equilibrium single-index models

Sanjit Dandapanthula, Aaditya Ramdas
11/21/2025
cs.LGmath.STstat.ML

No confident code implementation found for this paper.

Abstract

Deep equilibrium models (DEQs) have recently emerged as a powerful paradigm for training infinitely deep weight-tied neural networks that achieve state of the art performance across many modern machine learning tasks. Despite their practical success, theoretically understanding the gradient descent dynamics for training DEQs remains an area of active research. In this work, we rigorously study the gradient descent dynamics for DEQs in the simple setting of linear models and single-index models, filling several gaps in the literature. We prove a conservation law for linear DEQs which implies that the parameters remain trapped on spheres during training and use this property to show that gradient flow remains well-conditioned for all time. We then prove linear convergence of gradient descent to a global minimizer for linear DEQs and deep equilibrium single-index models under appropriate initialization and with a sufficiently small step size. Finally, we validate our theoretical findings through experiments.

View on arXivView PDF

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!

Similar Papers

Cite this paper

@article{dandapanthula2025gradient,
  title  = {Gradient descent for deep equilibrium single-index models},
  author = {Sanjit Dandapanthula and Aaditya Ramdas},
  year   = {2025},
  eprint = {2511.16976},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.16976v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.16976.svg)](https://codeofpaper.com/paper/2511.16976)

Discussion