BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH

arXiv:2604.12005v1 Announce Type: cross Abstract: 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 improving the sample efficiency of BO by making use of information from related tasks. Although meta-BO is sample-efficient when task structure transfers, poor alignment between meta-training and test tasks can cause suboptimal queries to be suggested during online optimization. To this end, we propose a simple meta-BO algorithm that utilizes related-task information when determined useful, falling back to lookahead otherwise, within a unified framework. We demonstrate competitiveness of our method with existing approaches on function optimization tasks, while retaining strong performance in low task-relatedness regimes where test tasks share limited structure with the meta-training set.

Related

• Black-Box Optimization From Small Offline Datasets via Meta Learning with Synthetic Tasks
• Evolutionary Optimization Trumps Adam Optimization on Embedding Space Exploration
• MolMem: Memory-Augmented Agentic Reinforcement Learning for Sample-Efficient Molecular Optimization
• Preference-Agile Multi-Objective Optimization for Real-time Vehicle Dispatching
• Learning When Not to Learn: Risk-Sensitive Abstention in Bandits with Unbounded Rewards

Source: arXiv cs.AI | 2026-04-15