mlsanityData to 14 Oct 2026

On the global convergence of gradient flow for wide shallow models beyond homogeneous nonlinearities

arXiv 2605.10775 ↗First posted 11 May 2026math.OC cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

A surprising phenomenon in the training of neural networks is the ability of gradient descent to find global minimizers of the training loss despite its non-convexity. Following earlier work, we investigate this behavior for wide shallow models. Existing global convergence results primarily concern models with positively one-homogeneous nonlinearities, such as ReLU activations, and models with scalar output weights and bounded nonlinearities, such as sigmoid activations. We study a broader class of models, including multi-head attention layers and two-layer networks with bounded or asymptotically positively one-homogeneous activations and vector output weights. Building upon [Chizat and Bach, 2018], we prove that, in the limit of many hidden neurons or attention heads, non-global minimizers of the training loss are unstable under mean-field gradient flow dynamics by constructing "escape regions" in the parameter space. Our global convergence statements are conditional in the following sense: if the mean-field gradient flow converges in W2, then its limit must be a global minimizer. We revisit the bounded nonlinearity, scalar-output setting of [CB18], giving an escape region construction adapted to unbounded nonlinear parameter domains. We also propose new constructions for nonlinearities with at most linear growth under a non-degeneracy assumption and for asymptotically positively one-homogeneous nonlinearities. Finally, we show the well-posedness and stability estimates for the mean-field training dynamics under sub-Gaussian initializations.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 42 of its 59 references that are in the map. First posted on arXiv 11 May 2026.

Builds on

42 of 59 references.

References · 42

  1. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  2. 2016Gaussian Error Linear Units (GELUs)cited by 3,502
  3. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  4. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  5. 2020Rethinking Attention with Performerscited by 1,601
  6. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
  7. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
  8. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  9. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  10. 2018On Lazy Training in Differentiable Programmingcited by 675
  11. 2017Deep Neural Networks as Gaussian Processescited by 622
  12. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
30 more
  1. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
  2. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
  3. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 426
  4. 2021Random Feature Attentioncited by 354
  5. 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 331
  6. 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 317
  7. 2016Deep Learning without Poor Local Minimacited by 234
  8. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
  9. 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
  10. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
  11. 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
  12. 2020Infinite attention: NNGP and NTK for deep attention networkscited by 121
  13. 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
  14. 2019How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?cited by 84
  15. 2017The loss surface of deep and wide neural networkscited by 74
  16. 2020A Rigorous Framework for the Mean Field Limit of Multilayer Neural Networkscited by 68
  17. 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
  18. 2020Representation formulas and pointwise properties for Barron functionscited by 62
  19. 2024Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscapecited by 46
  20. 2018Gradient descent with identity initialization efficiently learns positive definite linear transformations by deep residual networkscited by 44
  21. 2021On the Proof of Global Convergence of Gradient Descent for Deep ReLU Networks with Linear Widthscited by 44
  22. 2017Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minimacited by 40
  23. 2023What can a Single Attention Layer Learn? A Study Through the Random Features Lenscited by 40
  24. 2020On the Convergence of Gradient Descent Training for Two-layer ReLU-networks in the Mean Field Regimecited by 39
  25. 2024Infinite Limits of Multi-head Transformer Dynamicscited by 39
  26. 2025A Unified Perspective on the Dynamics of Deep Transformerscited by 32
  27. 2018Exponential Convergence Time of Gradient Descent for One-Dimensional Deep Linear Neural Networkscited by 22
  28. 2024Non-asymptotic Convergence of Training Transformers for Next-token Predictioncited by 13
  29. 2024Training Dynamics of Transformers to Recognize Word Co-occurrence via Gradient Flow Analysiscited by 9
  30. 2020On the Dynamics of Training Attention Modelscited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.