We show a principled way of deriving online learning algorithms from a minimaxanalysis. Various upper bounds on the minimax value, previously thought to benon-constructive, are shown to yield algorithms. This allows us to seamlessly re-cover known methods and to derive new ones, also capturing such “unorthodox”methods as Follow the Perturbed Leader and the R forecaster. Understa...
