Semantic Information G Theory for Range Control with Tradeoff between Purposiveness and Efficiency
Not on the map. Why?
Abstract (arXiv)
Recent advances in deep learning suggest that we need to maximize and minimize two different kinds of information simultaneously. The Information Max-Min (IMM) method has been used in deep learning, reinforcement learning, and maximum entropy control. Shannon's information rate-distortion function is the theoretical basis of Minimizing Mutual Information (MMI) and data compression, but it is not enough to solve the IMM problem. The author has proposed the semantic information G theory (i.e., Shannon-Lu theory), including the semantic information G measure and the information rate fidelity function R(G) (R is the MMI for the given G of semantic mutual information). The parameter solution of the R(G) function provides a general method to improve the information efficiency, G/R. This paper briefly introduces the semantic information G measure and the parametric solution of the R(G) function. Two examples reveal that the parametric solution can help us optimize range control with the tradeoff between purposiveness (i.e., semantic mutual information) and information efficiency. It seems that the R(G) function can serve as the theoretical basis of IMM methods, but we still need further research in combination with deep learning, reinforcement learning, and constraint control.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 29 references that are in the map. First posted on arXiv 19 Oct 2024.
Builds on
7 of 29 references.
References · 7
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2019On Mutual Information Maximization for Representation Learningcited by 316
- 2021A Max-Min Entropy Framework for Reinforcement Learningcited by 28
- 2018Semantic Information G Theory and Logical Bayesian Inference for Machine Learningcited by 6
- 2021Understanding and Accelerating EM Algorithm's Convergence by Fair Competition Principle and Rate-Verisimilitude Functioncited by 2
- 2023Reviewing Evolution of Learning Functions and Semantic Information Measures for Understanding Deep Learningcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Semantic Variational Bayes Based on Semantic Information G Theory for Solving Latent Variables
- 2021Information Bottleneck: Exact Analysis of (Quantized) Neural Networks
- 2026Why Semantic Entropy Fails: Geometry-Aware and Calibrated Uncertainty for Policy Optimization
- 2025On Policy Stochasticity in Mutual Information Optimal Control of Linear Systems
- 2026Mixture-of-Experts under Finite-Rate Gating: Communication--Generalization Trade-offs
- 2023Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression
- 2025Rethinking GSPO: The Perplexity-Entropy Equivalence
- 2022IRL with Partial Observations using the Principle of Uncertain Maximum Entropy