Menu

Bandits, Query Learning, and the Haystack Dimension

Published on 2011-08-022919 Views
video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Motivated by multi-armed bandits (MAB) problems with a very large or even in finite number of arms, we consider the problem of finding a maximum of an unknown target function by querying the function

MORE VIDEOS FROM THE EVENT

MORE VIDEOS FROM THE SAME CATEGORIES

Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International license.