Guanghui Wang
Cited by: 0|Bibtex|Views36

Abstract:

The Adam algorithm has become extremely popular for large-scale machine learning. Under convexity condition, it has been proved to enjoy a data-dependant $O(\sqrt{T})$ regret bound where $T$ is the time horizon. However, whether strong convexity can be utilized to further improve the performance remains an open problem. In this paper, w...More

Code:

Data:

Full Text