Non-exponentially weighted aggregation: regret bounds for unbounded loss functions

Pierre Alquier

We tackle the problem of online optimization with a general, possibly unbounded, loss function. It is well known that when the loss is bounded, the exponentially weighted aggregati…