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

标题
Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
作者
关键词
-
出版物
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 58, Issue 5, Pages 3250-3265
出版商
Institute of Electrical and Electronics Engineers (IEEE)
发表日期
2012-01-26
DOI
10.1109/tit.2011.2182033

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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