Ziyi Chen

Affiliations:
  • University of Utah, Department of Electrical and Computer Engineering, Salt Lake City, UT, USA
  • Peking University, Department of Information Science, Beijing, China


According to our database1, Ziyi Chen authored at least 20 papers between 2014 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization.
Proceedings of the International Conference on Machine Learning, 2023

2022
Multi-Agent Off-Policy TDC with Near-Optimal Sample and Communication Complexities.
Trans. Mach. Learn. Res., 2022

A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization.
CoRR, 2022

Data sampling affects the complexity of online SGD over dependent data.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Finding Correlated Equilibrium of Constrained Markov Game: A Primal-Dual Approach.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis.
Proceedings of the International Conference on Machine Learning, 2022

Sample Efficient Stochastic Policy Extragradient Algorithm for Zero-Sum Markov Game.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Escaping Saddle Points in Nonconvex Minimax Optimization via Cubic-Regularized Gradient Descent-Ascent.
CoRR, 2021

Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis.
CoRR, 2021

Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity.
CoRR, 2021

Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity.
Proceedings of the 9th International Conference on Learning Representations, 2021

Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry.
Proceedings of the 9th International Conference on Learning Representations, 2021

Multi-Agent Off-Policy TDC with Near-Optimal Sample and Communication Complexity.
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, 2021

2020
Momentum with Variance Reduction for Nonconvex Composition Optimization.
CoRR, 2020

FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2015
An Effective Model Selection Criterion for Mixtures of Gaussian Processes.
Proceedings of the Advances in Neural Networks - ISNN 2015, 2015

An MCMC Based EM Algorithm for Mixtures of Gaussian Processes.
Proceedings of the Advances in Neural Networks - ISNN 2015, 2015

The Hard-Cut EM Algorithm for Mixture of Sparse Gaussian Processes.
Proceedings of the Advanced Intelligent Computing Theories and Applications, 2015

2014
A Precise Hard-Cut EM Algorithm for Mixtures of Gaussian Processes.
Proceedings of the Intelligent Computing Methodologies - 10th International Conference, 2014


  Loading...