290 citations · 492 across the 36 of their papers we have counts for
4 papers · 1 filter
Massively scalable Sinkhorn distances via the Nyström method
Jason Altschuler, Francis Bach, Alessandro Rudi +1
The Sinkhorn "distance", a variant of the Wasserstein distance with entropic regularization, is an increasingly popular tool in machine learning and statistical inference. However,…
Approximating the Quadratic Transportation Metric in Near-Linear Time
Jason Altschuler, Francis Bach, Alessandro Rudi +1
Computing the quadratic transportation metric (also called the -Wasserstein distance or root mean square distance) between two point clouds, or, more generally, two discrete dis…
Online learning over a finite action set with limited switching
Jason Altschuler, Kunal Talwar
This paper studies the value of switching actions in the Prediction From Experts (PFE) problem and Adversarial Multi-Armed Bandits (MAB) problem. First, we revisit the well-studied…
Best Arm Identification for Contaminated Bandits
Jason Altschuler, Victor-Emmanuel Brunel, Alan Malek
This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, w…