
Asymptotics for semidiscrete entropic optimal transport
We compute exact secondorder asymptotics for the cost of an optimal sol...
read it

Averaging on the BuresWasserstein manifold: dimensionfree convergence of gradient descent
We study firstorder optimization algorithms for computing the barycente...
read it

Kernel approximation on algebraic varieties
Lowrank approximation of kernels is a fundamental mathematical problem ...
read it

Wasserstein barycenters are NPhard to compute
The problem of computing Wasserstein barycenters (a.k.a. Optimal Transpo...
read it

Hardness results for Multimarginal Optimal Transport problems
Multimarginal Optimal Transport (MOT) is the problem of linear programmi...
read it

Polynomialtime algorithms for Multimarginal Optimal Transport problems with structure
Multimarginal Optimal Transport (MOT) has recently attracted significant...
read it

Highprecision Wasserstein barycenters in polynomial time
Computing Wasserstein barycenters is a fundamental geometric problem wit...
read it

Approximating MinMeanCycle for lowdiameter graphs in nearoptimal time and memory
We revisit MinMeanCycle, the classical problem of finding a cycle in a...
read it

Random Osborne: a simple, practical algorithm for Matrix Balancing in nearlinear time
We revisit Matrix Balancing, a preconditioning task used ubiquitously f...
read it
Jason M. Altschuler
is this you? claim profile