The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
Open accessAbstract
Jaynes's principle of maximum entropy and Kullbacks principle of minimum cross-entropy (minimum directed divergence) are shown to be uniquely correct methods for inductive inference when new information is given in the form of expected values. Previous justifications use intuitive arguments and rely on the properties of entropy and cross-entropy as information measures. The approach here assumes that reasonable methods of inductive inference should lead to consistent results when there are different ways of taking the same information into account (for example, in different coordinate system). This requirement is formalized as four consistency axioms. These are stated in terms of an abstract information operator and make no reference to information measures. It is proved that the principle of maximum entropy is correct in the following sense: maximizing any function but entropy will lead to inconsistency unless that function and entropy have identical maxima. In other words given information in the form of constraints on expected values, there is only one (distribution satisfying the constraints that can be chosen by a procedure that satisfies the consistency axioms; this unique distribution can be obtained by maximizing entropy. This result is established both directly and as a special case (uniform priors) of an analogous result for the principle of minimum cross-entropy. Results are obtained both for continuous probability densities and for discrete distributions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Information Theory and Statistical Mechanics. II
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.108.171 · Cited by 3,253
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Cited by
Fraassen, B. C. V. (1989) · doi:10.1093/0198248601.001.0001 · Cited by 1,821
An Intrusion Detection System Using a Deep Neural Network With Gated Recurrent Units
Xu, C., Shen, J., Du, X., & Zhang, F. (2018) · IEEE Access · doi:10.1109/access.2018.2867564 · Cited by 339
From Laplace to Supernova SN 1987A: Bayesian Inference in Astrophysics
Loredo, T. J. (1990) · Maximum Entropy and Bayesian Methods · doi:10.1007/978-94-009-0683-9_6 · Cited by 168
Robustness in Experiment Design
Rojas, C. R., Aguero, J.-C., Welsh, J. S., Goodwin, G. C., & Feuer, A. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2166294 · Cited by 27
A probability measure for FLRW models
Kirchner, U., & Ellis, G. F. R. (2003) · Classical and Quantum Gravity · doi:10.1088/0264-9381/20/6/311 · Cited by 15
Metadata
- Authors
- Shore, J., & Johnson, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1980-01
- Volume
- 26
- Issue
- 1
- Pages
- 26-37
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2052958516
- Cited by
- 1,774
- References
- 4
- FWCI
- 15.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. https://app.cochat.ai/papers/10.1109/tit.1980.1056144
- The paper
- Shore, J., & Johnson, R. (1980). Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1980.1056144
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.