290 citations · 492 across the 36 of their papers we have counts for
5 papers · 1 filter
Algorithmic warm starts for Hamiltonian Monte Carlo
Matthew S. Zhang, Jason M. Altschuler, Sinho Chewi
Generating samples from a continuous probability density is a central algorithmic problem across statistics, engineering, and the sciences. For high-dimensional settings, Hamiltoni…
Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory
Jason M. Altschuler, Pablo A. Parrilo
We revisit Min-Mean-Cycle, the classical problem of finding a cycle in a weighted directed graph with minimum mean weight. Despite an extensive algorithmic literature, previous wor…
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…
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Jason Altschuler, Jonathan Weed, Philippe Rigollet
Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduct…
Greedy Column Subset Selection: New Bounds and Distributed Algorithms
Jason Altschuler, Aditya Bhaskara, Gang Fu +3
The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the technique…