Feature Whitening via Gradient Transformation for Improved Convergence
Shmulik Markovich-Golan, Barak Battash, Amit Bleiweiss

TL;DR
This paper introduces a computationally efficient feature whitening method for deep neural networks that improves convergence speed and accuracy, especially in distributed training scenarios.
Contribution
It proposes a new whitening technique that reduces complexity and a recursive algorithm to enhance convergence, demonstrated on ResNet models for image classification.
Findings
Enhanced convergence speed and accuracy in experiments
Complexity reduction by a factor of 2B for the whitening transformation
Effective in distributed training environments
Abstract
Feature whitening is a known technique for speeding up training of DNN. Under certain assumptions, whitening the activations reduces the Fisher information matrix to a simple identity matrix, in which case stochastic gradient descent is equivalent to the faster natural gradient descent. Due to the additional complexity resulting from transforming the layer inputs and their corresponding gradients in the forward and backward propagation, and from repeatedly computing the Eigenvalue decomposition (EVD), this method is not commonly used to date. In this work, we address the complexity drawbacks of feature whitening. Our contribution is twofold. First, we derive an equivalent method, which replaces the sample transformations by a transformation to the weight gradients, applied to every batch of B samples. The complexity is reduced by a factor of S=(2B), where S denotes the feature dimension…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · Face and Expression Recognition
