Learning Gradient Descent: Better Generalization and Longer Horizons

Kaifeng Lv, Shunhua Jiang, Jian Li
3/10/2017
cs.LGcs.AI

Official code: vfleaking/rnnprop (36 stars, MIT, last commit 2017-03-10).

Abstract

Training deep neural networks is a highly nontrivial task, involving carefully selecting appropriate training algorithms, scheduling step sizes and tuning other hyperparameters. Trying different combinations can be quite labor-intensive and time consuming. Recently, researchers have tried to use deep learning algorithms to exploit the landscape of the loss function of the training problem of interest, and learn how to optimize over it in an automatic way. In this paper, we propose a new learning-to-learn model and some useful and practical tricks. Our optimizer outperforms generic, hand-crafted optimization algorithms and state-of-the-art learning-to-learn optimizers by DeepMind in many tasks. We demonstrate the effectiveness of our algorithms on a number of tasks, including deep MLPs, CNNs, and simple LSTMs.

View on arXivView PDF

Code Implementations(1)

vfleaking/rnnpropOfficial100%
MIT

RNNprop

368PythonMar 9, 20179 years agoMIT

Similar Papers

Cite this paper

@article{lv2017learning,
  title  = {Learning Gradient Descent: Better Generalization and Longer Horizons},
  author = {Kaifeng Lv and Shunhua Jiang and Jian Li},
  year   = {2017},
  eprint = {1703.03633},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1703.03633}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1703.03633.svg)](https://codeofpaper.com/paper/1703.03633)

Discussion