A Reverse Jensen Inequality Result with Application to Mutual Information Estimation
Not on the map. Why?
Abstract (arXiv)
The Jensen inequality is a widely used tool in a multitude of fields, such as for example information theory and machine learning. It can be also used to derive other standard inequalities such as the inequality of arithmetic and geometric means or the H"older inequality. In a probabilistic setting, the Jensen inequality describes the relationship between a convex function and the expected value. In this work, we want to look at the probabilistic setting from the reverse direction of the inequality. We show that under minimal constraints and with a proper scaling, the Jensen inequality can be reversed. We believe that the resulting tool can be helpful for many applications and provide a variational estimation of mutual information, where the reverse inequality leads to a new estimator with superior training behavior compared to current estimators.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 9 of its 28 references that are in the map. First posted on arXiv 12 Nov 2021.
Builds on
9 of 28 references.
References · 9
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
- 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
- 2014Efficient Estimation of Mutual Information for Strongly Dependent Variablescited by 46
- 2016Demystifying Fixed k-Nearest Neighbor Information Estimatorscited by 14
- 2019Deep Learning for Channel Coding via Neural Mutual Information Estimationcited by 14
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 2.
5 papers.
- 2023MINDE: Mutual Information Neural Diffusion Estimationcited by 31
- 2023Generalization Bounds for Label Noise Stochastic Gradient Descentcited by 3
- 2025INFO-SEDD: Continuous Time Markov Chains as Scalable Information Metrics Estimatorscited by 2
- 2025Information Consistent Pruning: How to Efficiently Search for Sparse Networks?cited by 1
- 2022A Perspective on Neural Capacity Estimation: Viability and Reliabilitycited by 0
- 2025INFO-SEDD: Continuous Time Markov Chains as Scalable Information Metrics Estimators26 Feb 2025
- 2025Information Consistent Pruning: How to Efficiently Search for Sparse Networks?26 Jan 2025
- 2023Generalization Bounds for Label Noise Stochastic Gradient Descent1 Nov 2023
- 2023MINDE: Mutual Information Neural Diffusion Estimation13 Oct 2023
- 2022A Perspective on Neural Capacity Estimation: Viability and Reliability22 Mar 2022