mlsanityData to 7 Oct 2026

Measure-to-measure Regression with Transformers

arXiv 2605.28075 ↗First posted 27 May 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Many learning problems require predicting how populations evolve under an unknown transformation. A natural representation for such populations is a probability measure, with point clouds as a key example. In this work, we study the measure-to-measure (M2M) regression problem, in which one seeks to learn a map between probability measures from a finite collection of observed input-output pairs. In contrast to classical regression, where individual samples are transformed independently, M2M regression treats entire distributions as the data points. This perspective is vital in certain scientific applications, for example, cellular and molecular biology, where cells are known to evolve not as independent data points but as a collection. However, few existing approaches address the problem of M2M regression with sufficient expressivity and scalability. We present a formalization of nonlinear M2M regression and introduce two easy-to-use, expressive, and scalable approaches to learn such operators: transformers as static M2M maps and transformers as dynamic M2M velocity fields. Our approach leverages the natural measure-dependent and mean-field structure of transformers to learn nonlinear M2M maps on the space of probability distributions. We illustrate the effectiveness of our proposed method to generalize to unseen measures on synthetic experiments, interacting particle systems, and a large-scale patient-derived organoid dataset for predicting treatment response in colorectal cancer.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 60 of its 82 references that are in the map. First posted on arXiv 27 May 2026.

Builds on

60 of 82 references.

References · 60

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Scalable Diffusion Models with Transformerscited by 5,931
  3. 2022Flow Matching for Generative Modelingcited by 5,426
  4. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
  5. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2020Point Transformercited by 1,462
  8. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
  9. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
  10. 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 707
  11. 2025Mean Flows for One-step Generative Modelingcited by 524
  12. 2023Improved Techniques for Training Consistency Modelscited by 430
38 more
  1. 2019Are Transformers universal approximators of sequence-to-sequence functions?cited by 404
  2. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
  3. 2023A mathematical perspective on Transformerscited by 160
  4. 2019Modeling Point Clouds with Self-Attention and Gumbel Subset Samplingcited by 151
  5. 2021Inductive Biases and Variable Creation in Self-Attention Mechanismscited by 144
  6. 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 136
  7. 2023The emergence of clusters in self-attention dynamicscited by 133
  8. 2024Flow map matching with stochastic interpolants: A mathematical framework for consistency modelscited by 99
  9. 2026Generative Modeling via Driftingcited by 98
  10. 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 81
  11. 2023Tighter Bounds on the Expressivity of Transformer Encoderscited by 65
  12. 2021Minibatch optimal transport distances; analysis and applicationscited by 62
  13. 2016Fr'echet Regression for Random Objects with Euclidean Predictorscited by 57
  14. 2020Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionalitycited by 49
  15. 2014Learning Theory for Distribution Regressioncited by 48
  16. 2024Generative Modeling of Molecular Dynamics Trajectoriescited by 48
  17. 2023How Smooth Is Attention?cited by 44
  18. 2024Meta Flow Matching: Integrating Vector Fields on the Wasserstein Manifoldcited by 41
  19. 2021Universal Approximation Under Constraints is Possible with Transformerscited by 32
  20. 2023Latent Space Editing in Transformer-Based Flow Matchingcited by 32
  21. 2026Meta Flow Maps enable scalable reward alignmentcited by 32
  22. 2023Sumformer: Universal Approximation for Efficient Transformerscited by 30
  23. 2025A Unified Perspective on the Dynamics of Deep Transformerscited by 30
  24. 2022Meta Optimal Transportcited by 28
  25. 2023Approximation Rate of the Transformer Architecture for Sequence Modelingcited by 28
  26. 2024Measure-to-measure interpolation using Transformerscited by 28
  27. 2024Wasserstein Flow Matching: Generative modeling over families of distributionscited by 27
  28. 2024Understanding the Expressive Power and Mechanisms of Transformer for Sequence Modelingcited by 25
  29. 2024Prompting a Pretrained Transformer Can Be a Universal Approximatorcited by 25
  30. 2025Quantitative Clustering in Mean-Field Transformer Modelscited by 23
  31. 2025Critical attention scaling in long-context transformerscited by 17
  32. 2025Curly Flow Matching for Learning Non-gradient Field Dynamicscited by 17
  33. 2021Distribution-on-Distribution Regression via Optimal Transport Mapscited by 16
  34. 2021On Transportation of Mini-batches: A Hierarchical Approachcited by 15
  35. 2023A Brief Survey on the Approximation Theory for Sequence Modellingcited by 15
  36. 2024Towards Understanding the Universality of Transformers for Next-Token Predictioncited by 9
  37. 2024Universal Approximation of Mean-Field Models via Transformerscited by 7
  38. 2025Modeling Microenvironment Trajectories on Spatial Transcriptomics with NicheFlowcited by 7

50 most cited of 60 All 60 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.