paper-with-me

홈 › Papers

Scalable Combinatorial Bayesian Optimization with Tractable Statistical models

2020-08-18 · Aryan Deshwal, Syrine Belakaria, Janardhan Rao Doppa

We study the problem of optimizing expensive blackbox functions over combinatorial spaces (e.g., sets, sequences, trees, and graphs). BOCS (Baptista and Poloczek, 2018) is a state-of-the-art Bayesian optimization method for tractable statistical models, which performs semi-definite programming based acquisition function optimization (AFO) to select the next structure for evaluation. Unfortunately, BOCS scales poorly for large number of binary and/or categorical variables. Based on recent advances in submodular relaxation (Ito and Fujimaki, 2016) for solving Binary Quadratic Programs, we study an approach referred as Parametrized Submodular Relaxation (PSR) towards the goal of improving the scalability and accuracy of solving AFO problems for BOCS model. PSR approach relies on two key ideas. First, reformulation of AFO problem as submodular relaxation with some unknown parameters, which can be solved efficiently using minimum graph cut algorithms. Second, construction of an optimization problem to estimate the unknown parameters with close approximation to the true objective. Experiments on diverse benchmark problems show significant improvements with PSR for BOCS model. The source code is available at https://github.com/aryandeshwal/Submodular_Relaxation_BOCS .

📄 PDF Abstract BibTeX arXiv:2008.08177

Code (1)

aryandeshwal/Submodular_Relaxation_BOCS 공식 구현

Tasks

Bayesian Optimization

Similar Papers 제목 키워드 기반

Mercer Features for Efficient Combinatorial Bayesian Optimization

2020-12-14 · Aryan Deshwal, Syrine Belakaria, Janardhan Rao Doppa

Bayesian optimization (BO) is an efficient framework for solving black-box optimization problems with expensive function evaluations. This paper addresses the BO problem setting for combinatorial spaces (e.g., sequences …

Bayesian OptimizationThompson Sampling

Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design

2024-09-27 · Melis Ilayda Bal, Pier Giuseppe Sessa, Mojmir Mutny, Andreas Krause

Bayesian optimization (BO) is a powerful framework to optimize black-box expensive-to-evaluate functions via sequential interactions. In several important problems (e.g. drug discovery, circuit design, neural architectur…

Bayesian OptimizationDrug DiscoveryNeural Architecture SearchProtein Design

Scalable Bayesian inference for the generalized linear mixed model

2024-03-05 · Samuel I. Berchuck, Felipe A. Medeiros, Sayan Mukherjee, Andrea Agazzi

The generalized linear mixed model (GLMM) is a popular statistical approach for handling correlated data, and is used extensively in applications areas where big data is common, including biomedical data settings. The fo…

Bayesian InferenceUncertainty Quantification

Bayesian Optimization of Combinatorial Structures

2018-06-22 · ICML 2018 7 · Ricardo Baptista, Matthias Poloczek

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…

Bayesian OptimizationBIG-bench Machine Learning

A Bayesian approach for prompt optimization in pre-trained language models

2023-12-01 · Antonio Sabbatella, Andrea Ponti, Antonio Candelieri, Ilaria Giordani 외

A prompt is a sequence of symbol or tokens, selected from a vocabulary according to some rule, which is prepended/concatenated to a textual query. A key problem is how to select the sequence of tokens: in this paper we f…

Bayesian OptimizationCombinatorial OptimizationLanguage ModellingLarge Language Model