mlsanityData to 13 Oct 2026

A Practical & Unified Notation for Information-Theoretic Quantities in ML

arXiv 2106.12062 ↗First posted 22 Jun 2021cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

A practical notation can convey valuable intuitions and concisely express new ideas. Information theory is of importance to machine learning, but the notation for information-theoretic quantities is sometimes opaque. We propose a practical and unified notation and extend it to include information-theoretic quantities between observed outcomes (events) and random variables. This includes the point-wise mutual information known in NLP and mixed quantities such as specific surprise and specific information in the cognitive sciences and information gain in Bayesian optimal experimental design. We apply our notation to prove a version of Stirling's approximation for binomial coefficients mentioned by MacKa (2003) using new intuitions. We also concisely rederive the evidence lower bound for variational auto-encoders and variational inference in approximate Bayesian neural networks. Furthermore, we apply the notation to a popular information-theoretic acquisition function in Bayesian active learning which selects the most informative (unlabelled) samples to be labelled by an expert and extend this acquisition function to the core-set problem with the goal of selecting the most informative samples given the labels.

Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 9 of its 29 references that are in the map. First posted on arXiv 22 Jun 2021.

Builds on

9 of 29 references.

References · 9

  1. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,430
  2. 2017Deep Bayesian Active Learning with Image Datacited by 816
  3. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  4. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 497
  5. 2015Variational Dropout and the Local Reparameterization Trickcited by 490
  6. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 430
  7. 2020A Theory of Usable Information Under Computational Constraintscited by 156
  8. 2019Variational Bayesian Optimal Experimental Designcited by 116
  9. 2020Unpacking Information Bottlenecks: Unifying Information-Theoretic Objectives in Deep Learningcited by 16

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 1.

4 papers.