No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling

Eric Neyman, Tim Roughgarden

For each of $T$ time steps, $m$ experts report probability distributions over $n$ outcomes; we wish to learn to aggregate these forecasts in a way that attains a no-regret guarante…