The paper proves global universal approximation theorems for non‑anticipative and general path‑dependent functionals on spaces of piecewise linear paths, showing that linear functionals of the corresponding signatures are dense in $L^p$ and weighted norms. It demonstrates that these results apply to piecewise linear interpolations of Gaussian processes, including Brownian motion and fractional Brownian motion with Hurst parameter $H>1/4$, and provides quantitative convergence rates for signatures of such approximations toward their continuous‑time counterparts. Consequently, the authors obtain $L^p$‑approximation results for path‑dependent functionals of Gaussian processes and for random ordinary and stochastic differential equations driven by Brownian motion.
By Mihriban Ceylan, David J. Pr\"omel
arXiv:2608.28446v1 Announce Type: cross
Abstract: For finite-dimensional linear inverse problems where the variables are Gaussian, it is well-known that the minimum-mean-square error estimator takes...
By Michael Unser
arXiv:2310. 09149v3 Announce Type: replace-cross Abstract: We study the approximation of probability measures in the Wasserstein-$p$ distance by structured classes of approximators, motivated by applications in imaging, machine learning, and physical measurement under sensor constraints.
By Keaton Hamm, Varun Khurana
arXiv:2609.14922v1 Announce Type: cross
Abstract: For constant-stepsize stochastic approximation (SA), the iterates converge in distribution to a stationary law that depends on the stepsize $\alpha.$...
By Yixuan Zhang, Qiaomin Xie
arXiv:2608. 08040v1 Announce Type: cross Abstract: We introduce conditional cylindrical neural networks for approximating functionals of conditional laws in McKean-Vlasov equations with common noise.
By Nacira Agram, Reda Hmioui, Jan Rems
arXiv:2606. 16610v1 Announce Type: cross Abstract: Diffusion Flow Matching (DFM) has recently emerged as a versatile framework for generative modeling, yet its theoretical convergence properties remain only partially understood.
By Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus
arXiv:2607. 14361v1 Announce Type: cross Abstract: We address fundamental challenges in representing and computing $\mathbb{R}^{d}$-valued predictable square-integrable processes over $[0,T]$, collected in the space $\mathcal{H}^2_T(\mathbb{R}^{d})$.
By Anastasis Kratsios, Giulia Livieri, Philipp Schmocker
The paper develops a diffusion approximation for stochastic gradient descent (SGD) when the optimization target is a functional on the Wasserstein space ℝ2. By lifting the problem to a Hilbert space via Lions differentiability, the authors construct a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient. They prove that this Gaussian approximation achieves second‑order weak accuracy, providing a rigorous basis for replacing sample‑driven randomness with analytically tractable Gaussian fluctuations in stochastic optimization over probability measures.
By Maria Oprea, Qin Li, Yunan Yang
arXiv:2605. 15806v2 Announce Type: replace Abstract: Neural operators excel as deterministic surrogates, but inevitably collapse to the conditional mean when applied to stochastic PDEs, discarding the variance and tail structure upon which uncertainty quantification depends.
By Kai Hidajat
The paper introduces a new simultaneous pointwise majorization framework for Banach‑valued stochastic processes that possess finite‑metric mixed‑tail increments. By assuming an anchored process satisfies a tail bound involving multiple pseudo‑metrics and orders, the authors derive a high‑probability envelope that holds uniformly over the index set, with terms expressed through integrals of log‑covering numbers and distance functions. This result generalizes single‑metric sub‑Weibull bounds and, in the Gaussian case, improves existing pointwise upper bounds by removing extraneous logarithmic factors.
By Haichen Hu, David Simchi-Levi
arXiv:2607. 16987v1 Announce Type: cross Abstract: Over the past few years, diffusion-based Schr\"odinger bridge models have been proposed to approximate optimal transport dynamics between two prescribed boundary distributions, with successful applications to generative modeling.
By Maxence Noble, Marie Scheid, Yazid Janati, Eric Moulines, Alain Durmus
arXiv:2602. 13906v2 Announce Type: replace-cross Abstract: Stochastic approximation (SA) is a method for finding the root of an operator perturbed by noise.
By Shaan Ul Haque, Zedong Wang, Zixuan Zhang, Siva Theja Maguluri