Unimodal bandits: Regret lower bounds and optimal algorithms - CentraleSupélec Access content directly
Conference Papers Year : 2014

Unimodal bandits: Regret lower bounds and optimal algorithms

Richard Combes
No 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⟩
77 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More