Minimal Effort Back Propagation for Convolutional Neural Networks

Abstract

As traditional neural network consumes a significant amount of computing resources during back propagation, \citet{Sun2017mePropSB} propose a simple yet effective technique to alleviate this problem. In this technique, only a small subset of the full gradients are computed to update the model parameters. In this paper we extend this technique into the Convolutional Neural Network(CNN) to reduce calculation in back propagation, and the surprising results verify its validity in CNN: only 5\% of the gradients are passed back but the model still achieves the same effect as the traditional CNN, or even better. We also show that the top-$k$ selection of gradients leads to a sparse calculation in back propagation, which may bring significant computational benefits for high computational complexity of convolution operation in CNN.

References in corpus (1)

• Adam: A Method for Stochastic Optimization

Cited by in corpus (8)

• Memorized Sparse Backpropagation
• Sparse Weight Activation Training
• Accelerating CNN Training by Pruning Activation Gradients
• Randomized Automatic Differentiation
• Automatic Academic Paper Rating Based on Modularized Hierarchical Convolutional Neural Network
• Advancing On-Device Neural Network Training with TinyPropv2: Dynamic, Sparse, and Efficient Backpropagation
• Dynamic Collective Intelligence Learning: Finding Efficient Sparse Model via Refined Gradients for Pruned Weights
• Accelerated CNN Training Through Gradient Approximation