activity
20152025
most citedEfficient Algorithms for Smooth Minimax Optimization

29 citations · 74 across the 13 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC20241 cited

A Sinkhorn-type Algorithm for Constrained Optimal Transport

Xun Tang, Holakou Rahmanian, Michael Shavlovsky +3

Entropic optimal transport (OT) and the Sinkhorn algorithm have made it practical for machine learning practitioners to perform the fundamental task of calculating transport distan…

math.OC2024

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations

Xun Tang, Michael Shavlovsky, Holakou Rahmanian +4

Computing the optimal transport distance between statistical distributions is a fundamental task in machine learning. One remarkable recent advancement is entropic regularization a…

math.OC20226 cited

Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization

Kiran Koshy Thekumparampil, Niao He, Sewoong Oh

We study the bilinearly coupled minimax problem: , where and are both strongly convex smooth functions and admit first-order gra…

math.OC20207 cited

Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method

Kiran Koshy Thekumparampil, Prateek Jain, Praneeth Netrapalli +1

We consider the classical setting of optimizing a nonsmooth Lipschitz continuous convex function over a convex constraint set, when having access to a (stochastic) first-order orac…

math.OC201929 cited

Efficient Algorithms for Smooth Minimax Optimization

Kiran Koshy Thekumparampil, Prateek Jain, Praneeth Netrapalli +1

This paper studies first order methods for solving smooth minimax optimization problems where is smooth and is concave for each…