ResearchTrend.AI
Regret in Online Combinatorial Optimization

Regret in Online Combinatorial Optimization

Jean-Yves Audibert
Sébastien Bubeck
Gábor Lugosi
ArXivPDFHTML

Papers citing "Regret in Online Combinatorial Optimization"

2 / 2 papers shown
Title
Towards minimax policies for online linear optimization with bandit feedback
Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck
Nicolò Cesa-Bianchi
Sham Kakade
OffRL
280
150
0
14 Feb 2012
The on-line shortest path problem under partial monitoring
The on-line shortest path problem under partial monitoring
Pál Benkö
T. Várady
L. Andor
Ralph Robert Martin
593
355
0
08 Apr 2007