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

7 Sep 2020Pierre Alquier

We tackle the problem of online optimization with a general, possibly unbounded, loss function. It is well known that the exponentially weighted aggregation strategy (EWA) leads to a regret in $\sqrt{T}$ after $T$ steps, under the assumption that the loss is bounded... (read more)

PDF Abstract

No code implementations yet. Submit your code now