z-logo
open-access-imgOpen Access
Regret Bounds for Gaussian Process Bandit Problems
Author(s) -
Steffen Grünewälder,
Jean-Yves Audibert,
Manfred Opper,
John ShaweTaylor
Publication year - 2010
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - regret , upper and lower bounds , logarithm , complement (music) , covariance , mathematical optimization , gaussian process , gaussian , computer science , a priori and a posteriori , function (biology) , process (computing) , covariance matrix , mathematics , algorithm , statistics , machine learning , operating system , quantum mechanics , physics , philosophy , mathematical analysis , chemistry , biology , biochemistry , epistemology , evolutionary biology , complementation , gene , phenotype

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom