pith. sign in

arxiv: 1510.04609 · v1 · pith:WIQRT5AOnew · submitted 2015-10-15 · 💻 cs.CV · cs.AI· cs.LG· cs.NE

Layer-Specific Adaptive Learning Rates for Deep Networks

classification 💻 cs.CV cs.AIcs.LGcs.NE
keywords learningdeeplayerscurvaturetraininglayermethodnetworks
0
0 comments X
read the original abstract

The increasing complexity of deep learning architectures is resulting in training time requiring weeks or even months. This slow training is due in part to vanishing gradients, in which the gradients used by back-propagation are extremely large for weights connecting deep layers (layers near the output layer), and extremely small for shallow layers (near the input layer); this results in slow learning in the shallow layers. Additionally, it has also been shown that in highly non-convex problems, such as deep neural networks, there is a proliferation of high-error low curvature saddle points, which slows down learning dramatically. In this paper, we attempt to overcome the two above problems by proposing an optimization method for training deep neural networks which uses learning rates which are both specific to each layer in the network and adaptive to the curvature of the function, increasing the learning rate at low curvature points. This enables us to speed up learning in the shallow layers of the network and quickly escape high-error low curvature saddle points. We test our method on standard image classification datasets such as MNIST, CIFAR10 and ImageNet, and demonstrate that our method increases accuracy as well as reduces the required training time over standard algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Closed-Form Upper Bound for Admissible Learning-Rate Steps in Belief-Space Dynamics

    cs.LG 2026-05 unverdicted novelty 5.0

    A closed-form formula gives the maximum admissible learning-rate step size for belief-space updates to ensure contractivity under KL/Bregman geometry.