Universal Approximation of Measure-to-Measure Operators by Pushforwards
Not on the map. Why?
Abstract (arXiv)
Many learning tasks map an input distribution to an output distribution. A natural way to model such an operator is to transform each input sample using a continuous function that may depend on the entire input distribution, and then take the distribution of the transformed samples. This defines a measure-dependent pushforward model and includes measure-theoretic formulations of transformers. We ask when such models can approximate arbitrary continuous operators between spaces of probability measures. We first show that universal approximation fails when atomic inputs are allowed: some continuous measure-to-measure operators that split or redistribute atomic mass cannot be approximated arbitrarily well by deterministic pushforward models. We then introduce the uniform level set condition, which requires a continuous measure-dependent scalarization whose shrinking level set neighborhoods carry uniformly vanishing mass over the input family. This condition is satisfied, in particular, by compact families of absolutely continuous measures. On every compact family satisfying this condition, we prove that any continuous measure-to-measure operator with outputs of finite p-th moment can be uniformly approximated, in the p-Wasserstein distance, by continuous measure-dependent pushforwards. Combining our theorem with existing approximation results for measure-dependent in-context maps yields universal approximation by measure-theoretic transformers. We also extend the framework to continuously-varying source measures, yielding a corresponding universality result for a class of pushforward models that are closely aligned with cross-attention architectures.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 37 of its 47 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
37 of 47 references.
References · 37
- 2017Attention Is All You Needcited by 60,361
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2021Perceiver: General Perception with Iterative Attentioncited by 1,104
- 2019Are Transformers universal approximators of sequence-to-sequence functions?cited by 406
- 2020The Lipschitz Constant of Self-Attentioncited by 174
- 2019Learning Likelihoods with Conditional Normalizing Flowscited by 172
- 2023A mathematical perspective on Transformerscited by 164
- 2023The emergence of clusters in self-attention dynamicscited by 140
- 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 138
- 2020O(n) Connections are Expressive Enough: Universal Approximability of Sparse Transformerscited by 83
- 2020A Mathematical Theory of Attentioncited by 46
- 2023How Smooth Is Attention?cited by 44
25 more
- 2024Transformers are Universal In-context Learnerscited by 43
- 2024Continuum Attention for Neural Operatorscited by 40
- 2021Universal Approximation Under Constraints is Possible with Transformerscited by 32
- 2023Approximation and Estimation Ability of Transformers for Sequence-to-Sequence Functions with Infinite Dimensional Inputcited by 32
- 2025A Unified Perspective on the Dynamics of Deep Transformerscited by 32
- 2024Understanding Scaling Laws with Statistical and Approximation Theory for Transformer Neural Networks on Intrinsically Low-dimensional Datacited by 30
- 2025The Mean-Field Dynamics of Transformerscited by 30
- 2024Measure-to-measure interpolation using Transformerscited by 29
- 2023Approximation Rate of the Transformer Architecture for Sequence Modelingcited by 28
- 2024Understanding the Expressive Power and Mechanisms of Transformer for Sequence Modelingcited by 25
- 2024Prompting a Pretrained Transformer Can Be a Universal Approximatorcited by 25
- 2025Understanding In-Context Learning on Structured Manifolds: Bridging Attention to Kernel Methodscited by 15
- 2021On the Regularity of Attentioncited by 11
- 2025Learning Enhanced Ensemble Filterscited by 11
- 2025Operator learning meets inverse problems: A probabilistic perspectivecited by 11
- 2026In-Context Operator Learning on the Space of Probability Measurescited by 11
- 2024Universal Approximation of Mean-Field Models via Transformerscited by 7
- 2025Attention Mechanism, Max-Affine Partition, and Universal Approximationcited by 7
- 2025Transformers through the lens of support-preserving maps between measurescited by 6
- 2026Learning Probabilistic Filters with Strictly Proper Scoring Rulescited by 6
- 2026Approximation Theory for Lipschitz Continuous Transformerscited by 5
- 2025Approximation Bounds for Transformer Networks with Application to Regressioncited by 4
- 2026Continuous transformations of probability measures and their transport representationscited by 4
- 2026One Operator for Many Densities: Amortized Approximation of Conditioning by Neural Operatorscited by 4
- 2025A unified framework for establishing the universal approximation of transformer-type architecturescited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.