The optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly evalu- ations pose challenges for current techniques in discrete optimization and machine learning, and critically require new algorithmic ideas (NIPS BayesOpt 2017). This article proposes, to the best of our knowledge, the first algorithm to overcome these challenges, based on an adaptive, scal able model that identifies useful combinatorial structure even when data is scarce. Our acquisition function pioneers the use of semidefinite programming to achieve efficiency and scalability. Experimental evaluations demonstrate that this algorithm consistently outperforms other methods from combinatorial and Bayesian optimization.
Ricardo Baptista (Massachusetts Institute of Technology)
Matthias Poloczek (University of Arizona)
Related Events (a corresponding poster, oral, or spotlight)
2018 Oral: Bayesian Optimization of Combinatorial Structures »
Wed Jul 11th 02:20 -- 02:30 PM Room A3