Contextual Gaussian Process Bandit Optimization
暂无分享,去创建一个
[1] G. Wahba. Spline models for observational data , 1990 .
[2] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[3] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[4] Philip M. Long,et al. Reinforcement Learning with Immediate Rewards and Linear Hypotheses , 2003, Algorithmica.
[5] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[6] Anton Schwaighofer,et al. Learning Gaussian processes from multiple tasks , 2005, ICML.
[7] Morten Nielsen,et al. A Community Resource Benchmarking Predictions of Peptide Binding to MHC-I Molecules , 2006, PLoS Comput. Biol..
[8] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[9] Edwin V. Bonilla,et al. Multi-task Gaussian Process Prediction , 2007, NIPS.
[10] J. Langford,et al. The Epoch-Greedy algorithm for contextual multi-armed bandits , 2007, NIPS 2007.
[11] Tao Wang,et al. Automatic Gait Optimization with Gaussian Process Regression , 2007, IJCAI.
[12] Thomas P. Hayes,et al. The Price of Bandit Information for Online Optimization , 2007, NIPS.
[13] Mokshay Madiman,et al. On the entropy of sums , 2008, 2008 IEEE Information Theory Workshop.
[14] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[15] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[16] Csaba Szepesvári,et al. Online Optimization in X-Armed Bandits , 2008, NIPS.
[17] Carl E. Rasmussen,et al. Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.
[18] Andreas Krause,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.
[19] Nando de Freitas,et al. A Bayesian interactive optimization approach to procedural animation design , 2010, SCA '10.
[20] Aurélien Garivier,et al. Parametric Bandits: The Generalized Linear Case , 2010, NIPS.
[21] Gunnar Rätsch,et al. Inferring latent task structure for Multitask Learning by Multiple Kernel Learning , 2010, BMC Bioinformatics.
[22] John Shawe-Taylor,et al. Regret Bounds for Gaussian Process Bandit Problems , 2010, AISTATS 2010.
[23] Nando de Freitas,et al. A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning , 2010, ArXiv.
[24] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[25] Neil D. Lawrence,et al. Efficient Multioutput Gaussian Processes through Variational Inducing Kernels , 2010, AISTATS.
[26] Filip Radlinski,et al. Learning optimally diverse rankings over large document collections , 2010, ICML.
[27] Aleksandrs Slivkins,et al. Contextual Bandits with Similarity Information , 2009, COLT.
[28] Wei Chu,et al. Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.
[29] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .