Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research introduces a surrogate-free Bayesian inversion framework for neutron reflectometry that replaces slow Markov-Chain Monte-Carlo methods with exact gradient-based inference. By computing gradients directly through physical governing equations rather than using machine learning surrogates, the approach reduces uncertainty quantification from hours to seconds while preserving interpretability. The work delivers an open-source Python library of reflectometry kernels designed for high-complexity materials analysis in fast kinetic configurations.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Towards real-time surrogate-free Bayesian inversion for neutron reflectometry

arXiv2 min read

arXiv:2509.06924v3 Announce Type: replace Abstract: Neutron reflectometry (NR) is a key enabling technology for many areas of scientific development. Although the forward reflectivity model is well-known, inferring the physical properties of a sample from NR data requires the solution of an inverse problem. Increasingly, beamline scientists are using NR in fast kinetic configurations and probing highly-complex structures and interfaces, introducing significant uncertainty. Existing uncertainty quantification (UQ) approaches in NR, such as Markov-Chain Monte-Carlo (MCMC), suffer from poor sample efficiency and slow convergence times. Recently, surrogate machine learning models have been proposed as an alternative. However, physical intuition is lost when replacing governing equations with fast surrogates. Instead, we propose a rapid, surrogate-free Bayesian inversion for NR. Our approach offers a step-change in inference speed and efficiency. For the first time in NR, exact gradients through the reflectivity are computed, enabling highly performant gradient-based inference schemes: Hamiltonian Monte-Carlo offers significant advances in sample efficiency compared to MCMC. Variational inference enables approximate UQ on the order of seconds rather than hours. We demonstrate state-of-the-art performance on a thick oxide quartz film, and robust co-fitting performance in the high complexity regime of organic LED multilayer devices. Additionally, we provide an open-source library of reflectometry kernels in the python language.

Abstract:Neutron reflectometry (NR) is a key enabling technology for many areas of scientific development. Although the forward reflectivity model is well-known, inferring the physical properties of a sample from NR data requires the solution of an inverse problem. Increasingly, beamline scientists are using NR in fast kinetic configurations and probing highly-complex structures and interfaces, introducing significant uncertainty. Existing uncertainty quantification (UQ) approaches in NR, such as Markov-Chain Monte-Carlo (MCMC), suffer from poor sample efficiency and slow convergence times. Recently, surrogate machine learning models have been proposed as an alternative. However, physical intuition is lost when replacing governing equations with fast surrogates. Instead, we propose a rapid, surrogate-free Bayesian inversion for NR. Our approach offers a step-change in inference speed and efficiency. For the first time in NR, exact gradients through the reflectivity are computed, enabling highly performant gradient-based inference schemes: Hamiltonian Monte-Carlo offers significant advances in sample efficiency compared to MCMC. Variational inference enables approximate UQ on the order of seconds rather than hours. We demonstrate state-of-the-art performance on a thick oxide quartz film, and robust co-fitting performance in the high complexity regime of organic LED multilayer devices. Additionally, we provide an open-source library of reflectometry kernels in the python language.

Machine Learning (cs.LG); Materials Science (cond-mat.mtrl-sci)

arXiv:2509.06924 [cs.LG]

(or arXiv:2509.06924v3 [cs.LG] for this version)

Full text under the publisher's open licence · 215 words

Related coverage