Lower bounds on expected redundancy for nonparametric classes

DOI10.1109/18.481802MaRDI QIDQ4880015zbMATH OpenOpenAlexFDO

Authors Bin Yu

Publication date 2 June 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.481802

zbMATH Keywords

expected redundancyminimax lower boundsmutual information quantitynonparametric density classesShannon capacityuniversal coding

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Density estimation (62G07) Nonparametric inference (62G99) Coding theorems (Shannon theory) (94A24) Communication, information (94A99)

Recommendations

• scientific article; zbMATH DE number 524372
• A strong version of the redundancy-capacity theorem of universal coding
• Methods of constructing lower bounds for redundancy of universal coding
• On the redundancy of universal lossless coding for general piecewise stationary sources

Cited in

(6)

• Methods of constructing lower bounds for redundancy of universal coding
• Mutual information, metric entropy and cumulative relative entropy risk
• Improved lower bounds for learning from noisy examples: An information-theoretic approach
• scientific article; zbMATH DE number 524372 (Why is no real title available?)
• Statistical problem classes and their links to information theory
• The effect of redundancy on probability bounds

This page was built for publication: Lower bounds on expected redundancy for nonparametric classes

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