Open access

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

N. Sahinidis

Jul 2026 · Proceedings of the 3rd Foundations of Process/Product Analytics and Machine Learning (FOPAM 2026) · pp. 11-11 · 0 citations · 1 references

TL;DR

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.

Abstract

Self-driving laboratories promise to compress materials-discovery timelines from years to weeks by replacing trial-and-error experimentation with closed-loop, algorithm-guided campaigns. Yet, despite the rapid proliferation of robotic and automation hardware, today's autonomous labs rely almost exclusively on Bayesian optimization (BO) to decide what experiment to run next. BO is a sensible approach to low-dimensional optimization problems with smooth response surfaces, but it struggles in precisely the regimes that matter most for real materials campaigns: tight experimental budgets, dozens of process parameters, mixed-integer choices, hard physical constraints, and noisy expensive measurements. In this talk, I will show 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. I will summarize a recently completed large-scale black-box optimization (BBO) benchmark in which we compared 42 solvers across 502 problems ranging from one to 300 dimensions and from smooth and convex to nonsmooth and nonconvex. The results overturn several community assumptions: BO solves only about 9% of problems within a 2,500-evaluationbudget, while a new branch-and-model (BAM) algorithm reaches an 81% success rate, with GLCCLUSTER, MULTIMIN, MCS, and SNOBFIT also performing strongly. A minimal, irreducible set of eight complementary solvers attains 88% solvability on the full suite. I will then move from in-silico benchmarks to the wet lab, presenting a recent algorithmguided experimental campaign on high-performance perovskite solar cells in which a non- BO solver was used to co-optimize six process variables spanning the perovskite, electrontransport, and hole-transport layers. Time permitting, I will also share early results from applying ensembles of BBO algorithms to digital twins of self-driving labs across additional materials systems. I will close with a forward-looking research vision: accelerating autonomous labs by developing, benchmarking, and experimentally validating data-efficient adaptive algorithms across batteries, semiconductors, catalysts, polymeric membranes, and biomolecules. The benchmarking software will be released as open source, with BAM and most BBO software available free to academic users, so that experimental groups can deploy these tools on their own self-driving platforms. Bio: Nick Sahinidis is the Butler Family Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering and the School of Chemical and Biomolecular Engineering at Georgia Tech. His current research activities are at the interface between computer science and operations research, with applications in various engineering and scientific areas, including: global optimization of mixed-integer nonlinear programs: theory, algorithms, and software; informatics problems in chemistry and biology; process and energy systems engineering. Professor Sahinidis teaches mathematical optimization, process systems engineering, and scientific computing. He has developed a bioinformatics M.S. program and has taught courses ranging from thermodynamics and metabolic engineering to approximation algorithms and GPU computing. Sahinidis has served on the editorial boards of many leading journals and in various positions within AIChE (American Institute of Chemical Engineers). He received an NSF CAREER award, the INFORMS Computing Society Prize, the MOS Beale-Orchard-Hays Prize, the Computing in Chemical Engineering Award, the Constantin Carathéodory Prize, and the National Award and Gold Medal from the Hellenic Operational Research Society. Sahinidis is a member of the U.S. National Academy of Engineering and a fellow of AIChE and INFORMS.

DOI Semantic Scholar

Read PDF

Similar papers

Review Aug 2026

Bayesian Optimization for Self-Driving Materials Laboratories: From Algorithms to Physics-Informed Workflows

Self-driving laboratories (SDLs) are transforming materials research by closing the loop among synthesis, characterization, data analysis and experimental decision making. Bayesian optimization (BO) is a decision engine for these loops because it can select experiments from scarce and noisy data while balancing exploitation and exploration. Yet real materials campaigns often depart from the standard black-box setting, involving failed or missing experiments, noise and drift, mixed variables, constraints, multiple objectives, variable cost and fidelity, transfer from historical data, batch or asynchronous operation, and prior physics knowledge. This review presents BO for materials SDLs through the lens of these practical challenges. We summarize Gaussian-process-based BO and the formulation of materials goals as quantitative objectives, then discuss major choices in surrogate modelling and acquisition. Particular emphasis is placed on physics-informed Bayesian optimization (PIBO), in which domain knowledge enters through representations, priors, kernels, acquisition functions, and constraints. We survey achievements enabled by BO and related active-learning approaches across semiconductors, catalysis, chemical reactions, batteries, alloys, functional materials and quantum materials, highlighting advances beyond parameter optimization, including new materials and synthesis routes, improved functional performance, and reusable scientific knowledge. We conclude by outlining open problems for BO-driven materials SDLs, including nonstationarity, multimodal observations, adaptive problem formulation, and scientific reasoning by humans, large language models and research agents. Addressing these challenges may advance SDLs beyond efficient optimization toward interpretable and knowledge-generating experimentation.

