Online Optimization

Regret Bound

Theoretical upper limit on the cumulative regret an algorithm may suffer, allowing comparison and performance guarantees for online optimization methods.

← Kembali