English
Related papers

Related papers: Ergodicities and exponential ergodicities of Dawso…

200 papers

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally…

Machine Learning · Computer Science 2026-02-20 Moritz Piening , Robert Beinert

We study posterior rates of contraction in Gaussian process regression with unbounded covariate domain. Our argument relies on developing a Gaussian approximation to the posterior of the leading coefficients of a Karhunen--Lo\'{e}ve…

Statistics Theory · Mathematics 2015-10-06 Anirban Bhattacharya , Debdeep Pati

We derive quantitative bounds in the Wasserstein distance for the approximation of stochastic integrals with respect to Hawkes processes by a normally distributed random variable. In the case of deterministic and non-negative integrands,…

Probability · Mathematics 2022-09-09 Mahmoud Khabou , Nicolas Privault , Anthony Reveillac

As a well-known fact, the classical Euler scheme works merely for SDEs with coefficients of linear growth. In this paper, we study a general framework of modified Euler schemes, which is applicable to SDEs with super-linear drifts and…

Probability · Mathematics 2024-12-30 Jianhai Bao , Mateusz B. Majka , Jian Wang

We consider a random walk $S_k$ with i.i.d. steps on a compact group equipped with a bi-invariant metric. We prove quantitative ergodic theorems for the sum $\sum_{k=1}^N f(S_k)$ with H\"older continuous test functions $f$, including the…

Probability · Mathematics 2022-09-27 Bence Borda

We introduce the Wasserstein Transform (WT), a general unsupervised framework for updating distance structures on given data sets with the purpose of enhancing features and denoising. Our framework represents each data point by a…

Machine Learning · Computer Science 2026-04-14 Kun Jin , Facundo Mémoli , Zane Smith , Zhengchao Wan

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance between the posterior…

Machine Learning · Computer Science 2025-08-28 Jannis Chemseddine , Paul Hagemann , Gabriele Steidl , Christian Wald

This paper presents a novel distribution-agnostic Wasserstein distance-based estimation framework. The goal is to determine an optimal map combining prior estimate with measurement likelihood such that posterior estimation error optimally…

Systems and Control · Electrical Eng. & Systems 2024-03-22 Himanshu Prabhat , Raktim Bhattacharya

We consider the fully-coupled McKean-Vlasov equation with multi-time-scale potentials, and all the coefficients depend on the distributions of both the slow component and the fast motion. By studying the smoothness of the solution of the…

Probability · Mathematics 2022-04-28 Yun Li , Fuke Wu , Longjie Xie

We present an estimate of the Wasserstein distance between the data distribution and the generation of score-based generative models. The sampling complexity with respect to dimension is $\mathcal{O}(\sqrt{d})$, with a logarithmic constant.…

Machine Learning · Computer Science 2025-10-06 Xixian Wang , Zhongjian Wang

We show that the continuous-time gradient descent in Rn can be viewed as an optimal controlled evolution for a suitable action functional; a similar result holds for stochastic gradient descent. We then provide an analogous characterization…

Optimization and Control · Mathematics 2025-11-03 Yongxin Chen , Tryphon Georgiou , Michele Pavon

The inverse structure functions of exit distances have been introduced as a novel diagnostic of turbulence which emphasizes the more laminar regions [1-4]. Using Taylor's frozen field hypothesis, we investigate the statistical properties of…

Fluid Dynamics · Physics 2007-05-23 W. -X. Zhou , D. Sornette , W. -K. Yuan

Divergence functions are measures of distance or dissimilarity between probability distributions that serve various purposes in statistics and applications. We propose decompositions of Wasserstein and Cram\'er distances$-$which compare two…

Methodology · Statistics 2025-08-08 Johannes Resin , Daniel Wolffram , Johannes Bracher , Timo Dimitriadis

The mathematical forces at work behind Generative Adversarial Networks raise challenging theoretical issues. Motivated by the important question of characterizing the geometrical properties of the generated distributions, we provide a…

Machine Learning · Statistics 2023-10-06 Arthur Stéphanovitch , Ugo Tanielian , Benoît Cadre , Nicolas Klutchnikoff , Gérard Biau

Embedding complex objects as vectors in low dimensional spaces is a longstanding problem in machine learning. We propose in this work an extension of that approach, which consists in embedding objects as elliptical probability…

Machine Learning · Statistics 2019-02-19 Boris Muzellec , Marco Cuturi

A method for analyzing non-asymptotic guarantees of numerical discretizations of ergodic SDEs in Wasserstein-2 distance is presented by Sanz-Serna and Zygalakis in ``Wasserstein distance estimates for the distributions of numerical…

Machine Learning · Statistics 2024-12-03 Daniel Paulin , Peter A. Whalley

This work is devoted to the Lipschitz contraction and the long time behavior of certain Markov processes. These processes diffuse and jump. They can represent some natural phenomena like size of cell or data transmission over the Internet.…

Probability · Mathematics 2012-10-12 Bertrand Cloez

In a previous paper of Winter and the author the Law of Large Numbers for the local mass of certain superdiffusions was proved under a spectral theoretical assumption, which is equivalent to the ergodicity (positive recurrence) of the…

Probability · Mathematics 2007-05-23 Janos Englander

Score-based generative modeling with probability flow ordinary differential equations (ODEs) has achieved remarkable success in a variety of applications. While various fast ODE-based samplers have been proposed in the literature and…

Machine Learning · Statistics 2025-08-12 Xuefeng Gao , Lingjiong Zhu

A new Wasserstein multi-element polynomial chaos expansion (WPCE) is proposed, which is inspired by recent advances in computational optimal transport for estimating Wasserstein distances. The developed method combines unsupervised learning…

Numerical Analysis · Mathematics 2024-10-17 Robert Gruhlke , Martin Eigel