Review and experimental benchmarking of machine learning algorithms for efficient optimization of cold atom experiments

The generation of cold atom clouds is a complex process which involves the optimization of noisy data in high dimensional parameter spaces. Optimization can be challenging both in and especially outside of the lab due to lack of time, expertise, or access for lengthy manual optimization. In recent y...

Full description

Saved in:
Bibliographic Details
Published in:Machine learning: science and technology Vol. 5; no. 2; pp. 25022 - 25035
Main Authors: Anton, Oliver, Henderson, Victoria A, Da Ros, Elisa, Sekulic, Ivan, Burger, Sven, Schneider, Philipp-Immanuel, Krutzik, Markus
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01-06-2024
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The generation of cold atom clouds is a complex process which involves the optimization of noisy data in high dimensional parameter spaces. Optimization can be challenging both in and especially outside of the lab due to lack of time, expertise, or access for lengthy manual optimization. In recent years, it was demonstrated that machine learning offers a solution since it can optimize high dimensional problems quickly, without knowledge of the experiment itself. In this paper we present results showing the benchmarking of nine different optimization techniques and implementations, alongside their ability to optimize a rubidium (Rb) cold atom experiment. The investigations are performed on a 3D 87 Rb molasses with 10 and 18 adjustable parameters, respectively, where the atom number obtained by absorption imaging was chosen as the test problem. We further compare the best performing optimizers under different effective noise conditions by reducing the signal-to-noise ratio of the images via adapting the atomic vapor pressure in the 2D+ magneto-optical trap and the detection laser frequency stability.
Bibliography:MLST-101844.R1
ISSN:2632-2153
2632-2153
DOI:10.1088/2632-2153/ad3cb6