aiqbench analysis
This paper introduces a measure-valued neural network capable of inferring interaction forces directly from particle trajectory data, effectively modeling complex collective behaviors in biological and physical systems. By establishing theoretical guarantees such as propagation-of-chaos and demonstrating strong out-of-distribution generalization across various dynamical systems, it advances the frontier of learning McKean-Vlasov dynamics from observational data.
MVNN: A Measure-Valued Neural Network for Learning McKean-Vlasov Dynamics from Particle Data
arXiv:2604.00333v3 Announce Type: replace-cross Abstract: Collective behaviors that emerge from interactions are fundamental to numerous biological systems. To learn such interacting forces from observations, we introduce a measure-valued neural network that infers measure-dependent interaction (drift) terms directly from particle-trajectory observations. The proposed architecture generalizes standard neural networks to operate on probability measures by learning cylindrical features, using an embedding network that produces scalable distribution-to-vector representations. On the theory side, we establish well-posedness of the resulting dynamics and prove propagation-of-chaos for the associated interacting-particle system. We further show universal approximation and quantitative approximation rates under a low-dimensional measure-dependence assumption. Numerical experiments on first and second order systems, including deterministic and stochastic Motsch-Tadmor dynamics, two-dimensional attraction-repulsion aggregation, Cucker-Smale dynamics, and a hierarchical multi-group system, demonstrate accurate prediction and strong out-of-distribution generalization.
Abstract:Collective behaviors that emerge from interactions are fundamental to numerous biological systems. To learn such interacting forces from observations, we introduce a measure-valued neural network that infers measure-dependent interaction (drift) terms directly from particle-trajectory observations. The proposed architecture generalizes standard neural networks to operate on probability measures by learning cylindrical features, using an embedding network that produces scalable distribution-to-vector representations. On the theory side, we establish well-posedness of the resulting dynamics and prove propagation-of-chaos for the associated interacting-particle system. We further show universal approximation and quantitative approximation rates under a low-dimensional measure-dependence assumption. Numerical experiments on first and second order systems, including deterministic and stochastic Motsch-Tadmor dynamics, two-dimensional attraction-repulsion aggregation, Cucker-Smale dynamics, and a hierarchical multi-group system, demonstrate accurate prediction and strong out-of-distribution generalization.
Numerical Analysis (math.NA); Machine Learning (cs.LG); Computational Physics (physics.comp-ph)
arXiv:2604.00333 [math.NA]
(or arXiv:2604.00333v3 [math.NA] for this version)
https://doi.org/10.48550/arXiv.2604.00333 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 222 words
Related coverage
Deep Learning and Elicitability for McKean-Vlasov FBSDEs With Common Noise
arXiv · Jun 15, 2026
Amortizing the Calibration Triple: A Projection-Consistent Neural Operator for Local-Stochastic Volatility
arXiv · Aug 4, 2026

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026
Humans Are Not Chinchillas: Revisiting “How Quick and Big Would A Software Intelligence Explosion Be?”
LessWrong · Oct 5, 2026