v1v2 (latest)

Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem

28 May 2019

Papers citing "Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem"

25 / 25 papers shown

Title
Wasserstein Flow Matching: Generative modeling over families of distributions Doron Haviv Aram-Alexandre Pooladian Dana Peér Brandon Amos OOD 71 1 0 01 Nov 2024
Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applications Matthew Werenski Brendan Mallery Shuchin Aeron James M. Murphy 83 0 0 31 Oct 2024
The Benefits of Balance: From Information Projections to Variance Reduction Lang Liu Ronak R. Mehta Soumik Pal Zaïd Harchaoui 60 0 0 27 Aug 2024
Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm Stephan Eckstein 87 7 0 07 Nov 2023
Sinkhorn Divergences for Unbalanced Optimal Transport Thibault Séjourné Jean Feydy Franccois-Xavier Vialard A. Trouvé Gabriel Peyré OT 78 74 0 28 Oct 2019
Convergence of Smoothed Empirical Measures with Applications to Entropy Estimation Ziv Goldfeld Kristjan Greenewald Yury Polyanskiy Jonathan Niles-Weed 71 68 0 30 May 2019
Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures Bernard Bercu Jérémie Bigot 58 19 0 21 Dec 2018
Estimating Differential Entropy under Gaussian Convolutions Ziv Goldfeld Kristjan Greenewald Yury Polyanskiy 47 11 0 27 Oct 2018
Empirical Regularized Optimal Transport: Statistical Theory and Applications M. Klatt Carla Tameling Axel Munk OT 64 61 0 23 Oct 2018
Interpolating between Optimal Transport and MMD using Sinkhorn Divergences Jean Feydy Thibault Séjourné François-Xavier Vialard S. Amari A. Trouvé Gabriel Peyré OT 64 531 0 18 Oct 2018
Estimating Information Flow in Deep Neural Networks Ziv Goldfeld E. Berg Kristjan Greenewald Igor Melnyk Nam H. Nguyen Brian Kingsbury Yury Polyanskiy 63 32 0 12 Oct 2018
Sample Complexity of Sinkhorn divergences Aude Genevay Lénaïc Chizat Francis R. Bach Marco Cuturi Gabriel Peyré OT 77 289 0 05 Oct 2018
Entropic optimal transport is maximum-likelihood deconvolution Philippe Rigollet Jonathan Niles-Weed OT 64 78 0 14 Sep 2018
Gromov-Wasserstein Alignment of Word Embedding Spaces David Alvarez-Melis Tommi Jaakkola OT 56 328 0 31 Aug 2018
Unsupervised Alignment of Embeddings with Wasserstein Procrustes Edouard Grave Armand Joulin Quentin Berthet 71 199 0 29 May 2018
Computational Optimal Transport Gabriel Peyré Marco Cuturi OT 224 2,150 0 01 Mar 2018
Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance Jonathan Niles-Weed Francis R. Bach 208 421 0 01 Jul 2017
Learning Generative Models with Sinkhorn Divergences Aude Genevay Gabriel Peyré Marco Cuturi OT 190 631 0 01 Jun 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Jason M. Altschuler Jonathan Niles-Weed Philippe Rigollet OT 72 594 0 26 May 2017
Central Limit Theorem for empirical transportation cost in general dimension E. del Barrio Jean-Michel Loubes OT 53 108 0 03 May 2017
Efficient multivariate entropy estimation via $k$ -nearest neighbour distances Thomas B. Berrett R. Samworth M. Yuan 87 126 0 01 Jun 2016
Stochastic Optimization for Large-scale Optimal Transport Aude Genevay Marco Cuturi Gabriel Peyré Francis R. Bach OT 80 468 0 27 May 2016
Optimal Transport for Domain Adaptation Nicolas Courty Rémi Flamary D. Tuia A. Rakotomamonjy OT OOD 145 1,123 0 02 Jul 2015
Deep Learning and the Information Bottleneck Principle Naftali Tishby Noga Zaslavsky DRL 212 1,592 0 09 Mar 2015
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances Marco Cuturi OT 220 4,288 0 04 Jun 2013