Skip to content

Transfer Learning Architectures for Scalable Multi-Fidelity Bayesian Optimization

Jul 2026 · arXiv.org · Vol abs/2607.23404 · 0 citations · 28 references
Computer Science

TL;DR

This work benchmarks eleven transfer-learning surrogates against four GP methods under an identical selection rule, fidelity budget, and model size, across nine tasks spanning synthetic functions to real chemistry and materials problems, where transfer-learning surrogates reach substantially better solutions using far less computation.

Abstract

Self-driving laboratories increasingly rely on multi-fidelity Bayesian optimization (MFBO) to balance cheap, approximate evaluations against scarce, expensive ones, with a predictive surrogate at its core. Gaussian processes (GPs) are the default choice, but they scale poorly as data accumulate and assume a smooth landscape that molecular and materials search spaces routinely violate. Transfer learning offers an alternative suited to this regime: it learns a representation from abundant cheap data and adapts it to sparse expensive data. Despite its use in property prediction, transfer learning has not been tested as the engine of a closed-loop optimization. Here we benchmark eleven transfer-learning surrogates against four GP methods under an identical selection rule, fidelity budget, and model size, across nine tasks spanning synthetic functions to real chemistry and materials problems. GPs win on smooth, low-dimensional functions but perform worst on molecular and materials problems, where transfer-learning surrogates reach substantially better solutions using far less computation. Because acquisition policy is held fixed across surrogates, this advantage is attributable to the surrogate itself. Uncertainty-driven exploration is not reliably beneficial, and calibration does not predict optimization performance, so greedy exploitation of the transfer-learned mean is the more robust default. Transfer learning is therefore the surrogate of choice for molecular and materials MFBO.

View source

Similar papers

Preprint Aug 2026

Out-Of-The-Loop Multi-Fidelity Bayesian Optimization

This work demonstrates the suboptimality of standard MF-BO algorithms in the real-world scenarios above, even under ideal assumptions, and mitigate this problem by incorporating historical high-fidelity data accompanied by task descriptors---which can be explicitly given or extracted from unstructured metadata.

G. Sutter, Hao Wang, Luis A. Ricardez-Sandoval et al. · 0 citations
Jul 2026

Frugal Bayesian Optimization: Scalable Surrogates for Data- and Resource-Limited Discovery

A surrogate-recommendation framework is introduced that predicts the most suitable BO surrogate from inexpensive dataset characteristics and establishes FruBO as a reproducible, compute-aware baseline for Bayesian Optimization and provides practical guidance for surrogate selection under limited computational and exper...

P. Krokidas, C. Rekatsinas, Vassilis Sioros et al. · 1 citation
Preprint Aug 2026

Kastor: An efficient fine-tuning strategy for generative emulation of PDE simulations

This paper proposes Kastor, a comprehensive methodology to adapt a deterministic physics foundation model into a highly efficient and accurate generative surrogate, and introduces a two-stage inference scheme that combines a large-stride causal auto-regressive model with a non-causal temporal super-resolution network,...

Guillaume Couairon, Alexis Jacq, Yu-Han Wu et al. · 0 citations
#machine learning Preprint Aug 2026

Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity

A unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), is proposed that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies and extends the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning struct...

Heng Zhang, Hao-Tian Xiang, Konstantinos D. Polyzos et al. · 1 citation
#machine learning Preprint Aug 2026

Optimize Your Sampling: Tuned Diffusion Sampling with Bayesian Optimization

Optizing Your Sampling (OYS), which instead treats timestep selection as a black-box optimization problem, optimizing the target metric directly with Bayesian optimization, improves both simple and sophisticated samplers such as Euler and DPM-Solver++.

Travis Zhang, Christian K. Belardi, Justin Lovelace et al. · 0 citations
Open access Jul 2026

Data-driven optimization: efficient adaptive learning for self-driving laboratories

It is shown how moving from BO to partitioning-based algorithms can substantially improve data efficiency, scale gracefully to dozens of process variables, and handle the constraints and noise that characterize realistic experimental campaigns.

N. Sahinidis · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.