Variants Of Rmsprop And Adagrad With Logarithmic Regret Bounds
ASecurity
**arXiv ID:** 1706.05507 **Authors:** Mahesh Chandra Mukkamala, Matthias Hein **Published:** 2017-06-17T09:48:55Z **Abstract:** Adaptive gradient methods have become recently very popular, in particular as they have been shown to be useful in the training of deep neural networks. In this paper we have analyzed RMSProp, originally proposed for the training of deep neural networks, in the context of online convex optimization and show $\sqrt{T}$-type regret bounds. Moreover, we propose two vari...
Installs into .claude/skills of the current project.
Sponsors
SSkills DirectorySkills Directory
Know which skills are safe — weekly.
SSkills DirectorySkills Directory
Is that skill safe to install?
Are you the author of Variants Of Rmsprop And Adagrad With Logarithmic Regret Bounds?
Add the live security badge to your README. It updates with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-variants-of-rmsprop-and-adagrad-with-logarithmic-r)
# Variants of RMSProp and Adagrad with Logarithmic Regret Bounds
**arXiv ID:** 1706.05507
**Authors:** Mahesh Chandra Mukkamala, Matthias Hein
**Published:** 2017-06-17T09:48:55Z
**Abstract:**
Adaptive gradient methods have become recently very popular, in particular as they have been shown to be useful in the training of deep neural networks. In this paper we have analyzed RMSProp, originally proposed for the training of deep neural networks, in the context of online convex optimization and show $\sqrt{T}$-type regret bounds. Moreover, we propose two variants SC-Adagrad and SC-RMSProp for which we show logarithmic regret bounds for strongly convex functions. Finally, we demonstrate in the experiments that these new variants outperform other adaptive gradient techniques or stochastic gradient descent in the optimization of strongly convex functions as well as in training of deep neural networks.
## Skill Description
This skill is generated from the arXiv paper: Variants of RMSProp and Adagrad with Logarithmic Regret Bounds (1706.05507).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:1706.05507](http://arxiv.org/abs/1706.05507v2)