Optimal sequential probability assignment for individual sequences

DOI10.1109/18.312161zbMATH Open0810.94017OpenAlexW2148844225MaRDI QIDQ4308773FDOQ4308773

Authors: Marcelo J. Weinberger, Neri Merhav, Meir Feder 

Publication date: 18 April 1995

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

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

Recommendations

• Universal prediction of individual sequences
• 10.1162/1532443041827952
• Universal schemes for sequential decision from individual data sequences
• Universality of Bayesian mixture predictors

zbMATH Keywords

predictionminimum description lengthuniversal codingsequential schemebatch schemefinite- state schemes

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Cited In (4)

• Tractability of batch to sequential conversion
• Universal schemes for sequential decision from individual data sequences
• Sensor networks: from dependence analysis via matroid bases to online synthesis
• Random assignments on sequentially dichotomous domains

This page was built for publication: Optimal sequential probability assignment for individual sequences

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