default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZiyi Chen 0002
Person information
- affiliation: University of Utah, Department of Electrical and Computer Engineering, Salt Lake City, UT, USA
- affiliation: Peking University, Department of Information Science, Beijing, China
Other persons with the same name
- Ziyi Chen — disambiguation page
- Ziyi Chen 0001
![[0000-0001-5851-2779]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-5851-2779")
— Xiamen University, Fujian Key Laboratory of Sensing and Computing for Smart Cities, China - Ziyi Chen 0003 — University of Illinois, Urbana Champaign, IL, USA
- Ziyi Chen 0004 — Beijing University of Technology, China
- Ziyi Chen 0005 — PAII Inc., Palo Alto, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c19]Zhengmian Hu, Tong Zheng, Vignesh Viswanathan, Ziyi Chen, Ryan A. Rossi, Yihan Wu, Dinesh Manocha, Heng Huang:
Towards Optimal Multi-draft Speculative Decoding. ICLR 2025- [i11]Zhengmian Hu, Tong Zheng, Vignesh Viswanathan, Ziyi Chen, Ryan A. Rossi, Yihan Wu, Dinesh Manocha, Heng Huang:
Towards Optimal Multi-draft Speculative Decoding. CoRR abs/2502.18779 (2025) - 2024
- [c18]Ziyi Chen, Yi Zhou, Heng Huang:
On the Hardness of Constrained Cooperative Multi-Agent Reinforcement Learning. ICLR 2024 - [c17]Ziyi Chen, Heng Huang:
Accelerated Policy Gradient for s-rectangular Robust MDPs with Large State Spaces. ICML 2024 - [c16]Wenhan Xian, Ziyi Chen, Heng Huang:
Delving into the Convergence of Generalized Smooth Minimax Optimization. ICML 2024 - [c15]Ziyi Chen, Yan Wen, Zhengmian Hu, Heng Huang:
Robust Reinforcement Learning with General Utility. NeurIPS 2024 - 2023
- [j2]Shaocong Ma, Ziyi Chen, Shaofeng Zou, Yi Zhou:
Decentralized Robust V-learning for Solving Markov Games with Model Uncertainty. J. Mach. Learn. Res. 24: 371:1-371:40 (2023) - [c14]Ziyi Chen, Yi Zhou, Yingbin Liang, Zhaosong Lu:
Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization. ICML 2023: 5396-5427 - 2022
- [j1]Ziyi Chen, Yi Zhou, Rong-Rong Chen:
Multi-Agent Off-Policy TDC with Near-Optimal Sample and Communication Complexities. Trans. Mach. Learn. Res. 2022 (2022) - [c13]Ziyi Chen, Shaocong Ma, Yi Zhou:
Sample Efficient Stochastic Policy Extragradient Algorithm for Zero-Sum Markov Game. ICLR 2022 - [c12]Ziyi Chen, Yi Zhou, Rong-Rong Chen, Shaofeng Zou:
Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis. ICML 2022: 3794-3834 - [c11]Ziyi Chen, Shaocong Ma, Yi Zhou:
Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning. ISIT 2022: 672-677 - [c10]Ziyi Chen, Shaocong Ma, Yi Zhou:
Finding Correlated Equilibrium of Constrained Markov Game: A Primal-Dual Approach. NeurIPS 2022 - [c9]Shaocong Ma, Ziyi Chen, Yi Zhou, Kaiyi Ji, Yingbin Liang:
Data sampling affects the complexity of online SGD over dependent data. UAI 2022: 1296-1305 - [i10]Ziyi Chen, Bhavya Kailkhura, Yi Zhou:
A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization. CoRR abs/2203.16615 (2022) - [i9]Shaocong Ma, Ziyi Chen, Yi Zhou, Kaiyi Ji, Yingbin Liang:
Data Sampling Affects the Complexity of Online SGD over Dependent Data. CoRR abs/2204.00006 (2022) - 2021
- [c8]Ziyi Chen, Yi Zhou, Rongrong Chen:
Multi-Agent Off-Policy TDC with Near-Optimal Sample and Communication Complexity. ACSCC 2021: 504-508 - [c7]Ziyi Chen, Yi Zhou, Tengyu Xu, Yingbin Liang:
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry. ICLR 2021 - [c6]Shaocong Ma, Ziyi Chen, Yi Zhou, Shaofeng Zou:
Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity. ICLR 2021 - [i8]Ziyi Chen, Yi Zhou, Tengyu Xu, Yingbin Liang:
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry. CoRR abs/2102.04653 (2021) - [i7]Ziyi Chen, Yi Zhou, Rongrong Chen:
Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity. CoRR abs/2103.13147 (2021) - [i6]Shaocong Ma, Ziyi Chen, Yi Zhou, Shaofeng Zou:
Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity. CoRR abs/2103.16377 (2021) - [i5]Ziyi Chen, Yi Zhou, Rongrong Chen, Shaofeng Zou:
Sample and Communication-Efficient Decentralized Actor-Critic Algorithms with Finite-Time Analysis. CoRR abs/2109.03699 (2021) - [i4]Ziyi Chen, Qunwei Li, Yi Zhou:
Escaping Saddle Points in Nonconvex Minimax Optimization via Cubic-Regularized Gradient Descent-Ascent. CoRR abs/2110.07098 (2021) - [i3]Ziyi Chen, Shaocong Ma, Yi Zhou:
Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning. CoRR abs/2112.11663 (2021) - 2020
- [c5]Cheng Chen, Ziyi Chen, Yi Zhou, Bhavya Kailkhura:
FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling. IEEE BigData 2020: 5017-5026 - [i2]Ziyi Chen, Yi Zhou:
Momentum with Variance Reduction for Nonconvex Composition Optimization. CoRR abs/2005.07755 (2020) - [i1]Cheng Chen, Ziyi Chen, Yi Zhou, Bhavya Kailkhura:
FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling. CoRR abs/2009.10748 (2020)
2010 – 2019
- 2015
- [c4]Ziyi Chen, Jinwen Ma:
The Hard-Cut EM Algorithm for Mixture of Sparse Gaussian Processes. ICIC (3) 2015: 13-24 - [c3]Di Wu, Ziyi Chen, Jinwen Ma:
An MCMC Based EM Algorithm for Mixtures of Gaussian Processes. ISNN 2015: 327-334 - [c2]Longbo Zhao, Ziyi Chen, Jinwen Ma:
An Effective Model Selection Criterion for Mixtures of Gaussian Processes. ISNN 2015: 345-354 - 2014
- [c1]Ziyi Chen, Jinwen Ma, Yatong Zhou:
A Precise Hard-Cut EM Algorithm for Mixtures of Gaussian Processes. ICIC (2) 2014: 68-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-24 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
