Fetching the paper…
Reading the bibliography…
Finite-horizon sequential experimental design (SED) arises naturally in many contexts, including hyperparameter tuning in machine learning among more traditional settings.
A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise
Harold Joseph Kushner · 1964
Earlier work this paper cites.
Gaussian measure in Hilbert space and applications in numerical analysis
F. M. Larkin · 1972
Earlier work this paper cites.
On Bayesian methods for seeking the extremum
Jonas Močkus · 1974
Earlier work this paper cites.
Bayesian numerical analysis
Persi Diaconis · 1988
Earlier work this paper cites.
Bayes-Hermite quadrature
Anthony O’Hagan · 1991
Earlier work this paper cites.
A sequential algorithm for training text classifiers
David D. Lewis and William A. Gale · 1994
Earlier work this paper cites.
Gaussian Processes for Machine Learning
Carl E. Rasmussen and Christopher K. I. Williams · 2006
Earlier work this paper cites.
Nonmyopic active learning of Gaussian processes: an exploration-exploitation approach
Andreas Krause and Carlos Guestrin · 2007
Earlier work this paper cites.
Direct global optimization algorithm
Donald R. Jones · 2009
Earlier work this paper cites.
Gaussian processes for global optimization
Michael A Osborne, Roman Garnett, and Stephen J Roberts · 2009
Earlier work this paper cites.
Towards Gaussian process-based optimization with finite time horizon
David Ginsbourger and Rodolphe Le Riche · 2010
Earlier work this paper cites.
Kriging is well-suited to parallelize optimization
David Ginsbourger, Rodolphe Le Riche, and Laurent Carraro · 2010
Earlier work this paper cites.
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Warren B. Powell · 2010
Cited alongside, same era.
Active learning literature survey
Burr Settles · 2010
Cited alongside, same era.
Determinantal point processes for machine learning
Alex Kulesza and Ben Taskar · 2012
Cited alongside, same era.
Active learning of model evidence using Bayesian quadrature
Michael A. Osborne, Roman Garnett, Zoubin Ghahramani, David Duvenaud, Stephen J. Roberts, and Carl E. Rasmussen · 2012
Cited alongside, same era.
Practical Bayesian optimization of machine learning algorithms
Jasper Snoek, Hugo Larochelle, and Ryan P Adams · 2012
Cited alongside, same era.
Parallelizing exploration-exploitation tradeoffs in Gaussian process bandit optimization
Thomas Desautels, Andreas Krause, and Joel W Burdick · 2014
Cited alongside, same era.
Parallel Bayesian global optimization of expensive functions
Jialei Wang, Scott C Clark, Eric Liu, and Peter I Frazier · 2016
Later among the works it cites.
The parallel knowledge gradient method for batch Bayesian optimization
Jian Wu and Peter Frazier · 2016
Later among the works it cites.
Dynamic programming and optimal control , volume 1
Dimitri P. Bertsekas · 2017
Later among the works it cites.
Efficient nonmyopic active search
Shali Jiang, Gustavo Malkomes, Geoff Converse, Alyssa Shofner, Benjamin Moseley, and Roman Garnett · 2017
Later among the works it cites.
Max-value entropy search for efficient Bayesian optimization
Zi Wang and Stefanie Jegelka · 2017
Later among the works it cites.
Efficient nonmyopic batch active search
Shali Jiang, Gustavo Malkomes, Matthew Abbott, Benjamin Moseley, and Roman Garnett · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sampling for inference in probabilistic models with fast Bayesian quadrature
Tom Gunter, Michael A. Osborne, Roman Garnett, Philipp Hennig, and Stephen J. Roberts · 2014
Cited alongside, same era.
Nonmyopic ϵ \epsilon -Bayes-optimal active learning of Gaussian processes
Trong Nghia Hoang, Kian Hsiang Low, Patrick Jaillet, and Mohan Kankanhalli · 2014
Cited alongside, same era.
Parallel predictive entropy search for batch global optimization of expensive objective functions
Amar Shah and Zoubin Ghahramani · 2015
Cited alongside, same era.
Bayesian optimization with a finite budget: an approximate dynamic programming approach
Remi Lam, Karen Willcox, and David H. Wolpert · 2016
Cited alongside, same era.
Gaussian process planning with Lipschitz continuous reward functions: towards unifying Bayesian optimization, active learning, and beyond
Chun Kai Ling, Kian Hsiang Low, and Patrick Jaillet · 2016
Cited alongside, same era.
Taking the human out of the loop: a review of Bayesian optimization
Bobak Shahriari, Kevin Swersky, Ziyu Wang, Ryan P. Adams, and Nando de Freitas · 2016
Cited alongside, same era.
Later among the works it cites.
Automating Bayesian optimization with Bayesian optimization
Gustavo Malkomes and Roman Garnett · 2018
Later among the works it cites.
Improving quadrature for constrained integrands
Henry Chai and Roman Garnett · 2019
Closest in time.
Automated model selection with Bayesian quadrature
Henry Chai, Jean-François Ton, Michael A. Osborne, and Roman Garnett · 2019
Closest in time.
Practical two-step lookahead Bayesian optimization
Jian Wu and Peter Frazier · 2019
Closest in time.
Why non-myopic Bayesian optimization is promising and how far should we look-ahead? A study via rollout
Xubo Yue and Raed Al Kontar · 2020
Closest in time.