Metraipolis › archive › dc_d65feb44097a
Stochastic Gradient Descent over P2 — arXiv:2609.13343
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13343
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:12:23.333Z
- SHA-256 of the archived text
e2cdca03fb600b5df0af6c931b7e298a79dc7e750400e8ff7af34ad3db4464a6- Stable URL of this page
https://metraipolis.com/documento/dc_d65feb44097a
How to cite
Stochastic Gradient Descent over P2 — arXiv:2609.13343 — arXiv (en), https://arxiv.org/abs/2609.13343 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d65feb44097a (Metraipolis archive dc_d65feb44097a, sha256 e2cdca03fb600b5df0af6c931b7e298a79dc7e750400e8ff7af34ad3db4464a6)
BibTeX
@misc{dcd65feb44097a,
title = {Stochastic Gradient Descent over P2 — arXiv:2609.13343},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13343},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d65feb44097a; sha256 e2cdca03fb600b5df0af6c931b7e298a79dc7e750400e8ff7af34ad3db4464a6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13343. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Stochastic gradient descent (SGD) admits diffusion approximations that replace the complicated randomness of stochastic gradients by Gaussian noise, providing a powerful tool for understanding its dynamics and long-time behavior. We investigate whether an analogous approximation principle holds for optimization over probability measures, where the objective is a functional defined on the Wasserstein space P2. The nonlinear geometry and infinite-dimensional nature of P2 prevent a direct extension of the classical Euclidean theory. Using Lions differentiability, we lift the problem to a linear Hilbert space, where higher-order differential calculus becomes available. We then construct a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient. By exploiting this moment matching through higher-order Taylor expansions, we show that the Gaussian approximation captures the SGD dynamics with second-order weak accuracy. Our result provides a rigorous foundation for replacing sample-driven randomness by analytically tractable Gaussian fluctuations in stochastic optimization over probability measures. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.LG). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.13343 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T23:54:14.838Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).