PDF-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
"On Bayesian Upper Condence Bounds for Bandit Problems" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.