Asymptotics of Discrete MDL for Online Prediction
From MaRDI portal
Publication:3547504
DOI10.1109/TIT.2005.856956zbMath1318.68101arXivcs/0506022OpenAlexW2110432525WikidataQ58012442 ScholiaQ58012442MaRDI QIDQ3547504
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0506022
Inference from stochastic processes and prediction (62M20) Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15)
Related Items (6)
Tractability of batch to sequential conversion ⋮ Open problems in universal induction \& intelligence ⋮ Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma ⋮ Consistency of discrete Bayesian learning ⋮ Putnam's diagonal argument and the impossibility of a universal learning machine ⋮ Predictions and algorithmic statistics for infinite sequences
This page was built for publication: Asymptotics of Discrete MDL for Online Prediction
