The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Information-theoretic asymptotics of Bayes methods
Abstract
In the absence of knowledge of the true density function, Bayesian models take the joint density function for a sequence of n random variables to be an average of densities with respect to a prior. The authors examine the relative entropy distance D/sub n/ between the true density and the Bayesian density and show that the asymptotic distance is (d/2)(log n)+c, where d is the dimension of the parameter vector. Therefore, the relative entropy rate D/sub n//n converges to zero at rate (log n)/n. The constant c, which the authors explicitly identify, depends only on the prior density function and the Fisher information matrix evaluated at the true parameter value. Consequences are given for density estimation, universal data compression, composite hypothesis testing, and stock-market portfolio selection.>
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
A Course in Probability Theory
(1974) · Elsevier eBooks · doi:10.1016/c2009-0-22097-6 · Cited by 2,668
Wald, A. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0012401-3 · Cited by 2,511
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Accurate Approximations for Posterior Moments and Marginal Densities
Tierney, L., & Kadane, J. B. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478240 · Cited by 2,129
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
The horseshoe estimator for sparse signals
Carvalho, C. M., Polson, N. G., & Scott, J. G. (2010) · Biometrika · doi:10.1093/biomet/asq017 · Cited by 1,381
The Selection of Prior Distributions by Formal Rules
Kass, R. E., & Wasserman, L. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10477003 · Cited by 1,308
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2 · Cited by 1,235
The minimum description length principle in coding and modeling
Barron, A., Rissanen, J., & Yu, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720554 · Cited by 1,019
Self-citationDecision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Fisher information and stochastic complexity
Rissanen, J. J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481776 · Cited by 814
Model Selection and the Principle of Minimum Description Length
Hansen, M. H., & Yu, B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753168398 · Cited by 788
On Divergences and Informations in Statistics and Information Theory
Liese, F., & Vajda, I. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881731 · Cited by 593
Information-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
Self-citationMinimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Self-citationPredictability, Complexity, and Learning
Bialek, W., Nemenman, I., & Tishby, N. (2001) · Neural Computation · doi:10.1162/089976601753195969 · Cited by 504
A Bayesian/Information Theoretic Model of Learning to Learn via Multiple Task Sampling
Baxter, J. (1997) · Machine Learning · doi:10.1023/a:1007327622663 · Cited by 462
Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
Grünwald, P. D., & Dawid, A. P. (2004) · The Annals of Statistics · doi:10.1214/009053604000000553 · Cited by 454
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
Shrink Globally, Act Locally: Sparse Bayesian Regularization and Prediction*
Polson, N. G., & Scott, J. G. (2011) · Bayesian Statistics 9 · doi:10.1093/acprof:oso/9780199694587.003.0017 · Cited by 387
If You're so Smart, why Aren't You Rich? Belief Selection in Complete and Incomplete Markets
Blume, L., & Easley, D. (2006) · Econometrica · doi:10.1111/j.1468-0262.2006.00691.x · Cited by 386
Mutual Information, Fisher Information, and Population Coding
Brunel, N., & Nadal, J.-P. (1998) · Neural Computation · doi:10.1162/089976698300017115 · Cited by 350
Jeffreys' prior is asymptotically least favorable under entropy risk
Clarke, B. S., & Barron, A. R. (1994) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(94)90153-8 · Cited by 292
Self-citationEntropy and information in neural spike trains: Progress on the sampling problem
Nemenman, I., Bialek, W., & de Ruyter van Steveninck, R. (2004) · Physical Review E · doi:10.1103/physreve.69.056111 · Cited by 196
Metadata
- Authors
- Clarke, B. S., & Barron, A. R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1990-05
- Volume
- 36
- Issue
- 3
- Pages
- 453-471
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2160570986
- Cited by
- 431
- References
- 45
- FWCI
- 4.68
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.