Yuki K. Wakabayashi, Takuma Otsuka · 0 citations

Open access Jul 2026

Adaptive self-supervised learning for real-time problem solving in autonomous systems.

The AdaptSolveAI with SelfSolveNet framework provides a practical recipe for resilient and safety-aware autonomy by enabling continuous learning from unlabeled streams, adaptation within fixed computational budgets, and action execution under control barrier function-based safety constraints.

Nagunuri Rajender, Girish Reddy Ginni, K. Rayudu et al. · Scientific Reports · 0 citations

Preprint Jul 2026

Transfer Learning Architectures for Scalable Multi-Fidelity Bayesian Optimization

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.

Jaewook Lee, Ethan Errington, Christian D. Lorenz et al. · 0 citations

Preprint Aug 2026

Physics Filtering Favors the Generalization of Robot Learning

Living organisms exhibit extraordinary adaptability to unseen environments through their intrinsic physical structures and lifelong feedback-driven learning. Endowing robots with comparable generalization is critical for reliable operation in the real world. While recent approaches attempt to improve generalization by scaling training data, such strategies remain impractical for robotics, where collecting real-world demonstrations at the scale of large language models is prohibitively costly and slow. Contrary to this reliance on massive datasets, we show that robots can generalize effectively under dynamics uncertainties even with limited training data by leveraging a feedback mechanism, namely PhyFilter, that corrects learning outputs with physics-filtered learning residuals. PhyFilter operates as a lightweight, model-agnostic module whose parameters can be automatically optimized through an auto-learning algorithm, eliminating manual tuning and enabling seamless integration with diverse robot policies. We validate PhyFilter across four representative robotic systems, demonstrating that it enables quadruped robots to generalize to unseen terrains, payload variations, and speed ranges; drones to flight under unseen wind disturbances; aerial manipulators to achieve centimeter-level in-air capture despite wind and mass uncertainties; and acceleration differentiators to remain robust with distribution shift. These results show that physics-filtered feedback can serve as a powerful alternative to massive data scaling.

Jindou Jia, Shixu Han, Meng Wang et al. · 1 citation

Preprint Aug 2026

Scaling Curriculum Learning For Autonomous Driving

Batched simulators for autonomous driving have recently enabled training reinforcement learning (RL) agents at scale, encompassing thousands of traffic scenarios and billions of interactions within a matter of days. Although such high-throughput feeds RL algorithms faster than ever, their sample-efficiency has not kept pace: As the standard training scheme, domain randomization uniformly samples scenarios, thereby consuming a vast number of interactions on cases that contribute little to learning. Curriculum learning offers a remedy by adaptively prioritizing scenarios that matter most to policy improvement. We present CL4AD, the first integration of curriculum learning into batched autonomous driving simulators by framing scenario selection as an unsupervised environment design problem. We introduce utility functions that shape curricula based on success rates and the realism of the agent's behavior, in addition to existing regret-estimation functions. Large-scale experiments in GPUDRIVE demonstrate that curriculum learning achieves a 99% success rate a billion steps earlier than domain randomization, reducing wall-clock time by 77%, and outperforms heuristic curricula with static and dynamic attributes, with only one exception at the largest scale. An ablation under limited compute shows that curriculum learning improves sample efficiency by 67%. We also investigate how utility functions behave at scale, and how prioritized scenarios evolve during training. We release an implementation of CLForAD in GPUDRIVE.

Cevahir Koprulu, D. Paz, Feng Tao et al. · 0 citations

Preprint Jul 2026

Compressing the Validation Bottleneck: An Agentic Self-Driving Lab for Scientific Discovery

Agentic AI-for-Science can automate ideation, planning, and analysis, but final validation still depends on real experiments. A self-driving lab (SDL) can execute those experiments, yet the loop still has bottlenecks: the agent may spend too many rounds on low-value experiments, or each round may require a high-cost experiment. We target these two physical bottlenecks with one agent. First, a prior-aware agentic DOE loop uses domain knowledge and past results to propose feasible and informative next experiments, reducing trials-to-target. Second, a cost-aware surrogate agent predicts high-cost, high-resolution measurements from low-cost, low-resolution measurements. It chooses between a high- and a low-cost measurement based on the predicted uncertainty. We examine these directions in the biology and materials domains, respectively. Together, under a single agent, these components aim to accelerate the SDL loop by reducing both the number of loops and the cost per experiment.

Kyunghoon Hur, Chihun Lee · 0 citations