In online learning an algorithm plays against an environment with losses
possibly picked by an adversary at each round. The generality of this framework
includes problems that are not adversarial, for example offline optimization,
or saddle point problems (i.e. min max optimization). H