Online Monotone Optimization

CoRR, Volume abs/1608.07888, 2016.

Cited by: 0|Views28
EI

Abstract:

This paper presents a new framework for analyzing and designing no-regret algorithms for dynamic (possibly adversarial) systems. The proposed framework generalizes the popular online convex optimization framework and extends it to its natural limit allowing it to capture a notion of regret that is intuitive for more general problems suc...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments