Unimodal bandits: Regret lower bounds and optimal algorithms - Archive ouverte HAL Access content directly
Conference Papers Year :

Unimodal bandits: Regret lower bounds and optimal algorithms

Richard Combes
Supélec Sciences des Systèmes
CV
Alexandre Proutière
  • Function : Author
  • PersonId : 833456
Royal Institute of Technology [Stockholm]

Domains

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

Catherine Magnet  : Connect in order to contact the contributor

https://hal-centralesupelec.archives-ouvertes.fr/hal-01092662

Submitted on : Tuesday, December 9, 2014-11:20:04 AM

Last modification on : Tuesday, February 14, 2023-3:38:26 AM

Not file

Dates and versions

hal-01092662 , version 1 (09-12-2014)

Identifiers

  • HAL Id : hal-01092662 , version 1

Cite

Richard Combes, Alexandre Proutière. Unimodal bandits: Regret lower bounds and optimal algorithms. ICML 2014, Jun 2014, Beijing, China. ⟨hal-01092662⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

SUPELEC CENTRALESUPELEC
63 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More