DocSlides

PDF-On Bayesian Upper Condence Bounds for Bandit Problems

SO

cheryl-pisano

Published 2015-04-08 | 5854 Views

On Bayesian Upper Condence Bounds for Bandit Problems
We show in this paper that methods derived from this second per spective prove optimal when evaluated using the frequentist cumulated regret as a mea sure of performance

Download Presentation

Download Presentation The PPT/PDF document "On Bayesian Upper Condence Bounds for Ba..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

Related Topics