Batch Normalization Orthogonalizes Representations in Deep Random NetworksDownload PDF

21 May 2021, 20:49 (edited 22 Jan 2022)NeurIPS 2021 SpotlightReaders: Everyone
  • Keywords: Batch normalization, Theory of deep neural networks, Markov chains, Random Neural Networks, Optimization for neural networks
  • TL;DR: We prove that successive batch normalizations, together with random linear layers, incrementally orthogonalize representations of samples.
  • Abstract: This paper underlines an elegant property of batch-normalization (BN): Successive batch normalizations with random linear updates make samples increasingly orthogonal. We establish a non-asymptotic characterization of the interplay between depth, width, and the orthogonality of deep representations. More precisely, we prove, under a mild assumption, the deviation of the representations from orthogonality rapidly decays with depth up to a term inversely proportional to the network width. This result has two main theoretical and practical implications: 1) Theoretically, as the depth grows, the distribution of the outputs contracts to a Wasserstein-2 ball around an isotropic normal distribution. Furthermore, the radius of this Wasserstein ball shrinks with the width of the network. 2) Practically, the orthogonality of the representations directly influences the performance of stochastic gradient descent (SGD). When representations are initially aligned, we observe SGD wastes many iterations to disentangle representations before the classification. Nevertheless, we experimentally show that starting optimization from orthogonal representations is sufficient to accelerate SGD, with no need for BN.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/hadidaneshmand/batchnorm21
14 Replies

Loading