Local asymptotic coding and the minimum description length

DOI10.1109/18.761287zbMath0959.62006OpenAlexW2129347085MaRDI QIDQ4701387

Robert A. Stine, Dean P. Foster

Publication date: 21 November 1999

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

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

zbMATH Keywords

model selectionhypothesis testBICuniversal codetwo-part code

Mathematics Subject Classification ID

Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)

Related Items (7)

SLOPE is adaptive to unknown sparsity and asymptotically minimax ⋮ Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection ⋮ Optimal false discovery control of minimax estimators ⋮ SLOPE-adaptive variable selection via convex optimization ⋮ Model selection and sharp asymptotic minimaxity ⋮ On optimality of Bayesian testimation in the normal means problem ⋮ Adapting to unknown sparsity by controlling the false discovery rate

This page was built for publication: Local asymptotic coding and the minimum description length