paper-with-me

Papers

Multivariate rank via entropic optimal transport: sample efficiency and generative modeling

2021-10-29 · Shoaib Bin Masud, Matthew Werenski, James M. Murphy, Shuchin Aeron

The framework of optimal transport has been leveraged to extend the notion of rank to the multivariate setting while preserving desirable properties of the resulting goodness-of-fit (GoF) statistics. In particular, the rank energy (RE) and rank maximum mean discrepancy (RMMD) are distribution-free under the null, exhibit high power in statistical testing, and are robust to outliers. In this paper, we point to and alleviate some of the practical shortcomings of these proposed GoF statistics, namely their high computational cost, high statistical sample complexity, and lack of differentiability with respect to the data. We show that all these practically important issues are addressed by considering entropy-regularized optimal transport maps in place of the rank map, which we refer to as the soft rank. We consequently propose two new statistics, the soft rank energy (sRE) and soft rank maximum mean discrepancy (sRMMD), which exhibit several desirable properties. Given $n$ sample data points, we provide non-asymptotic convergence rates for the sample estimate of the entropic transport map to its population version that are essentially of the order $n^{-1/2}$ when the starting measure is subgaussian and the target measure has compact support. This result is novel compared to existing results which achieve a rate of $n^{-1}$ but crucially rely on both measures having compact support. We leverage this result to demonstrate fast convergence of sample sRE and sRMMD to their population version making them useful for high-dimensional GoF testing. Our statistics are differentiable and amenable to popular machine learning frameworks that rely on gradient methods. We leverage these properties towards showcasing the utility of the proposed statistics for generative modeling on two important problems: image generation and generating valid knockoffs for controlled feature selection.

📄 PDF Abstract BibTeX arXiv:2111.00043

Code (1)

shoaibbinmasud/soft-rank-energy-and-applications 공식 구현 pytorch

Tasks

feature selectionImage GenerationModel Selection

Similar Papers 제목 키워드 기반

On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection

2023-02-15 · Matthew Werenski, Shoaib Bin Masud, James M. Murphy, Shuchin Aeron

This paper considers the use of recently proposed optimal transport-based multivariate test statistics, namely rank energy and its variant the soft rank energy derived from entropically regularized optimal transport, for…

Change Point Detection

Stochastic optimal transport in Banach Spaces for regularized estimation of multivariate quantiles

2023-02-02 · Bernard Bercu, Jérémie Bigot, Gauthier Thurin

We introduce a new stochastic algorithm for solving entropic optimal transport (EOT) between two absolutely continuous probability measures $\mu$ and $\nu$. Our work is motivated by the specific setting of Monge-Kantorov…

Gaussian entropic optimal transport: Schrödinger bridges and the Sinkhorn algorithm

2024-12-24 · O. Deniz Akyildiz, Pierre Del Moral, Joaquín Miguez

Entropic optimal transport problems are regularized versions of optimal transport problems. These models play an increasingly important role in machine learning and generative modelling. For finite spaces, these problems…

Entropic estimation of optimal transport maps

2021-09-24 · Aram-Alexandre Pooladian, Jonathan Niles-Weed

We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we s…

Entropic Neural Optimal Transport via Diffusion Processes

2022-11-02 · NeurIPS 2023 11 · Nikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry Vetrov 외

We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions which are accessible by samples. Our algorithm is based …