Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting

Title
Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Authors
Keywords
-
Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 58, Issue 5, Pages 3250-3265
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Online
2012-01-26
DOI
10.1109/tit.2011.2182033

Ask authors/readers for more resources

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started