Universal Approximation of Mean-Field Models via Transformers
Not on the map. Why?
Abstract (arXiv)
This paper investigates the use of transformers to approximate the mean-field dynamics of interacting particle systems exhibiting collective behavior. Such systems are fundamental in modeling phenomena across physics, biology, and engineering, including opinion formation, biological networks, and swarm robotics. The key characteristic of these systems is that the particles are indistinguishable, leading to permutation-equivariant dynamics. First, we empirically demonstrate that transformers are well-suited for approximating a variety of mean field models, including the Cucker-Smale model for flocking and milling, and the mean-field system for training two-layer neural networks. We validate our numerical experiments via mathematical theory. Specifically, we prove that if a finite-dimensional transformer effectively approximates the finite-dimensional vector field governing the particle system, then the L2 distance between the textitexpected transformer and the infinite-dimensional mean-field vector field can be uniformly bounded by a function of the number of particles observed during training. Leveraging this result, we establish theoretical bounds on the distance between the true mean-field dynamics and those obtained using the transformer.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 14 of its 28 references that are in the map. First posted on arXiv 6 Oct 2024.
Builds on
14 of 28 references.
References · 14
- 2017Graph Attention Networkscited by 8,923
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 506
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2020The Lipschitz Constant of Self-Attentioncited by 174
- 2023A mathematical perspective on Transformerscited by 164
- 2020A Mathematical Theory of Attentioncited by 46
- 2018Nonparametric inference of interaction laws in systems of agents from trajectory datacited by 44
- 2024Transformers are Universal In-context Learnerscited by 43
- 2021Universal Approximation Under Constraints is Possible with Transformerscited by 32
- 2023Sumformer: Universal Approximation for Efficient Transformerscited by 30
- 2021Learning Mean-Field Equations from Particle Data Using WSINDycited by 29
- 2022Mean-field neural networks: learning mappings on Wasserstein spacecited by 16
2 more
Built on by
Citing papers per year: 2025: 3; 2026: 4.
7 papers.
- 2025OT-Transformer: A Continuous-time Transformer Architecture with Optimal Transport Regularizationcited by 7
- 2025Transformers through the lens of support-preserving maps between measurescited by 6
- 2025DiScoFormer: Plug-In Density and Score Estimation with Transformerscited by 6
- 2026One Operator for Many Densities: Amortized Approximation of Conditioning by Neural Operatorscited by 4
- 2026Function graph transformers universally approximate operators between function spacescited by 2
- 2026Measure-to-measure Regression with Transformerscited by 2
- 2026Universal Approximation of Measure-to-Measure Operators by Pushforwardscited by 1
- 2026Universal Approximation of Measure-to-Measure Operators by Pushforwards28 Sep 2026
- 2026Measure-to-measure Regression with Transformers27 May 2026
- 2026Function graph transformers universally approximate operators between function spaces18 May 2026
- 2026One Operator for Many Densities: Amortized Approximation of Conditioning by Neural Operators7 May 2026
- 2025DiScoFormer: Plug-In Density and Score Estimation with Transformers8 Nov 2025
- 2025Transformers through the lens of support-preserving maps between measures30 Sep 2025
- 2025OT-Transformer: A Continuous-time Transformer Architecture with Optimal Transport Regularization30 Jan 2025