Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
暂无分享,去创建一个
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is either sampled fro...