Bayesian optimisation for fast and safe parameter tuning of SwissFEL

Parameter tuning is a notoriously time-consuming task in accelerator facilities. As tool for global optimization with noisy evaluations, Bayesian optimization was recently shown to outperform alternative methods. By learning a model of the underlying function using all available data, the next evaluation can be chosen carefully to ind the optimum with as few steps as possible and without violating any safety constraints. However, the per-step computation time increases signiicantly with the number of parameters and the generality of the approach can lead to slow convergence on functions that are easier to optimize. To overcome these limitations, we divide the global problem into sequential subproblems that can be solved eiciently using safe Bayesian optimization. This allows us to trade of local and global convergence and to adapt to additional structure in the objective function. Further, we provide slice-plots of the function as user feedback during the optimization. We showcase how we use our algorithm to tune up the FEL output of SwissFEL with up to 40 parameters simultaneously, and reach convergence within reasonable tuning times in the order of 30 minutes (< 2000 steps).

[1]  A. Scheinker Applying Artificial Intelligence to Accelerators , 2018 .

[2]  Andreas Krause,et al.  Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces , 2019, ICML.

[3]  Nando de Freitas,et al.  Taking the Human Out of the Loop: A Review of Bayesian Optimization , 2016, Proceedings of the IEEE.

[4]  Carsten Rockstuhl,et al.  Benchmarking Five Global Optimization Approaches for Nano-optical Shape Optimization and Parameter Reconstruction , 2018, ACS Photonics.

[5]  Mikako Makita,et al.  SwissFEL Aramis beamline photon diagnostics , 2018, Journal of synchrotron radiation.

[6]  Peter I. Frazier,et al.  A Tutorial on Bayesian Optimization , 2018, ArXiv.

[7]  Xiaobiao Huang,et al.  Robust simplex algorithm for online optimization , 2018, Physical Review Accelerators and Beams.

[8]  M. Scholz,et al.  On-Line Optimization of European XFEL with OCELOT , 2017 .

[9]  Alkis Gotovos,et al.  Safe Exploration for Optimization with Gaussian Processes , 2015, ICML.

[10]  Optimized Beam Matching Using Extremum Seeking , 2005, Proceedings of the 2005 Particle Accelerator Conference.

[11]  Stefano Ermon,et al.  Bayesian Optimization of FEL Performance at LCLS , 2016 .

[12]  Xiaobiao Huang,et al.  Online optimization of storage ring nonlinear beam dynamics , 2015, 1502.07799.

[13]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[14]  Petros Koumoutsakos,et al.  Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[15]  Andreas Krause,et al.  Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.