Related papers: Gaussian Approximation for the Moving Averaged Mod…
A moderate deviation principle as well as moderate and large deviation inequalities for a sequence of elements living inside a fixed Wiener chaos associated with an isonormal Gaussian process are shown. The conditions under which the…
We compute the Wiener chaos decomposition of the signature for a class of Gaussian processes, which contains fractional Brownian motion (fBm) with Hurst parameter H in (1/4, 1). At level 0, our result yields an expression for the expected…
In the first part of the paper we use a new Fourier technique to obtain a Stein characterizations for random variables in the second Wiener chaos. We provide the connection between this result and similar conclusions that can be derived…
We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…
A growing number of generative statistical models do not permit the numerical evaluation of their likelihood functions. Approximate Bayesian computation (ABC) has become a popular approach to overcome this issue, in which one simulates…
In this paper, following Nourdin-Peccati's methodology, we combine the Malliavin calculus and Stein's method to provide general bounds on the Wasserstein distance between functionals of a compound Hawkes process and a given Gaussian…
Consider $F$ an element of the second Wiener chaos with variance one. In full generality, we show that, for every integer $p\ge 1$, there exists $\eta_p>0$ such that if $\kappa_4(F)<\eta_p$ then the Malliavin derivative of $F$ admits a…
This paper develops a theory of propagation of chaos for a system of weakly interacting particles whose terminal configuration is fixed as opposed to the initial configuration as customary. Such systems are modeled by backward stochastic…
This paper considers the problem of regression over distributions, which is becoming increasingly important in machine learning. Existing approaches often ignore the geometry of the probability space or are computationally expensive. To…
We present a novel approach to approximate Gaussian and mixture-of-Gaussians filtering. Our method relies on a variational approximation via a gradient-flow representation. The gradient flow is derived from a Kullback--Leibler discrepancy…
We use Malliavin operators in order to prove quantitative stable limit theorems on the Wiener space, where the target distribution is given by a possibly multidimensional mixture of Gaussian distributions. Our findings refine and generalize…
Generalization error bounds are essential to understanding machine learning algorithms. This paper presents novel expected generalization error upper bounds based on the average joint distribution between the output hypothesis and each…
Several issues in machine learning and inverse problems require to generate discrete data, as if sampled from a model probability distribution. A common way to do so relies on the construction of a uniform probability distribution over a…
In this paper, we investigate gradient estimate of the Poisson equation and the exponential convergence in the Wasserstein metric $W_{1,d_{l^1}}$, uniform in the number of particles, and uniform-in-time propagation of chaos for the…
This paper uses sample data to study the problem of comparing populations on finite-dimensional parallelizable Riemannian manifolds and more general trivial vector bundles. Utilizing triviality, our framework represents populations as…
Hermite processes are paradigmatic examples of stochastic processes which can belong to any Wiener chaos of an arbitrary order; the wellknown fractional Brownian motion belonging to the Gaussian first order Wiener chaos and the Rosenblatt…
The autocovariance and cross-covariance functions naturally appear in many time series procedures (e.g., autoregression or prediction). Under assumptions, empirical versions of the autocovariance and cross-covariance are asymptotically…
We introduce the Gaussian transform (GT), an optimal transport inspired iterative method for denoising and enhancing latent structures in datasets. Under the hood, GT generates a new distance function (GT distance) on a given dataset by…
We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…
The Malliavin derivative, divergence operator, and the Ornstein-Uhlenbeck operator are extended from the traditional Gaussian setting to generalized processes from the higher-order chaos spaces.