Statistical Physics of Deep Neural Networks: Initialization toward Optimal Channels
Not on the map. Why?
Abstract (arXiv)
In deep learning, neural networks serve as noisy channels between input data and its representation. This perspective naturally relates deep learning with the pursuit of constructing channels with optimal performance in information transmission and representation. While considerable efforts are concentrated on realizing optimal channel properties during network optimization, we study a frequently overlooked possibility that neural networks can be initialized toward optimal channels. Our theory, consistent with experimental validation, identifies primary mechanics underlying this unknown possibility and suggests intrinsic connections between statistical physics and deep learning. Unlike the conventional theories that characterize neural networks applying the classic mean-filed approximation, we offer analytic proof that this extensively applied simplification scheme is not valid in studying neural networks as information channels. To fill this gap, we develop a corrected mean-field framework applicable for characterizing the limiting behaviors of information propagation in neural networks without strong assumptions on inputs. Based on it, we propose an analytic theory to prove that mutual information maximization is realized between inputs and propagated signals when neural networks are initialized at dynamic isometry, a case where information transmits via norm-preserving mappings. These theoretical predictions are validated by experiments on real neural networks, suggesting the robustness of our theory against finite-size effects. Finally, we analyze our findings with information bottleneck theory to confirm the precise relations among dynamic isometry, mutual information maximization, and optimal channel properties in deep learning.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 39 of its 78 references that are in the map. First posted on arXiv 4 Dec 2022.
Builds on
39 of 78 references.
References · 39
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2019Contrastive Multiview Codingcited by 1,297
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2016Deep Variational Information Bottleneckcited by 915
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
27 more
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2017Representation Learning on Graphs: Methods and Applicationscited by 456
- 2019On Mutual Information Maximization for Representation Learningcited by 315
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2016Deep Information Propagationcited by 194
- 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
- 2018Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processescited by 164
- 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 148
- 2018Deep Convolutional Networks as shallow Gaussian Processescited by 137
- 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
- 2018State Representation Learning for Control: An Overviewcited by 125
- 2018Deep Metric Learning with Hierarchical Triplet Losscited by 112
- 2017Mean Field Residual Networks: On the Edge of Chaoscited by 83
- 2018The Emergence of Spectral Universality in Deep Networkscited by 74
- 2020Statistical Mechanics of Deep Linear Neural Networks: The Back-Propagating Kernel Renormalizationcited by 71
- 2021Nondeterminism and Instability in Neural Network Optimizationcited by 47
- 2018Dynamical Isometry and a Mean Field Theory of RNNs: Gating Enables Signal Propagation in Recurrent Neural Networkscited by 44
- 2019Mean Field Analysis of Deep Neural Networkscited by 42
- 2019Mean Field Limit of the Learning Dynamics of Multilayer Neural Networkscited by 25
- 2022Neural Tangent Kernel: A Surveycited by 22
- 2019Nonparametric Density Estimation for High-Dimensional Data - Algorithms and Applicationscited by 18
- 2019Dynamical Isometry and a Mean Field Theory of LSTMs and GRUscited by 17
- 2017Gaussian Lower Bound for the Information Bottleneck Limitcited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.