Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization
暂无分享,去创建一个
Andreas Krause | Joel W. Burdick | Thomas Desautels | Andreas Krause | J. Burdick | Thomas Desautels
[1] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[2] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[3] J. Mockus,et al. The Bayesian approach to global optimization , 1989 .
[4] J. Mockus. Bayesian Approach to Global Optimization: Theory and Applications , 1989 .
[5] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[6] D. Dennis,et al. A statistical method for global optimization , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.
[7] D. Dennis,et al. SDO : A Statistical Method for Global Optimization , 1997 .
[8] Donald R. Jones,et al. Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..
[9] Alexander J. Smola,et al. Learning with Kernels: support vector machines, regularization, optimization, and beyond , 2001, Adaptive computation and machine learning series.
[10] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[11] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[12] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[13] S. Ghosal,et al. Posterior consistency of Gaussian process prior for nonparametric binary regression , 2006, math/0702686.
[14] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[15] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[16] Tao Wang,et al. Automatic Gait Optimization with Gaussian Process Regression , 2007, IJCAI.
[17] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[18] Eli Upfal,et al. Multi-Armed Bandits in Metric Spaces ∗ , 2008 .
[19] Elad Hazan,et al. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.
[20] Csaba Szepesvári,et al. Online Optimization in X-Armed Bandits , 2008, NIPS.
[21] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[22] Rémi Munos,et al. Pure Exploration for Multi-Armed Bandit Problems , 2008, ArXiv.
[23] Carl E. Rasmussen,et al. Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.
[24] Rémi Munos,et al. Pure Exploration in Multi-armed Bandits Problems , 2009, ALT.
[25] Andreas Krause,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.
[26] Alan Fern,et al. Batch Bayesian Optimization via Simulation Matching , 2010, NIPS.
[27] D. Ginsbourger,et al. Kriging is well-suited to parallelize optimization , 2010 .
[28] Gunnar Rätsch,et al. Inferring latent task structure for Multitask Learning by Multiple Kernel Learning , 2010, BMC Bioinformatics.
[29] 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.
[30] Carl E. Rasmussen,et al. Gaussian Processes for Machine Learning (GPML) Toolbox , 2010, J. Mach. Learn. Res..
[31] Andreas Krause,et al. Contextual Gaussian Process Bandit Optimization , 2011, NIPS.
[32] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[33] John Langford,et al. Efficient Optimal Learning for Contextual Bandits , 2011, UAI.
[34] Warren B. Powell,et al. The Knowledge Gradient Algorithm for a General Class of Online Learning Problems , 2012, Oper. Res..
[35] Philipp Hennig,et al. Entropy Search for Information-Efficient Global Optimization , 2011, J. Mach. Learn. Res..
[36] S. Kakade,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2012, IEEE Transactions on Information Theory.
[37] Glencora Borradaile,et al. Batch Active Learning via Coordinated Matching , 2012, ICML.
[38] Ali Jalali,et al. Hybrid Batch Bayesian Optimization , 2012, ICML.
[39] András György,et al. Online Learning under Delayed Feedback , 2013, ICML.
[40] Andreas Krause,et al. Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization , 2013, ICML.