How to find the thickness of a crystal without trying thousands of options ✛ ✎

Original: "Scalable Bayesian Optimization of Composite Functions for Image-Based Inverse Problems in Materials Characterization"
arXiv:2609.02126v1 · 2026-09-02 · arXiv non-exclusive · independent analysis · 1 min
Scientists have compressed a diffraction pattern from 24,649 pixels down to 11 numbers, and found the sample's thickness and tilt in just 50 simulations.

A translator at negotiations doesn't listen to every word; they grasp the meaning of whole phrases. Similarly, the new method SBOCF doesn't compare every pixel of a diffraction pattern with a simulation. It cuts the image into nine squares, like a page into paragraphs, and for each square it sums the brightness. Instead of 24,649 pixels, you're left with 11 numbers: nine sums and two correction coefficients.

These 11 numbers are modeled by cheap stand-ins for expensive simulations, called Gaussian processes. A smart search, like an experienced negotiator, chooses the next set of thickness and tilt that promises the greatest improvement. On a synthetic sample with a thickness of 380 Å and a tilt of 1.5 mrad, the method reduced the error by a factor of 290 compared to the old approach, using only 50 simulations.

Previously, for each new material you had to run thousands of simulations or train a neural network on a large library. SBOCF requires no training: it uses only the structure of the problem and 50 simulations.

A translator who hears the meaning of whole phrases works faster and more accurately. Likewise, SBOCF finds the thickness and tilt of a crystal in 50 simulations and helps build precise maps of atoms. The method can already be applied in electron microscopes, and in the future, in X-ray diffraction.

The number of modeled outputs dropped from 24,649 to 11, a reduction of more than 2000 times, while the final error decreased by up to 290 times. If each simulation took an hour, a full grid search over a million points would take 114 years, but SBOCF does it in 50 hours.

f(x) = \sum_{k=1}^{M}\sum_{\ell=1}^{M} (y_{k,\ell}(x) - y^{true}_{k,\ell})^2
Objective function to be minimized for parameter estimation
f(x) = \epsilon(x) f_P(x) + \delta(x)
Relation between pixel-level and patch-level errors
Concepts
single pixel imaging image reconstruction x ray imaging optimization synthetic images Stochastic modeling information criterion image classification optimization problem 3d reconstruction signal decomposition bayesian hierarchical model least squares fitting photographic body analysis