147 citations · 203 across the 5 of their papers we have counts for
5 papers
Statistical Rates for Entropic Optimal Transport in the Discrete to SubGaussian Regime
Tomas Gonzalez, Gonzalo Mena
We study statistical rates in entropic optimal transport in the semi-discrete regime where one measure has finite support and the other is subGaussian. Our main result establishes…
Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transport
Gonzalo Mena, Amin Nejatbakhsh, Erdem Varol +1
We study Sinkhorn EM (sEM), a variant of the expectation maximization (EM) algorithm for mixtures based on entropic optimal transport. sEM differs from the classic EM algorithm in…
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
Gonzalo Mena, Jonathan Weed
We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a ne…
Learning Latent Permutations with Gumbel-Sinkhorn Networks
Gonzalo Mena, David Belanger, Scott Linderman +1
Permutations and matchings are core building blocks in a variety of latent variable models, as they allow us to align, canonicalize, and sort data. Learning in such models is diffi…
Reparameterizing the Birkhoff Polytope for Variational Permutation Inference
Scott W. Linderman, Gonzalo E. Mena, Hal Cooper +2
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optim…