A proximal gradient algorithm for weight decay training in neural networks

A Better Way to Decay: Proximal Gradient Training Algorithms for Neural Nets

Weight decay is one of the most widely used forms of regularization in deep learning, and has been shown to improve generalization and robustness.This paper argues that stochastic gradient descent (sgd) may be an inefficient algorithm for this objective.For neural networks with relu activations, solutions to the weight decay objective are equivalent to those of a different objective in which the regularization term is instead a sum of products of products of (not squared) norms of the inputand output weights associated each relu.This alternative (and effectively equivalent) regularization suggests a novel proximal gradient algorithm for network training.Theory and experiments support the new training approach, showing that it can converge much faster to the sparse solutions it shares with standard weight decay training.