- A short (4 page) paper
- Analysis of upper confidence bound on Gaussian process optimization
- Smootheness is encoded by covariance function
- The Gaussian Bandit UCB requires a discrete set of test points, which seems strange
- There are some notation abuses that are difficult to understand, for example their definition of a no-regret algorithm and the statement that UCB is a no regret algorithm
- The regret bound in discrete UCB is O(sqrt(kt)). For the infinite arm case, K is replaced by the bound for the maximum possible information gain due to sampling
- The say this connects GP optimization w/ optimal experimental design, should read more about this
- Here there is noise on the reward observations, it is assumed to be Gaussian
- Although it is a regret algorithm it looks like there is a probability of failure delta
- Information gain is submodular – more information is gained when the total number of points sampled is low (although there has to be cases where this isn’t true)
- There is a different regret bound here that also has sqrtish flavor

Advertisements
(function(g,$){if("undefined"!=typeof g.__ATA){
g.__ATA.initAd({collapseEmpty:'after', sectionId:26942, width:300, height:250});
g.__ATA.initAd({collapseEmpty:'after', sectionId:114160, width:300, height:250});
}})(window,jQuery);
var o = document.getElementById('crt-934056849');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-934056849",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-934056849'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}
var o = document.getElementById('crt-1220211300');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:837497,containerid:"crt-1220211300",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-1220211300'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}