Yanli Liu

Orcid: 0000-0001-6584-1378

Affiliations:
  • University of California, Los Angeles, CA, USA


According to our database1, Yanli Liu authored at least 10 papers between 2017 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Decentralized Learning With Lazy and Approximate Dual Gradients.
IEEE Trans. Signal Process., 2021

Acceleration of Primal-Dual Methods by Preconditioning and Simple Subproblem Procedures.
J. Sci. Comput., 2021

2020
An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

An Improved Analysis of Stochastic Gradient Descent with Momentum.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs.
Math. Program., 2019

An Envelope for Davis-Yin Splitting and Strict Saddle-Point Avoidance.
J. Optim. Theory Appl., 2019

Douglas-Rachford splitting and ADMM for pathological convex optimization.
Comput. Optim. Appl., 2019

Acceleration of SVRG and Katyusha X by Inexact Preconditioning.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Breaking the Span Assumption Yields Fast Finite-Sum Minimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
A New Use of Douglas-Rachford Splitting and ADMM for Identifying Infeasible, Unbounded, and Pathological Conic Programs.
CoRR, 2017


  Loading...