资源分类
》 资源 》论文》Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks

Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks

2019-10-29 | |  67 |   33 |   0
Abstract Adaptive learning rate algorithms such as RMSProp are widely used for training deep neural networks. RMSProp offers efficient training since it uses first order gradients to approximate Hessianbased preconditioning. However, since the first order gradients include noise caused by stochastic optimization, the approximation may be inaccurate. In this paper, we propose a novel adaptive learning rate algorithm called SDProp. Its key idea is effective handling of the noise by preconditioning based on covariance matrix. For various neural networks, our approach is more efficient and effective than RMSProp and its variant

上一篇：A Novel Symbolic Approach to Verifying Epistemic Properties of Programs

下一篇：An Admissible HTN Planning Heuristic

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...