A Practical & Unified Notation for Information-Theoretic Quantities in ML
This work provides a clearer notation for researchers in machine learning, but it is incremental as it builds on existing concepts without introducing new methods.
The authors tackled the problem of opaque notation for information-theoretic quantities in machine learning by proposing a practical and unified notation, and they applied it to rederive results like the evidence lower bound for variational auto-encoders and extend an acquisition function for Bayesian active learning.
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.