8 citations · 18 across the 4 of their papers we have counts for
4 papers
Data Sampling Affects the Complexity of Online SGD over Dependent Data
Shaocong Ma, Ziyi Chen, Yi Zhou +2
Conventional machine learning applications typically assume that data samples are independently and identically distributed (i.i.d.). However, practical scenarios often involve a d…
Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity
Shaocong Ma, Ziyi Chen, Yi Zhou +1
Greedy-GQ is a value-based reinforcement learning (RL) algorithm for optimal control. Recently, the finite-time analysis of Greedy-GQ has been developed under linear function appro…
Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity
Ziyi Chen, Yi Zhou, Rongrong Chen
The finite-time convergence of off-policy TD learning has been comprehensively studied recently. However, such a type of convergence has not been well established for off-policy TD…
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry
Ziyi Chen, Yi Zhou, Tengyu Xu +1
The gradient descent-ascent (GDA) algorithm has been widely applied to solve minimax optimization problems. In order to achieve convergent policy parameters for minimax optimizatio…