activity
20212026
most citedMulti-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity

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

collaborators
Showing 2023Show all

1 paper · 1 filter

math.OC2023★ 1 cited

Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization

Ziyi Chen, Yi Zhou, Yingbin Liang +1

Various optimal gradient-based algorithms have been developed for smooth nonconvex optimization. However, many nonconvex machine learning problems do not belong to the class of smo…