Hutter, Marcus2023-11-290304-3975http://hdl.handle.net/1885/307515We consider the problem of converting batch estimators into a sequential predictor or estimator with small extra regret. Formally this is the problem of merging a collection of probability measures over strings of length into a single probability measure over infinite sequences. We describe various approaches and their pros and cons on various examples. As a side-result we give an elementary non-heuristic purely combinatoric derivation of Turing's famous estimator. Our main technical contribution is to determine the computational complexity of sequential estimators with good guarantees in general. We conclude with an open problem on how to derive tractable sequential from batch estimators with good guarantees in general.application/pdfen-AUCrown Copyright © 2018 Published by Elsevier B.V.OfflineOnlineBatchSequentialProbabilityEstimationPredictionTime-consistencyNormalizationTractableRegretCombinatoricsBayesLaplaceRistadGood–Turing201810.1016/j.tcs.2018.04.0372022-08-28