Related papers: The CLT in high dimensions: quantitative bounds vi…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
We propose a discrete time formulation of the semi martingale optimal transport problembased on multi-marginal entropic transport. This approach offers a new way to formulate and solve numerically the calibration problem proposed by Guo et…
We develop a new general algorithm for finding a regular tight-binding lattice Hamiltonian in infinite dimensions for an arbitrary given shape of the density of states (DOS). The availability of such an algorithm is essential for the…
Motivated by the manifold hypothesis, which states that data with a high extrinsic dimension may yet have a low intrinsic dimension, we develop refined statistical bounds for entropic optimal transport that are sensitive to the intrinsic…
In this work we consider solutions to stochastic partial differential equations with transport noise, which are known to converge, in a suitable scaling limit, to solution of the corresponding deterministic PDE with an additional viscosity…
The Wasserstein metric has become increasingly important in many machine learning applications such as generative modeling, image retrieval and domain adaptation. Despite its appeal, it is often too costly to compute. This has motivated…
Optimal Transport (OT) metrics allow for defining discrepancies between two probability measures. Wasserstein distance is for longer the celebrated OT-distance frequently-used in the literature, which seeks probability distributions to be…
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…
We study the central limit theorem (CLT) for linear eigenvalue statistics of several types of matrix models, whose entries are having exploding moments, i.e., moments of the entries are increasing with the size of the matrix. In particular,…
We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate…
We address the problem of proving a Central Limit Theorem for the empirical optimal transport cost, $\sqrt{n}\{\mathcal{T}_c(P_n,Q)-\mathcal{W}_c(P,Q)\}$, in the semi discrete case, i.e when the distribution $P$ is finitely supported. We…
We develop a conserving relaxation-time approximation (cRTA), which explicitly enforces conservation of particle number, energy, and momentum and employs an energy-resolved projection onto the full space of collision invariants. This makes…
This work introduces novel computational methods for entropic optimal transport (OT) problems under martingale-type conditions. The considered problems include the discrete martingale optimal transport (MOT) problem. Moreover, as the…
The optimal transport problem for measures supported on non-Euclidean spaces has recently gained ample interest in diverse applications involving representation learning. In this paper, we focus on circular probability measures, i.e.,…
In this paper we apply the formalism of translation invariant (continuous) matrix product states in the thermodynamic limit to $(1+1)$ dimensional critical models. Finite bond dimension bounds the entanglement entropy and introduces an…
In this work we study and establish some quenched functional Central Limit Theorems (CLTs) for stationary random fields under a projective criteria. These results are functional generalizations of the theorems obtained by Zhang et al.…
We establish an improved form of the classical logarithmic Sobolev inequality for the Gaussian measure restricted to probability densities which satisfy a Poincar\'e inequality. The result implies a lower bound on the deficit in terms of…
Lightweight Temporal Compression (LTC) is among the lossy stream compression methods that provide the highest compression rate for the lowest CPU and memory consumption. As such, it is well suited to compress data streams in…
We investigate the convergence rate of multi-marginal optimal transport costs that are regularized with the Boltzmann-Shannon entropy, as the noise parameter $\varepsilon$ tends to $0$. We establish lower and upper bounds on the difference…
We derive quantitative bounds on the rate of convergence in $L^1$ Wasserstein distance of general M-estimators, with an almost sharp (up to a logarithmic term) behavior in the number of observations. We focus on situations where the…