Generalizing transfer Bayesian optimization to source-target heterogeneity
Abstract
Black-box optimization algorithms typically start a search from scratch, assuming little prior knowledge about the task at hand. In practice, this approach can be prohibitive for computationally expensive problems, as a large number of costly function evaluations are often needed before a suitable (near-optimal) solution is found. Under this observation, recent efforts have incorporatedtransfer learningcapabilities into sequential model-based Bayesian optimization (BO) solvers, resulting in substantial performance speed-ups by leveraging information from related past problems. However, a common simplifying assumption in existing approaches is that the search spaces of a previously encounteredsourceand the ongoingtargettask bear the same features and dimensionality, with the difference lying in their respective objective functions. In this article, we present a generalizedtransfer BOalgorithm that relaxes the aforementioned assumption. Our method jointly transforms source features while training probabilistic transfer regression models for the target, thus applying to practical use-cases where (in addition to the difference in objective functions) the number of features could change across the source and target tasks; for example, features can be added and/or removed. The theoretical basis of our proposal is analyzed, and its empirical performance is demonstrated on synthetic benchmark functions as well as in realistic examples spanning engineering design and the automated configuration of a machine learning model. Note to Practitioners—Problems of industrial interest have a tendency of being repetitive in nature. For this reason, domain experts are always in high demand, as they are able to harness their experience of similar problems to come up with fast solutions in difficult situations. However, domain experts are not easy to find. Given this fact, the present paper puts forth a method for automating the process of knowledge extraction (through experiential learning) and transfer across problems in the domain of computationally expensive black-box optimization. The key novelty and motivation of this work lies in enabling the adaptive transfer of knowledge even when the number of features changes across the source and target problems. Our proposed approach is verified experimentally on a range of benchmarks as well as real-world problems of a computationally expensive nature, highlighting the utility of an optimization engine that is able to learn from experience without the need for constant human intervention.
Authors: Alan Tan Wei Min, Abhishek Gupta, Yew-Soon Ong
Published in: IEEE Transactions on Automation Science and Engineering (2020)