Fetching the paper…
Reading the bibliography…
Bayesian optimization (BO) is a powerful paradigm for efficient optimization of black-box objective functions.
Toward global optimization, volume 2, chapter Bayesian methods for seeking the extremum, 1978
Jonas Mockus, Vytautas Tiesis, and Antanas Zilinskas · 1978
Earlier work this paper cites.
Automatic relevance determination for neural networks
David JC MacKay and Radford M Neal · 1994
Earlier work this paper cites.
Efficient global optimization of expensive black-box functions
Donald R Jones, Matthias Schonlau, and William J Welch · 1998
Earlier work this paper cites.
Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)
Nikolaus Hansen, Sibylle D Müller, and Petros Koumoutsakos · 2003
Earlier work this paper cites.
Quasi-Monte Carlo sampling
Art B Owen · 2003
Earlier work this paper cites.
Gaussian processes in machine learning
Carl Edward Rasmussen · 2003
Earlier work this paper cites.
Large-scale multi-disciplinary mass optimization in the auto industry
Donald R Jones · 2008
Earlier work this paper cites.
Handling sparsity via the horseshoe
Carlos M Carvalho, Nicholas G Polson, and James G Scott · 2009
Earlier work this paper cites.
Introduction to evolutionary algorithms
Xinjie Yu and Mitsuo Gen · 2010
Earlier work this paper cites.
Sequential model-based optimization for general algorithm configuration
Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown · 2011
Earlier work this paper cites.
The knowledge-gradient algorithm for sequencing experiments in drug discovery
Diana M Negoescu, Peter I Frazier, and Warren B Powell · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Earlier work this paper cites.
Joint optimization and variable selection of high-dimensional gaussian processes
Bo Chen, Rui Castro, and Andreas Krause · 2012
Earlier work this paper cites.
Practical Bayesian optimization of machine learning algorithms
Jasper Snoek, Hugo Larochelle, and Ryan P. Adams · 2012
Earlier work this paper cites.
Active learning of linear embeddings for Gaussian processes
Roman Garnett, Michael A. Osborne, and Philipp Hennig · 2014
Earlier work this paper cites.
The No-U-Turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo
Matthew D Hoffman and Andrew Gelman · 2014
Earlier work this paper cites.
High dimensional Bayesian optimisation and bandits via additive models
Kirthevasan Kandasamy, Jeff G. Schneider, and Barnabás Póczos · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Derivative-free optimization of high-dimensional non-convex functions by sequential random embeddings
Hong Qian, Yi-Qi Hu, and Yang Yu · 2016
Cited alongside, same era.
COMBO: An efficient Bayesian optimization library for materials science
Tsuyoshi Ueno, Trevor David Rhone, Zhufeng Hou, Teruyasu Mizoguchi, and Koji Tsuda · 2016
Cited alongside, same era.
Bayesian optimization in a billion dimensions via random embeddings
Ziyu Wang, Frank Hutter, Masrour Zoghi, David Matheson, and Nando de Feitas · 2016
Cited alongside, same era.
Discovering and exploiting additive structure for Bayesian optimization
Botorch: A framework for efficient monte-carlo bayesian optimization
Maximilian Balandat, Brian Karrer, Daniel R Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Eytan Bakshy · 2019
Later among the works it cites.
Pyro: Deep universal probabilistic programming
Eli Bingham, Jonathan P Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul Szerlip, Paul Horsfall, and Noah D Goodman · 2019
Later among the works it cites.
Uci machine learning repository, 2017
Dheeru Dua and Casey Graff · 2019
Later among the works it cites.
Scalable global optimization via local Bayesian optimization
David Eriksson, Michael Pearce, Jacob R. Gardner, Ryan Turner, and Matthias Poloczek · 2019
Later among the works it cites.
Adaptive and safe bayesian optimization in high dimensions via one-dimensional subspaces
Johannes Kirschner, Mojmir Mutny, Nicole Hiller, Rasmus Ischebeck, and Andreas Krause · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jacob R. Gardner, Chuan Guo, Kilian Q. Weinberger, Roman Garnett, and Roger B. Grosse · 2017
Cited alongside, same era.
Parallel and distributed Thompson sampling for large-scale accelerated exploration of chemical space
José Miguel Hernández-Lobato, James Requeima, Edward O. Pyzer-Knapp, and Alán Aspuru-Guzik · 2017
Cited alongside, same era.
High dimensional Bayesian optimization using dropout
Cheng Li, Sunil Gupta, Santu Rana, Vu Nguyen, Svetha Venkatesh, and Alistair Shilton · 2017
Cited alongside, same era.
Bayesian optimization of combinatorial structures
Ricardo Baptista and Matthias Poloczek · 2018
Cited alongside, same era.
Bayesian optimization of pump operations in water distribution systems
Antonio Candelieri, Raffaele Perego, and Francesco Archetti · 2018
Cited alongside, same era.
A tutorial on Bayesian optimization
Peter I Frazier · 2018
Cited alongside, same era.
Structured variationally auto-encoded optimization
Xiaoyu Lu, Javier Gonzalez, Zhenwen Dai, and Neil D. Lawrence · 2018
Cited alongside, same era.
Constrained Bayesian optimization with noisy experiments
Benjamin Letham, Brian Karrer, Guilherme Ottoni, Eytan Bakshy, et al · 2019
Later among the works it cites.
A framework for Bayesian optimization in embedded subspaces
Amin Nayebi, Alexander Munteanu, and Matthias Poloczek · 2019
Later among the works it cites.
Combinatorial Bayesian optimization using the graph cartesian product
ChangYong Oh, Jakub M. Tomczak, Efstratios Gavves, and Max Welling · 2019
Later among the works it cites.
Composable effects for flexible and accelerated probabilistic programming in NumPyro
Du Phan, Neeraj Pradhan, and Martin Jankowiak · 2019
Later among the works it cites.
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Ciyou Zhu, Richard H Byrd, Peihuang Lu, and Jorge Nocedal · 2019
Later among the works it cites.
Botorch: A framework for efficient Monte-Carlo Bayesian optimization
Maximilian Balandat, Brian Karrer, Daniel R. Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Eytan Bakshy · 2020
Later among the works it cites.
On the choice of the low-dimensional domain for global optimization via random embeddings
Mickaël Binois, David Ginsbourger, and Olivier Roustant · 2020
Later among the works it cites.
JAX: Composable transformations of Python+NumPy programs, 2018
James Bradbury, Roy Frostig, Peter Hawkins, Matthew James Johnson, Chris Leary, Dougal Maclaurin, and Skye Wanderman-Milne · 2020
Later among the works it cites.
Re-examining linear embeddings for high-dimensional Bayesian optimization
Benjamin Letham, Roberto Calandra, Akshara Rai, and Eytan Bakshy · 2020
Later among the works it cites.
Scalable constrained Bayesian optimization
David Eriksson and Matthias Poloczek · 2021
Closest in time.