Universal prediction of individual sequences
From MaRDI portal
Publication:4014142
DOI10.1109/18.144706zbMath0775.94076OpenAlexW2102426343MaRDI QIDQ4014142
Neri Merhav, Michael Gutman, Meir Feder
Publication date: 11 October 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/23298ccbf84382b28ee5fa6f941a20f479d218fe
Related Items (27)
Predictive stochastic complexity and model estimation for finite-state processes ⋮ Prediction of infinite words with automata ⋮ A universal online caching algorithm based on pattern matching ⋮ On the complexity of function learning ⋮ Efficient learning of typical finite automata from random walks ⋮ Similarity in languages and programs ⋮ A Bayesian approach to (online) transfer learning: theory and algorithms ⋮ Predicting a binary sequence almost as well as the optimal biased coin ⋮ Fractal dimension and logarithmic loss unpredictability. ⋮ A conversation with James Hannan ⋮ Chasing Ghosts: Competing with Stateful Policies ⋮ Universal prediction of random binary sequences in a noisy environment ⋮ Analysis of two gradient-based algorithms for on-line regression ⋮ Variable length Markov chains ⋮ Randomized prediction of individual sequences ⋮ Sequence complexity and work extraction ⋮ Relevant states and memory in Markov chain bootstrapping and simulation ⋮ Online portfolio selection ⋮ Model selection by sequentially normalized least squares ⋮ Prediction and dimension ⋮ Measuring the efficiency of the intraday Forex market with a universal data compression algorithm ⋮ Regret in the on-line decision problem ⋮ Adaptive game playing using multiplicative weights ⋮ Conditional universal consistency. ⋮ On prediction of individual sequences ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources ⋮ Identification and Prediction
This page was built for publication: Universal prediction of individual sequences
