mlsanityData to 7 Oct 2026

Information Bottleneck: Exact Analysis of (Quantized) Neural Networks

arXiv 2106.12912 ↗First posted 24 Jun 2021cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

The information bottleneck (IB) principle has been suggested as a way to analyze deep neural networks. The learning dynamics are studied by inspecting the mutual information (MI) between the hidden layers and the input and output. Notably, separate fitting and compression phases during training have been reported. This led to some controversy including claims that the observations are not reproducible and strongly dependent on the type of activation function used as well as on the way the MI is estimated. Our study confirms that different ways of binning when computing the MI lead to qualitatively different results, either supporting or refusing IB conjectures. To resolve the controversy, we study the IB principle in settings where MI is non-trivial and can be computed exactly. We monitor the dynamics of quantized neural networks, that is, we discretize the whole deep learning system so that no approximation is required when computing the MI. This allows us to quantify the information flow without measurement errors. In this setting, we observed a fitting phase for all layers and a compression phase for the output layer in all experiments; the compression in the hidden layers was dependent on the type of activation function. Our study shows that the initial IB results were not artifacts of binning when computing the MI. However, the critical claim that the compression phase may not be observed for some networks also holds true.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 18 of its 37 references that are in the map. First posted on arXiv 24 Jun 2021.

Builds on

18 of 37 references.

References · 18

  1. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  2. 2016Deep Variational Information Bottleneckcited by 915
  3. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  4. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
  5. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
  6. 2019Theoretical Issues in Deep Networks: Approximation, Optimization and Generalizationcited by 72
  7. 2018Learning Representations for Neural Network-Based Classification Using the Information Bottleneck Principlecited by 70
  8. 2018Entropy and mutual information in models of deep neural networkscited by 50
  9. 2020On Information Plane Analyses of Neural Network Classifiers -- A Reviewcited by 35
  10. 2017Estimating Mixture Entropy with Pairwise Distancescited by 34
  11. 2018Understanding Convolutional Neural Networks with Information Theory: An Initial Explorationcited by 31
  12. 2018Scalable Mutual Information Estimation using Dependence Graphscited by 22
6 more
  1. 2019Adaptive Estimators Show Information Compression in Deep Neural Networkscited by 14
  2. 2019Information in Infinite Ensembles of Infinitely-Wide Neural Networkscited by 14
  3. 2019Information Plane Analysis of Deep Neural Networks via Matrix-Based Renyi's Entropy and Tensor Kernelscited by 11
  4. 2020What Information Does a ResNet Compress?cited by 5
  5. 2017Layer-wise Learning of Stochastic Neural Networks with Information Bottleneckcited by 4
  6. 2020Understanding Learning Dynamics of Binary Neural Networks via Information Bottleneckcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 2; 2024: 5; 2025: 3; 2026: 2.

14 papers.

Sort:

By area: