Slide 31
Slide 31 text
ࢀߟจݙ
• ຊଟ३ɼதଜಞɼόϯσΟοτͷཧͱΞϧΰϦζ
Ϝɼߨஊࣾɼ2016ɽ
• Tor Lattimore, Csaba Szepesvári, Bandit algorithms, preprint,
2018.
• Russo, D. and Roy, B. V. Learning to optimize via posterior
sampling.Mathematics of OperationsResearch,
39(4):1221–1243, 2014.
• Srinivas, N., Krause, A., Kakade, S. M., and Seeger, M. W.
Information-theoretic regret bounds forgaussian process
optimization in the bandit setting.IEEE Transactions on
Information Theory, 58(5):3250–3265, 2012.
• Rasmussen, C. and Williams, C. Gaussian Processes for
Machine Learning. MIT Press, Cambridge, 2006.
31 / 31