18 citations · 59 across the 19 of their papers we have counts for
7 papers · 1 filter
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization
Tianyi Lin, Zeyu Zheng, Michael I. Jordan
Nonsmooth nonconvex optimization problems broadly emerge in machine learning and business decision making, whereas two core challenges impede the development of efficient solution…
Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
Tianyi Lin, Panayotis Mertikopoulos, Michael I. Jordan
We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to…
On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization
Michael I. Jordan, Tianyi Lin, Manolis Zampetakis
In this paper, we present several new results on minimizing a nonsmooth and nonconvex function under a Lipschitz condition. Recent work shows that while the classical notion of Cla…
A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
Tianyi Lin, Michael. I. Jordan
We propose a new framework to design and analyze accelerated methods that solve general monotone equation (ME) problems . Traditional approaches include generalized steepes…
First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces
Michael I. Jordan, Tianyi Lin, Emmanouil-Vasileios Vlatakis-Gkaragkounis
From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds.…
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
Tianyi Lin, Aldo Pacchiano, Yaodong Yu +1
Motivated by applications to online learning in sparse estimation and Bayesian optimization, we consider the problem of online unconstrained nonsubmodular minimization with delayed…
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems
Michael I. Jordan, Tianyi Lin, Manolis Zampetakis
We consider the problem of computing an equilibrium in a class of \textit{nonlinear generalized Nash equilibrium problems (NGNEPs)} in which the strategy sets for each player are d…