暂无分享,去创建一个
[1] Nicolas Vayatis,et al. Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration , 2013, ECML/PKDD.
[2] Andreas Krause,et al. Efficient High Dimensional Bayesian Optimization with Additivity and Quadrature Fourier Features , 2018, NeurIPS.
[3] Andreas Krause,et al. No-regret Algorithms for Capturing Events in Poisson Point Processes , 2021, ICML.
[4] 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.
[5] Alan Fern,et al. Batch Bayesian Optimization via Simulation Matching , 2010, NIPS.
[6] Neil D. Lawrence,et al. Bayesian Optimization for Synthetic Gene Design , 2015, 1505.01627.
[7] Ben Taskar,et al. Determinantal Point Processes for Machine Learning , 2012, Found. Trends Mach. Learn..
[8] Benjamin Van Roy,et al. Learning to Optimize via Posterior Sampling , 2013, Math. Oper. Res..
[9] Volkan Cevher,et al. Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization , 2017, COLT.
[10] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[11] Andreas Krause,et al. Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces , 2019, ICML.
[12] Lihong Li,et al. An Empirical Evaluation of Thompson Sampling , 2011, NIPS.
[13] Suvrit Sra,et al. Fast DPP Sampling for Nystrom with Application to Kernel Methods , 2016, ICML.
[14] Andreas Krause,et al. Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.
[15] Jasper Snoek,et al. Practical Bayesian Optimization of Machine Learning Algorithms , 2012, NIPS.
[16] Carl E. Rasmussen,et al. Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.
[17] Nima Anari,et al. Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes , 2016, COLT.
[18] Donald A. Berry,et al. Bandit Problems: Sequential Allocation of Experiments. , 1986 .
[19] Craig Boutilier,et al. Perturbed-History Exploration in Stochastic Linear Bandits , 2019, UAI.
[20] W. R. Thompson. ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .
[21] Andreas Krause,et al. Convergence Analysis of Block Coordinate Algorithms with Determinantal Sampling , 2020, AISTATS.
[22] Andreas Krause,et al. Bayesian optimisation for fast and safe parameter tuning of SwissFEL , 2019 .
[23] Benjamin Van Roy,et al. A Tutorial on Thompson Sampling , 2017, Found. Trends Mach. Learn..
[24] Shayan Oveis Gharan,et al. A Polynomial Time MCMC Method for Sampling from Continuous Determinantal Point Processes , 2019, ICML.
[25] Andreas Krause,et al. Sensing Cox Processes via Posterior Sampling and Positive Bases , 2021, ArXiv.