Information theory and superefficiency

DOI10.1214/AOS/1024691358MaRDI QIDQ1807151zbMATH OpenOpenAlexFDO

Authors Andrew R. Barron, Nicolas W. Hengartner

Publication date 9 November 1999

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aos/1024691358

zbMATH Keywords

data compressionKullback-Leibler losssuperefficiency

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Asymptotic properties of parametric estimators (62F12) Asymptotic properties of nonparametric inference (62G20) Source coding (94A29) Bounds on codes (94B65)

Recommendations

• The evil of superefficiency
• scientific article; zbMATH DE number 1064665
• An asymptotic minimax theorem of order \(n^{-1/2}\)
• scientific article; zbMATH DE number 4213221

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 503461 (Why is no real title available?)
• scientific article; zbMATH DE number 3252891 (Why is no real title available?)
• scientific article; zbMATH DE number 3322635 (Why is no real title available?)
• scientific article; zbMATH DE number 3406955 (Why is no real title available?)
• scientific article; zbMATH DE number 3083069 (Why is no real title available?)
• A strong version of the redundancy-capacity theorem of universal coding
• An invariant form for the prior probability in estimation problems
• Asymptotic methods in statistical decision theory
• Bayes theory
• Minimum complexity density estimation
• On Fisher's Bound for Asymptotic Variances
• On Information and Sufficiency
• On estimating a density using Hellinger distance and some other strange facts
• Rates of Convergence of Estimates and Test Statistics
• Stochastic complexity and modeling
• Superefficiency in nonparametric function estimation
• The maximum likelihood prior
• Universal coding, information, prediction, and estimation

Cited in

(3)

• Superefficiency from the vantage point of computability
• On near-redundancy and identifiability of parametric hazard regression models under censoring
• Information-theoretic determination of minimax rates of convergence

This page was built for publication: Information theory and superefficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807151)