# Offline to Online Conversion

arXiv: https://arxiv.org/abs/1407.3334 · HTML: https://mlsanity.com/paper/1407.3334/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Jul 2014.

## Built on by (most cited first, 1 of 1)

- [A Layered Simplex Architecture for Large Alphabets](https://mlsanity.com/paper/2608.19908/) (2026)

## Abstract (arXiv)

We consider the problem of converting offline estimators into an online predictor or estimator with small extra regret. Formally this is the problem of merging a collection of probability measures over strings of length 1,2,3,... 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 online estimators with good guarantees in general.