Bayesian Active Meta-Learning for Black-Box Optimization
Data-efficient learning algorithms are essential in many practical applications for which data collection is expensive, e.g., for the optimal deployment of wireless systems in unknown propagation scenarios. Meta-learning can address this problem by leveraging data from a set of related learning tasks, e.g., from similar deployment settings. In practice, one may have available only unlabeled data sets from the related tasks, requiring a costly labeling procedure to be carried out before use in meta-learning. For instance, one may know the possible positions of base stations in a given area, but not the performance indicators achievable with each deployment. To decrease the number of labeling steps required for meta-learning, this paper introduces an information-theoretic active task selection mechanism, and evaluates an instantiation of the approach for Bayesian optimization of black-box models.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationMeta-LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH
Bayesian optimization (BO) has for sequential optimization of expensive black-box functions demonstrated practicality and effectiveness in many real-world settings. Meta-Bayesian optimization (meta-BO) focuses on improvi…
Modelling Human Active Search in Optimizing Black-box Functions
Modelling human function learning has been the subject of in-tense research in cognitive sciences. The topic is relevant in black-box optimization where information about the objective and/or constraints is not available…
Active LearningBayesian OptimizationGaussian ProcessesSMOG: Scalable Meta-Learning for Multi-Objective Bayesian Optimization
Multi-objective optimization aims to solve problems with competing objectives. Evaluating such problems is often slow or expensive, limiting the budget of evaluations. In many applications, historical data from related o…
Machine Learning Algorithms for Improving Black Box Optimization Solvers
Black-box optimization (BBO) addresses problems where objectives are accessible only through costly queries without gradients or explicit structure. Classical derivative-free methods -- line search, direct search, and mo…
Reinforcement LearningResource Aware Multifidelity Active Learning for Efficient Optimization
Traditional methods for black box optimization require a considerable number of evaluations which can be time consuming, unpractical, and often unfeasible for many engineering applications that rely on accurate represent…
Active LearningBayesian OptimizationDistributed Computing