most citedStochastic Recursive Momentum Method for Non-Convex Compositional Optimization

8 citations · 13 across the 3 of their papers we have counts for

collaborators

5 papers

math.OC2022★ 1 cited

Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization

Chris Junchi Li, Angela Yuan, Gauthier Gidel +2

We propose a new first-order optimization algorithm -- AcceleratedGradient-OptimisticGradient (AG-OG) Descent Ascent -- for separable convex-concave minimax optimization. The main…

math.OC2020★ 8 cited

Stochastic Recursive Momentum Method for Non-Convex Compositional Optimization

Huizhuo Yuan, Wenqing Hu

We propose a novel stochastic optimization algorithm called STOchastic Recursive Momentum for Compositional (STORM-Compositional) optimization that minimizes the composition of exp…

stat.ML2020

Stochastic Recursive Momentum for Policy Gradient Methods

Huizhuo Yuan, Xiangru Lian, Ji Liu +1

In this paper, we propose a novel algorithm named STOchastic Recursive Momentum for Policy Gradient (STORM-PG), which operates a SARAH-type stochastic recursive variance-reduced po…

math.OC2020

Stochastic Modified Equations for Continuous Limit of Stochastic ADMM

Xiang Zhou, Huizhuo Yuan, Chris Junchi Li +1

Stochastic version of alternating direction method of multiplier (ADMM) and its variants (linearized ADMM, gradient-based ADMM) plays a key role for modern large scale machine lear…

stat.ML2020★ 4 cited

Stochastic Recursive Variance Reduction for Efficient Smooth Non-Convex Compositional Optimization

Huizhuo Yuan, Xiangru Lian, Ji Liu

Stochastic compositional optimization arises in many important machine learning tasks such as value function evaluation in reinforcement learning and portfolio management. The obje…