Unimodal bandits: Regret lower bounds and optimal algorithms

Richard Combes; Alexandre Proutière

Conference papers

Unimodal bandits: Regret lower bounds and optimal algorithms

Richard Combes ¹ Alexandre Proutière ²

1 E3S - Supélec Sciences des Systèmes

2 KTH - Royal Institute of Technology [Stockholm]

Document type :

Conference papers

Domain :

Computer Science [cs]

Computer Science [cs] / Networking and Internet Architecture [cs.NI]

Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-01092662
Contributor : Catherine Magnet <>
Submitted on : Tuesday, December 9, 2014 - 11:20:04 AM
Last modification on : Monday, December 14, 2020 - 12:38:07 PM

Unimodal bandits: Regret lower bounds and optimal algorithms

Identifiers

Collections

Citation

Export

Metrics

71

Unimodal bandits: Regret lower bounds and optimal algorithms

Identifiers

Collections

Citation

Export

Share

Metrics

71