paper-with-me

Papers

Random Matrix-Improved Estimation of the Wasserstein Distance between two Centered Gaussian Distributions

2019-03-08 · Malik Tiomoko, Romain Couillet

This article proposes a method to consistently estimate functionals $\frac1p\sum_{i=1}^pf(\lambda_i(C_1C_2))$ of the eigenvalues of the product of two covariance matrices $C_1,C_2\in\mathbb{R}^{p\times p}$ based on the empirical estimates $\lambda_i(\hat C_1\hat C_2)$ ($\hat C_a=\frac1{n_a}\sum_{i=1}^{n_a} x_i^{(a)}x_i^{(a){{\sf T}}}$), when the size $p$ and number $n_a$ of the (zero mean) samples $x_i^{(a)}$ are similar. As a corollary, a consistent estimate of the Wasserstein distance (related to the case $f(t)=\sqrt{t}$) between centered Gaussian distributions is derived. The new estimate is shown to largely outperform the classical sample covariance-based `plug-in' estimator. Based on this finding, a practical application to covariance estimation is then devised which demonstrates potentially significant performance gains with respect to state-of-the-art alternatives.

📄 PDF Abstract BibTeX arXiv:1903.03447

Code (1)

maliktiomoko/RMTWasserstein 공식 구현

Similar Papers 제목 키워드 기반

Denoising distances beyond the volumetric barrier

2026-04-01 · Han Huang, Pakawut Jiradilok, Elchanan Mossel arxiv

We study the problem of reconstructing the latent geometry of a $d$-dimensional Riemannian manifold from a random geometric graph. While recent works have made significant progress in manifold recovery from random geomet…

Random Matrix Improved Covariance Estimation for a Large Class of Metrics

2019-02-07 · Malik Tiomoko, Florent Bouchard, Guillaume Ginholac, Romain Couillet

Relying on recent advances in statistical estimation of covariance distances based on random matrix theory, this article proposes an improved covariance and precision matrix estimation for a wide family of metrics. The m…

BIG-bench Machine Learning

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning

2026-05-14 · Ao Xu, Tieru Wu arxiv

Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic …

Graph ClassificationTwo-sample testingPoint Clouds

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator

2018-05-18 · Viet Anh Nguyen, Daniel Kuhn, Peyman Mohajerin Esfahani

We introduce a distributionally robust maximum likelihood estimation model with a Wasserstein ambiguity set to infer the inverse covariance matrix of a $p$-dimensional Gaussian random vector from $n$ independent samples.…

Recovering Wasserstein Distance Matrices from Few Measurements

2025-09-23 · Muhammad Rana, Abiy Tasissa, HanQin Cai, Yakov Gavriyelov 외 arxiv

This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddings like multidimensional scaling (MDS) o…