183 citations · 474 across the 30 of their papers we have counts for
6 papers · 1 filter
A Control-Theoretic Perspective on Optimal High-Order Optimization
Tianyi Lin, Michael. I. Jordan
We provide a control-theoretic perspective on optimal tensor algorithms for minimizing a convex function in a finite-dimensional Euclidean space. Given a function $Φ: \mathbb{R}^d…
On the Complexity of Approximating Multimarginal Optimal Transport
Tianyi Lin, Nhat Ho, Marco Cuturi +1
We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here between $…
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
Tianyi Lin, Nhat Ho, Michael I. Jordan
We present several new complexity results for the entropic regularized algorithms that approximately solve the optimal transport (OT) problem between two discrete probability measu…
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
Tianyi Lin, Chi Jin, Michael I. Jordan
We consider nonconvex-concave minimax problems, , where is nonconvex in but concave…
On Structured Filtering-Clustering: Global Error Bound and Optimal First-Order Algorithms
Nhat Ho, Tianyi Lin, Michael I. Jordan
The filtering-clustering models, including trend filtering and convex clustering, have become an important source of ideas and modeling tools in machine learning and related fields…
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
Tianyi Lin, Nhat Ho, Michael I. Jordan
We provide theoretical analyses for two algorithms that solve the regularized optimal transport (OT) problem between two discrete probability measures with at most atoms. We sh…