Search arXiv⌕ Search

arXiv · 2508.06642

Benchmarking Self-Driving Labs

Abstract

A key goal of modern materials science is accelerating the pace of materials discovery. Self-driving labs, or systems that select experiments using machine learning and then execute them using automation, are designed to fulfil this promise by performing experiments faster, more intelligently, more reliably, and with richer metadata than conventional means. This review summarizes progress in understanding the degree to which SDLs accelerate learning by quantifying how much they reduce the number of experiments required for a given goal. The review begins by summarizing the theory underlying two key metrics, namely acceleration factor AF and enhancement factor EF, which quantify how much faster and better an algorithm is relative to a reference strategy. Next, we provide a comprehensive review of the literature, which reveals a wide range of AFs with a median of 6, and that tends to increase with the dimensionality of the space, reflecting an interesting blessing of dimensionality. In contrast, reported EF values vary by over two orders of magnitude, although they consistently peak at 10-20 experiments per dimension. To understand these results, we perform a series of simulated Bayesian optimization campaigns that reveal how EF depends upon the statistical properties of the parameter space while AF depends on its complexity. Collectively, these results reinforce the motivation for using SDLs by revealing their value across a wide range of material parameter spaces and provide a common language for quantifying and understanding this acceleration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adedire D. Adesiji, Jiashuo Wang, Cheng-Shu Kuo, Keith A. Brown. 2025-08-08. Benchmarking Self-Driving Labs. https://arxiv.org/abs/2508.06642

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Physics-Driven Framework for Parametric Periodic-Flow Modeling and Finite-Amplitude Aeroelastic Response Analysis

Periodic unsteady flows are common in forced-motion and fluid-structure interaction problems. Their parametric analysis typically requires repeated high-fidelity simulations, whereas existing reduced-order and surrogate models generally rely on pre-generated flow-field or aerodynamic data. This study proposes a purely physics-driven framework for solving parametric periodic flows and finite-amplitude aeroelastic responses. First, a Periodic Physics-Informed Neural Network (P-PINN) is developed to directly solve periodic flows by imposing temporal periodicity over a single motion cycle, thereby avoiding the need to resolve the long transient evolution preceding the establishment of the periodic state. The flow conditions and motion parameters are further incorporated as network inputs to construct continuous parametric representations of the periodic flow field and aerodynamic forces. On this basis, the parametric aerodynamic model is coupled with the structural dynamic equation through first-order harmonic balance to solve the response amplitude and frequency of a single-degree-of-freedom aeroelastic system. This framework is validated using forced-motion cases of a circular cylinder and an airfoil, demonstrating accurate reproduction of periodic aerodynamic forces, surface load distributions, and instantaneous flow fields under different flow and motion parameters compared with time-marching results. Furthermore, aeroelastic analysis is conducted for an elastically mounted circular cylinder at subcritical Reynolds numbers, and the resulting aeroelastic response agrees well with fully coupled CFD/CSD results. Once trained offline, the parametric model can be repeatedly evaluated for different structural parameter states, enabling the complete aeroelastic response curve to be obtained online within seconds, without repeated long-time fluid-structure interaction time marching.

physics.comp-ph↗

Monte Carlo sampling of first-order QED processes in laser and pulsar plasmas

Monte Carlo sampling of strong-field quantum electrodynamics processes underpins simulations of high-intensity laser experiments and of astrophysical compact-object magnetospheres. Sampling an event requires the total rate of the process together with the cumulative probability that determines how energy is partitioned between the produced particles. Simulations typically tabulate both in advance and invert the tabulated probability numerically. Here we replace this procedure with elementary-function approximations for synchrotron radiation and the nonlinear Breit--Wheeler process. For each process, we approximate the auxiliary function that sets the total rate, as well as the cumulative probability, with Padé approximants chosen so that the inversion reduces to a quartic equation. This yields the sampled quantum parameter---electron $χ_e$ or photon $χ_γ$---in closed form. The approximations and the particle spectra sampled from them agree with the exact results to within $1\%$. The procedure requires no lookup tables, no interpolation, and no numerical root finding, and can be inserted directly into radiative particle-in-cell codes.

physics.comp-ph↗

CTrex: A Research-Oriented Framework for Kernel- and Projection-Level Algorithm Development in CT Reconstruction

Micro-computed tomography (micro-CT) is increasingly applied to imaging scenarios in which object motion, deformation, truncated fields of view, continuous rotation, or unconventional scanning protocols violate assumptions underlying classical reconstruction pipelines. Existing reconstruction frameworks efficiently support standard geometries and workflows but offer limited control over how projection operators are discretized and evaluated. This restricts methodological exploration when accuracy depends on ray sampling, interpolation, or operator coupling. We introduce CTrex, a research-oriented, GPU-accelerated iterative reconstruction framework that exposes the projection-correction-backprojection pipeline down to the kernel level. Rather than treating these operators as fixed black boxes, CTrex represents them as editable computational building blocks within a unified iterative structure. This allows non-ideal acquisition effects to be incorporated directly into the numerical operators rather than treated as external corrections. CTrex combines GPU-level accessibility with an extensible geometry formulation based on homogeneous-coordinate view matrices, allowing rigid and affine transformations, detector misalignments, and time-varying geometries to be expressed consistently. It supports circular, helical, offset, and conveyor-belt trajectories while keeping GPU kernels agnostic to the trajectory definition. Applications in motion- and deformation-aware reconstruction, event-based 4D imaging, cylindrical-coordinate reconstruction, and extended-field-of-view CT illustrate how operator-level adaptations enable strategies difficult to realize in conventional frameworks. CTrex provides a flexible platform for CT reconstruction research under realistic and unconventional imaging conditions.

physics.comp-ph↗