activity
20192025
most citedLinear Time Sinkhorn Divergences using Positive Features

13 citations · 46 across the 21 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

stat.ML2021★ 2 cited

Triangular Flows for Generative Modeling: Statistical Consistency, Smoothness Classes, and Fast Rates

Nicholas J. Irons, Meyer Scetbon, Soumik Pal +1

Triangular flows, also known as Knöthe-Rosenblatt measure couplings, comprise an important building block of normalizing flow models for generative modeling and density estimation,…

stat.ML2021★ 1 cited

An Asymptotic Test for Conditional Independence using Analytic Kernel Embeddings

Meyer Scetbon, Laurent Meunier, Yaniv Romano

We propose a new conditional dependence measure and a statistical test for conditional independence. The measure is based on the difference between analytic kernel embeddings of tw…

cs.LG2021★ 8 cited

Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs

Meyer Scetbon, Gabriel Peyré, Marco Cuturi

The ability to align points across two related yet incomparable point clouds (e.g. living in different spaces) plays an important role in machine learning. The Gromov-Wasserstein (…

stat.ML2021

Low-Rank Sinkhorn Factorization

Meyer Scetbon, Marco Cuturi, Gabriel Peyré

Several recent applications of optimal transport (OT) theory to machine learning have relied on regularization, notably entropy and the Sinkhorn algorithm. Because matrix-vector pr…

cs.GT2021★ 2 cited

Mixed Nash Equilibria in the Adversarial Examples Game

Laurent Meunier, Meyer Scetbon, Rafael Pinot +2

This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum gam…