Differentiable simulations for particle tracking in accelerators: analysis, benchmarking and optimization
Francisco Huhn, Francesco M. Velotti

TL;DR
This paper develops and benchmarks a differentiable simulation code for particle accelerators, demonstrating its efficiency and accuracy over traditional finite-difference methods, and applying it to optimize beamline configurations.
Contribution
It introduces a novel auto-differentiation-based simulation framework for accelerator physics and provides the first comprehensive analysis and benchmarking against finite differences.
Findings
Differentiable code outperforms finite differences in efficiency and accuracy.
Gradient-based optimization with the new code is more effective than gradient-free methods.
Benchmarking confirms the suitability of the approach for real-world accelerator design.
Abstract
Optimization of beamlines and lattices is a common problem in accelerator physics, which is usually solved with semi-analytical methods and numerical optimization routines. However, these are usually of the gradient-free or finite-differences type, whose computational cost grows quickly with the number of optimization parameters. On the other hand, the cost of gradient-based optimization can scale well with the number of parameters, but only if the computation of the gradient is itself efficient (e.g. not via finite differences, which are inefficient). Recently, there has been an emergence of so-called "differentiable" codes that efficiently provide gradients. Nevertheless, analysis and benchmarking comparisons of these techniques have largely been absent from the literature. In this work, we develop our own differentiable code, via auto-differentiation. We analyze and benchmark…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
