The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the rationale of maximum-entropy methods
Abstract
We discuss the relations between maximum-entropy (MAXENT) and other methods of spectral analysis such as the Schuster, Blackman-Tukey, maximum-likelihood, Bayesian, and Autoregressive (AR, ARMA, or ARIMA) models, emphasizing that they are not in conflict, but rather are appropriate in different problems. We conclude that: 1) "Orthodox" sampling theory methods are useful in problems where we have a known model (sampling distribution) for the properties of the noise, but no appreciable prior information about the quantities being estimated. 2) MAXENT is optimal in problems where we have prior information about multiplicities, but no noise. 3) The full Bayesian solution includes both of these as special cases and is needed in problems where we have both prior information and noise. 4) AR models are in one sense a special case of MAXENT, but in another sense they are ubiquitous in all spectral analysis problems with discrete time series. 5) Empirical methods such as Blackman-Tukey, which do not invoke even a likelihood function, are useful in the preliminary, exploratory phase of a problem where our knowledge is sufficient to permit intuitive judgments about how to organize a calculation (smoothing, decimation, windows, prewhitening, padding with zeroes, etc.) but insufficient to set up a quantitative model which would do the proper things for us automatically and optimally.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Under mild conditions (Wainwright et al., 2008) -A * (µ) = H(P µ ) where P µ is the maximum entropy distribution out of all distributions satisfying E y∼Pµ [t(y)] = µ (Jaynes, 1982), and H(•) is the Shannon entropy.”
From A Theory of Usable Information Under Computational Constraints (2020) · cites this paper as Jaynes, 1982
Citations
Cites
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Self-citation
Research works printed but not linked: 15
- kay, 1979, Rec IEEE ICASSP, 151
- 10.1038/2251196a0 · DOI
- schr�dinger, 1948, Statistical Thermodynamics
- 10.1109/TIT.1971.1054660 · DOI
- 10.1109/TIT.1981.1056374 · DOI
- zubarev, 1974, Nonequlibrium Statistical Thermodynamics
- gull, 1980, The maximum entropy algorithm applied to image enhancement, IEEE, 5, 170
- 10.1038/272686a0 · DOI
- 10.1146/annurev.pc.31.100180.003051 · DOI
- 1978, The Maximum Entropy Formalism, 15
- 10.1029/JA082i007p01051 · DOI
- burg, 1967, Maximum entropy spectral analysis, Proc 37th Meet Soc Exploration Geophysicists
- 1982, Papers on Probability Statistics and Statistical Physics
- 10.1109/TSSC.1968.300117 · DOI
- 1976, Concepts and Applications of Modern Decision Models
Cited by
Sorted by citations
Novel methods improve prediction of species’ distributions from occurrence data
Elith*, J., H. Graham*, C., P. Anderson, R., Dudík, M., Ferrier, S., Guisan, A., J. Hijmans, R., Huettmann, F., R. Leathwick, J., Lehmann, A., et al. (2006) · Ecography · doi:10.1111/j.2006.0906-7590.04596.x · Cited by 9,088
A Theory of Usable Information Under Computational Constraints
Xu, Y., Zhao, S., Song, J., Stewart, R., & Ermon, S. (2020) · arXiv · doi:10.48550/arxiv.2002.10689 · Cited by 142
Neural coding and decoding: communication channels and quantization
Dimitrov, A. G., & Miller, J. P. (2001) · Network: Computation in Neural Systems · doi:10.1080/net.12.4.441.472 · Cited by 76
Machine learning for high-dimensional dynamic stochastic economies
Scheidegger, S., & Bilionis, I. (2019) · Journal of Computational Science · doi:10.1016/j.jocs.2019.03.004 · Cited by 72
A measure of survey mode differences
Homola, J., Jackson, N., & Gill, J. (2016) · Electoral Studies · doi:10.1016/j.electstud.2016.06.010 · Cited by 21
Metadata
- Authors
- Jaynes, E. T.
- Venue
- Proceedings of the IEEE
- Published
- 1982
- Volume
- 70
- Issue
- 9
- Pages
- 939-952
- ISSN
- 0018-9219
- Cited by
- 1,297
- References
- 1
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