2.4 MB, PDF document
Available under license: CC BY: Creative Commons Attribution 4.0 International License
Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - BOSS: Bayesian Optimization over String Spaces
AU - Moss, Henry
AU - Beck, Daniel
AU - Gonzalez, Javier
AU - Leslie, David
AU - Rayson, Paul
PY - 2020/12/1
Y1 - 2020/12/1
N2 - This article develops a Bayesian optimization (BO) method which acts directly over raw strings, proposing the first uses of string kernels and genetic algorithms within BO loops. Recent applications of BO over strings have been hindered by the need to map inputs into a smooth and unconstrained latent space. Learning this projection is computationally and data-intensive. Our approach instead builds a powerful Gaussian process surrogate model based on string kernels, naturally supporting variable length inputs, and performs efficient acquisition function maximization for spaces with syntactical constraints. Experiments demonstrate considerably improved optimization over existing approaches across a broad range of constraints, including the popular setting where syntax is governed by a context-free grammar.
AB - This article develops a Bayesian optimization (BO) method which acts directly over raw strings, proposing the first uses of string kernels and genetic algorithms within BO loops. Recent applications of BO over strings have been hindered by the need to map inputs into a smooth and unconstrained latent space. Learning this projection is computationally and data-intensive. Our approach instead builds a powerful Gaussian process surrogate model based on string kernels, naturally supporting variable length inputs, and performs efficient acquisition function maximization for spaces with syntactical constraints. Experiments demonstrate considerably improved optimization over existing approaches across a broad range of constraints, including the popular setting where syntax is governed by a context-free grammar.
UR - http://www.scopus.com/inward/record.url?scp=85099807878&partnerID=8YFLogxK
M3 - Conference contribution/Paper
SN - 9780262042062
VL - 2020-December
T3 - Advances in Neural Information Processing Systems
SP - 15476
EP - 15486
BT - Advances in Neural Information Processing Systems
PB - MIT Press
T2 - 34th Conference on Neural Information Processing Systems
Y2 - 6 December 2020 through 12 December 2020
ER -