Information theory and superefficiency
type: Item
instance of: scholarly article
title: Information theory and superefficiency
zbMATH Open document ID: 0932.62005
published in: The Annals of Statistics
publication date: 1999-11-09T00:00:00Z
Mathematics Subject Classification ID: 62B10
Mathematics Subject Classification ID: 62F12
Mathematics Subject Classification ID: 62G20
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 1359584
zbMATH Keywords: superefficiency
zbMATH Keywords: data compression
zbMATH Keywords: Kullback-Leibler loss
author: Andrew R. Barron
author: Nicolas W. Hengartner
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aos/1024691358
OpenAlex ID: W2006833219
cites work: Q5601960
cites work: On Fisher's Bound for Asymptotic Variances
cites work: Rates of Convergence of Estimates and Test Statistics
cites work: Q5671986
cites work: Minimum complexity density estimation
cites work: On estimating a density using Hellinger distance and some other strange facts
cites work: Q4279800
cites work: Superefficiency in nonparametric function estimation
cites work: Q4023085
cites work: Q5539510
cites work: Bayes theory
cites work: The maximum likelihood prior
cites work: An invariant form for the prior probability in estimation problems
cites work: On Information and Sufficiency
cites work: Q5823924
cites work: Asymptotic methods in statistical decision theory
cites work: A strong version of the redundancy-capacity theorem of universal coding
cites work: Universal coding, information, prediction, and estimation
cites work: Stochastic complexity and modeling
DOI: 10.1214/AOS/1024691358
description: scientific article; zbMATH DE number 1359584