Entropy, Information, and the Updating of Probabilities
Not on the map. Why?
Abstract (arXiv)
This paper is a review of a particular approach to the method of maximum entropy as a general framework for inference. The discussion emphasizes the pragmatic elements in the derivation. An epistemic notion of information is defined in terms of its relation to the Bayesian beliefs of ideally rational agents. The method of updating from a prior to a posterior probability distribution is designed through an eliminative induction process. The logarithmic relative entropy is singled out as the unique tool for updating that (a) is of universal applicability; (b) that recognizes the value of prior information; and (c) that recognizes the privileged role played by the notion of independence in science. The resulting framework -- the ME method -- can handle arbitrary priors and arbitrary constraints. It includes MaxEnt and Bayes' rule as special cases and, therefore, it unifies entropic and Bayesian methods into a single general inference scheme. The ME method goes beyond the mere selection of a single posterior, but also addresses the question of how much less probable other distributions might be, which provides a direct bridge to the theories of fluctuations and large deviations.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 1 of its 59 references that are in the map. First posted on arXiv 9 Jul 2021.
Builds on
1 of 59 references.
References · 1
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 2.
4 papers.
- 2026Active Inference for Physical AI Agents -- An Engineering Perspective21 Mar 2026
- 2026Bayesian Hierarchical Models and the Maximum Entropy Principle10 Mar 2026
- 2025Generalized Derangetropy Functionals for Modeling Cyclical Information Flow20 Apr 2025
- 2024Active Diffusion Subsampling20 Jun 2024