betaFeedback

WorksPhysics and Astronomy

Time-Varying Bayesian Optimization and Extremum Seekingfor Drift-Tube Linac Tuning at LANSCE

Abstract

Bayesian optimization (BO) has emerged as a promising machine learning approach to accelerator tuning. It has the advantage of being able to incorporate prior information, including simulation and historical data, and explicitly model measurement noise. However, standard implementations can produce large, abrupt parameter updates that are undesirable and potentially unsafe in accelerator operation. They may also spend excessive time exploring less promising regions of the search space. We address these limitations by imposing soft and hard step size limits. We evaluate these methods by adjusting the radio frequency settings of the drift tube linac (DTL) at the Los Alamos Neutron Science Center (LANSCE) to maximize the particle count at the end of the linac. We first test the methods in simulation with constant exogenous parameters, then repeat the tests with drifting exogenous parameters. Under drifting conditions, progressively reducing the BO step size limit improved convergence. We also find that an initial BO segment followed by extremum seeking (ES), an approach we call BO-ES, combines BO's use of prior information and sample efficiency with ES's effectiveness in local optimization and drift tracking. Finally, tests on the LANSCE accelerator with BO-ES demonstrate an approximately 25%25\% reduction in losses at the end of the linac across different configurations of historical and simulation data.

Introduction

Bayesian optimization (BO) [1–3] is well suited for optimizing black-box objective functions whose analytic form is unknown. In many practical settings, convergence and overall performance can be improved by incorporating prior information, including historical data, simulation outputs, or physics-based constraints.

Particle accelerators pose a challenging optimization problem because of their complexity, continual drift, and unknown parameters. BO has been applied to accelerator tuning [8] [4, 5, 6, 7]; see Ref. [9] for a review. Safety is also critical: equipment damage can be costly, and downtime reduces available beam time. These concerns have motivated research into safety-constrained accelerator optimization [9, 10].

In this work, we focus on the important problem of optimizing the drift-tube linac (DTL) at the Los Alamos Neutron Science Center (LANSCE) [11]. The DTL operating point varies over time due to temperature fluctuations, magnetic hysteresis, component replacement, and gradual wear, among other effects, such that settings that are optimal at one time may be suboptimal later. These variations occur on both long timescales (e.g., across operating periods) and short timescales (e.g., within a single run).

Applying standard (“vanilla”) Bayesian optimization to accelerators carries substantial risks, as wildly swinging accelerator parameters can cause internal systems to take longer to regain stability or even cause catastrophic failure. Vanilla Bayesian optimization is also for static situations. Modifications must be made to deal with dynamic situations. While there are methods to deal with these dynamic situations, some of which we examine, there is another algorithm, bounded extremum seeking (ES) [12], which is very well-suited for the task [13, 14, 15, 16]. ES works locally and is model-independent, therefore it is robust for quickly time-varying conditions with large distribution shifts for which memorizing prior information can be misleading and can degrade performance.

Here we introduce a novel method of combining step-size-limited Bayesian optimization with extremum seeking, which we call BO-ES. Previous work has found that combining ES and deep reinforcement learning led to improvements in controlling time-varying systems [17]. The initial BO stage incorporates simulation and historical data to reach a promising solution basin quickly. The algorithm then switches to ES, which is a good local optimizer that can handle drifting conditions.

First, we examine the static optimization case in simulation in § 2. Next, the dynamic case in simulation is examined in Section III, where we have drifting exogenous parameters. Then, we test online on the LANSCE accelerator in Section IV. We conclude in § 2.4.

Simulating Static Parameter Mismatch

Problem Statement

Here we consider an optimization problem in which the accelerator model is mismatched with the physical machine. The system is assumed to operate at nominal, fixed exogenous parameters a\mathbf{a}; however, the true exogenous parameters are a′\mathbf{a}', which are unknown to the user. This discrepancy may arise from imperfect parameter estimation and/or from intrinsic drift in the accelerator over time. Given this model–machine mismatch, our objective is to select the control variables x\mathbf{x} to maximize the particle count measured at the end of the accelerating section.

We first evaluate the approach in simulation, where the ground-truth optimum can be reasonably estimated, enabling a quantitative performance assessment. This also allows us to identify methods that achieve high performance while maintaining conservative, safety-aware operating trajectories before deploying the approach on the physical accelerator.

While the accelerator can be treated as a complete black box, we wish to make use of the rich, physical information available from simulation data. While simulation can be incorporated via a prior mean function [19, 20], we instead assume simulation is close to reality and model the residual correction. This has the advantage of clearly separating what simulation is and is not capturing.

We model the particle-count objective, C(x,a′)C(\mathbf{x},\mathbf{a}^{\prime}), using the latent surrogate:

g(x,a′)=f(x,a)+δa,a′(x),(1)g(\mathbf{x},\mathbf{a}^{\prime}) = f(\mathbf{x},\mathbf{a}) + \delta_{\mathbf{a},\mathbf{a}^{\prime}}(\mathbf{x}), \tag*{(1)}

where:

  • g(x,a′)g(\mathbf{x},\mathbf{a}^{\prime}) models the objective without measurement noise, with unknown a′\mathbf{a}^{\prime};

  • f(x,a)f(\mathbf{x},\mathbf{a}) is a surrogate model for the simulation with a fixed setting of a\mathbf{a};

  • δa,a′(x)\delta_{\mathbf{a},\mathbf{a}^{\prime}}(\mathbf{x}) models the discrepancy between the surrogate simulation and the actual system.

Measurement noise enters through observations:

yi=g(xi,a′)+ϵi.y_i = g(\mathbf{x}_i,\mathbf{a}^{\prime}) + \epsilon_i.

We model both ff and δa,a′\delta_{\mathbf{a},\mathbf{a}^{\prime}} as Gaussian processes (GPs) [21], each with its own mean function and kernel (§ 2 C). The surrogate f(x,a)f(\mathbf{x},\mathbf{a}) is trained offline using simulation data, since the full high-fidelity simulator is computationally expensive and running it during operations would be infeasible. During online optimization, f(x,a)f(\mathbf{x},\mathbf{a}) is held frozen, while δa,a′(x)\delta_{\mathbf{a},\mathbf{a}^{\prime}}(\mathbf{x}) gets updated with new data.

Data

The synthetic data are generated using HPSim [22], with a model of LANSCE. In each accelerating cavity ii, there is an oscillating voltage, Vi(t)V_i(t):

Vi(t)=Aicos⁡(2πfRFt+ϕi).V_i(t) = A_i \cos(2\pi f_{\mathrm{RF}} t + \phi_i).

where tt denotes physical time, AiA_i is the voltage amplitude, ϕi\phi_i is the phase, and fRF=201.25f_{\mathrm{RF}} = 201.25 MHz is the nominal radio frequency (RF) of the DTL. Nominal phases and amplitudes can differ from their actual machine values due to thermal fluctuations, machine wear, and other unmodeled effects.

Particles enter the DTL with 0.74 MeV, are accelerated and exit at 100 MeV (see Figure 1). While LANSCE accelerates both H+H^{+} and H−H^{-}, we will focus exclusively on the latter, since it is the only species that makes it to the end of the linac. The control variable, x\mathbf{x}, represents the RF settings of amplitude and phase for cavities of the 4 modules of the DTL:

Schematic of LANSCE DTL and CCL sections

Figure 1. Schematic of LANSCE DTL and CCL sections. A single DTL module consists of a large tank, which acts as a resonator. Each tank supports an oscillating electric field inside, E(t)\mathbf{E}(t), with a nominal frequency of 201.25 MHz. When E(t)\mathbf{E}(t) is pointing in the direction of beam propagation, synchronous particles are in the gaps between the tubes and become accelerated. When the electric field is pointing in the opposite direction, the particles are in one of several drift tubes (only two depicted), each of which acts as a Faraday cage and shields the beam from the decelerating field. The drift tubes are aligned along the tank axis and are suspended by an upper support structure. The RF settings of the DTL are denoted as x\mathbf{x}. DTLs are efficient for accelerating particles with 0.04≲β≲0.50.04 \lesssim\beta\lesssim0.5 [18]. At higher speeds, the CCL modules are more efficient. Each of these modules consists of multiple adjacent cavities where the oscillating electric fields (nominal frequency: 805 MHz) inside them are out of phase with their neighbors, such that synchronous particles only see an accelerating phase at each cavity (side cavities not depicted in the image). The nominal RF settings for the CCL are denoted by a\mathbf{a}.

x={(Ai,ϕi)∣i=1,2,3,4}∈R8.\mathbf{x} = \{(A_i,\phi_i)\mid i=1,2,3,4\} \in\mathbb{R}^{8}.

RF amplitudes are expressed in the percentage units used by the LANSCE control system, and phases are expressed in degrees.

After the DTL, the H−H^{-} particles enter the Coupled-Cavity Linac (CCL) section [23] (see Figure 1). The exogenous parameters are given by the RF settings, again amplitudes and phases, for the 44 modules in the CCL:

a={(Ai,ϕi)∣i=5,…,48}∈R88.\mathbf{a} = \{(A_i,\phi_i)\mid i=5,\ldots,48\} \in\mathbb{R}^{88}.

In the CCL, the H−H^{-} particles are accelerated to 800 MeV. Here we train f(x,a)f(\mathbf{x},\mathbf{a}) on N=2,000N = 2,000 samples with a fixed a\mathbf{a} and with x\mathbf{x} being uniformly sampled between ±3\pm3 %/deg. of the nominal setting. The bounds were narrow as the particle count at the end of the linac section is extremely sensitive to x\mathbf{x}. Many settings produced an extremely low particle count (see Appendix A), which gives the model information about settings to avoid.

During the optimization process, the true exogenous parameters will be given by a random perturbation of the nominal values by

a′=a+η,(2)\mathbf{a}' = \mathbf{a} + \boldsymbol{\eta}, \tag*{(2)}

where η∼Unif⁡([−10,10]88)\boldsymbol{\eta} \sim\operatorname{Unif}([-10,10]^{88}) (%/deg.). Note: η\boldsymbol{\eta} is fixed throughout the optimization process. Also, since the DTL is earlier in the acceleration process, the acceptable range for x\mathbf{x} is smaller than for a\mathbf{a}.

For optimization, we wish to maximize the number of particles remaining at the end of the linac section. HPSim is a particle-in-cell code and we used Nsim=220=1,048,576N_{\mathrm{sim}} = 2^{20} = 1,048,576 macroparticles in all simulations. Particles remaining along track elements in the simulation data can be seen in Appendix A. C(x,a)C(\mathbf{x},\mathbf{a}) denotes the percentage of particles remaining at the end of the linac. For examples of count throughout the linac, see Appendix A.

Methods

Training

Both the simulator surrogate and the corrector are modeled as GPs:

f(x,a)∼GP(μf(x),kf(x,x′)),(3)f(\mathbf{x},\mathbf{a}) \sim\mathcal{GP}(\mu_f(\mathbf{x}), k_f(\mathbf{x},\mathbf{x}')), \tag*{(3)}
δa,a′(x)∼GP(μδ(x),kδ(x,x′)).(4)\delta_{\mathbf{a},\mathbf{a}'}(\mathbf{x}) \sim\mathcal{GP}(\mu_\delta(\mathbf{x}), k_\delta(\mathbf{x},\mathbf{x}')). \tag*{(4)}

For both ff and δa,a′\delta_{\mathbf{a},\mathbf{a}'}, we use the same form of the prior mean function and kernel. For the prior mean function, a constant function of m(x)=cm(\mathbf{x}) = c is used, where cc is a hyperparameter. We expect f(x,a)f(\mathbf{x},\mathbf{a}) to be a good approximation (i.e., g(x,a′)≈f(x,a)g(\mathbf{x},\mathbf{a}') \approx f(\mathbf{x},\mathbf{a})), and thus the correction to be small: ∣f(x,a)∣≫∣δa,a′(x)∣|f(\mathbf{x},\mathbf{a})| \gg|\delta_{\mathbf{a},\mathbf{a}'}(\mathbf{x})|. Thus, we initialize with cδ=0c_\delta= 0. However, if the data do not support this assumption, it is updated via Bayes’ theorem.

To mimic real-world noisy measurements, the online observations are corrupted by independent Gaussian noise:

yi=g(xi,a′)+ϵi,ϵi∼N(0,σn2).y_i = g(\mathbf{x}_i,\mathbf{a}') + \epsilon_i,\qquad\epsilon_i \sim\mathcal{N}(0,\sigma_n^2).

We add measurement noise with standard deviation σn=2%\sigma_n = 2\%. This value is not provided to the optimizer; the noise variance is inferred from the data when fitting the correction GP. Observation noise is represented separately from the latent-function kernel, through the term σn2I\sigma_n^2 I in the GP likelihood and posterior equations. For the latent-function kernel, we use the RBF-dd (dd-dimensional radial basis function):

k(x,x′)=σf2exp⁡(−12(x−x′)TΛ−1(x−x′)),(5)k(\mathbf{x},\mathbf{x}') = \sigma_f^2 \exp\left(-\frac{1}{2}(\mathbf{x}-\mathbf{x}')^{T}\Lambda^{-1}(\mathbf{x}-\mathbf{x}')\right), \tag*{(5)}

where Λ−1=diag⁡(1/ℓ12,…,1/ℓd2)\Lambda^{-1} = \operatorname{diag}(1/\ell_1^2,\ldots,1/\ell_d^2) and here d=8d = 8. This provides each dimension its own length scale, ℓi\ell_i. Alternatively, one can use a single length scale for all control variable dimensions. This has the disadvantage of not taking into account the different roles each xix_i plays. In addition, early testing showed this strategy to have less stable behavior (see Appendix A). Note that the simulation has some stochasticity due to numerical errors; thus, even for ff we have σf2≠0\sigma_f^2 \ne0. However, this is generally smaller than the measurement error we will consider.

For a set of data, D={(xj,yj)∣j=1,…,n}\mathcal{D} = \{(\mathbf{x}_j,y_j)\mid j=1,\ldots,n\} and input matrix X={xj∣j=1,…,n}X = \{\mathbf{x}_j\mid j=1,\ldots,n\}, the posterior GPs at an inquiry point x∗\mathbf{x}_* have mean and covariance [21]:

μ(x∗)=m(x∗)+k∗T(K+σn2I)−1(y−mX),(6)\mu(\mathbf{x}_*) = m(\mathbf{x}_*) + \mathbf{k}_*^{T}(K+\sigma_n^2 I)^{-1}(\mathbf{y}-\mathbf{m}_X), \tag*{(6)}
Σ(x∗)=k(x∗,x∗)−k∗T(K+σn2I)−1k∗,(7)\Sigma(\mathbf{x}_*) = k(\mathbf{x}_*,\mathbf{x}_*) - \mathbf{k}_*^{T}(K+\sigma_n^2 I)^{-1}\mathbf{k}_*, \tag*{(7)}

where:

y=(y1,…,yn)\mathbf{y} = (y_1,\ldots,y_n)
mX=(m(x1),…,m(xn))\mathbf{m}_X = (m(\mathbf{x}_1),\ldots,m(\mathbf{x}_n))
k∗=(k(x∗,x1),…,k(x∗,xn))\mathbf{k}_* = (k(\mathbf{x}_*,\mathbf{x}_1),\ldots,k(\mathbf{x}_*,\mathbf{x}_n))
K=(k(x1,x1)⋯k(x1,xn)⋮⋱⋮k(xn,x1)⋯k(xn,xn)).K = \begin{pmatrix} k(\mathbf{x}_1,\mathbf{x}_1) & \cdots& k(\mathbf{x}_1,\mathbf{x}_n) \\ \vdots& \ddots& \vdots\\ k(\mathbf{x}_n,\mathbf{x}_1) & \cdots& k(\mathbf{x}_n,\mathbf{x}_n) \end{pmatrix}.

The hyperparameters of the mean function and kernel are fitted to minimize the negative log likelihood, L\mathcal{L}:

L=−log⁡p(y∣X,c,ℓ,σf2,σn2)=12(y−mX)T(K+σn2I)−1(y−mX)+12log⁡[det⁡(K+σn2I)]+n2log⁡(2π).(8)\begin{aligned} \mathcal{L} &= -\log p(\mathbf{y}\mid X,c,\ell,\sigma_f^2,\sigma_n^2) \\ &= \frac{1}{2}(\mathbf{y}-\mathbf{m}_X)^{T}(K+\sigma_n^2 I)^{-1}(\mathbf{y}-\mathbf{m}_X) \\ &\quad+ \frac{1}{2}\log[\det(K+\sigma_n^2 I)] + \frac{n}{2}\log(2\pi). \tag*{(8)} \end{aligned}

For ff, this is done offline with the full training data. For δa,a′\delta_{\mathbf{a},\mathbf{a}'}, this is done every fifth iteration during online optimization, using residual targets ri=yi−μf(xi)r_i = y_i - \mu_f(\mathbf{x}_i), where μf(xi)\mu_f(\mathbf{x}_i) is the posterior mean from simulation GP at the fixed nominal exogenous parameters a\mathbf{a}. A fully Bayesian method would treat the hyperparameters as distributions and integrate over them. This, however, would be prohibitively computationally expensive.

Acquisition Functions

Bayesian optimization admits a variety of acquisition functions to explore parameter space. One can sample a function from a GP posterior, analogous to sampling a vector from a multivariate normal distribution. This is done in Thompson sampling [24, 25], which selects candidate points by drawing a sample function from the current Gaussian-process posterior:

αTS∼GP.(9)\alpha^{\mathrm{TS}} \sim\mathcal{GP}. \tag*{(9)}

Then, at time iteration tt, the next inquiry point, xt\mathbf{x}_t, is the maximizer of that sample function:

xt=arg max⁡x αTS(x).(10)\mathbf{x}_t = \underset{\mathbf{x}}{\operatorname{arg\,max}}\ \alpha^{\mathrm{TS}}(\mathbf{x}). \tag*{(10)}

During online optimization, the simulation GP remains fixed, while the correction GP is updated using residuals ri=yi−μf(xi)r_i = y_i - \mu_f(\mathbf{x}_i). For Thompson sampling, we approximate the latent surrogate gg by treating the two GPs as independent and summing their posterior means and covariances. This retains the simulation surrogate’s uncertainty but neglects the posterior dependence between the simulation and correction processes induced by the online observations. Measurement noise enters the correction-GP likelihood and is not added to the latent covariance used for Thompson sampling.

Relative to alternatives such as upper confidence bound (UCB), Thompson sampling is attractive because it avoids introducing an explicit exploration–exploitation hyperparameter that needs to be properly tuned (e.g., the UCB β\beta parameter), while still enjoying strong theoretical guarantees, including asymptotic optimality under certain conditions [26].

We consider two ways to modify the acquisition function to ensure a new inquiry, xt\mathbf{x}_t, does not stray too far from the previous one, xt−1\mathbf{x}_{t-1}. First, we do it with the soft constraint of Proximal Biasing [27], a method we call BO-ProxBias, which modifies the acquisition function with a Gaussian factor:

αPB(xt−1,xt)=exp⁡(−∥xt−1−xt∥22σPB2)×αTS(xt).(11)\alpha^{\mathrm{PB}}(\mathbf{x}_{t-1},\mathbf{x}_t) = \exp\left(-\frac{\lVert\mathbf{x}_{t-1}-\mathbf{x}_t\rVert^2}{2\sigma_{\mathrm{PB}}^2}\right) \times\alpha^{\mathrm{TS}}(\mathbf{x}_t). \tag*{(11)}

This biases the acquisitions toward nearby points. Since we need small step sizes, σPB\sigma_{\mathrm{PB}} will generally be much smaller than the scale of the global bounds. This means the acquisition values for most global points become negligibly small for Eq. (11). The standard practice to identify the maximizer of the Thompson sampling acquisition function is to use Sobol sequence sampling [28]; however, in high-dimensional settings, global Sobol sampling becomes increasingly sparse and the acquisition function is nearly all zero for all samples. This causes the maximization procedure to resemble selection from an approximately uniform distribution across the global space, leading to large jumps, which we are trying to avoid. Substantially increasing the number of Sobol samples would mitigate this sparsity but at prohibitive computational cost. Furthermore, because the proximal factor decays as exp⁡(−∥xt−1−xt∥22σPB2)\exp\left(-\frac{\lVert\mathbf{x}_{t-1}-\mathbf{x}_t\rVert^2}{2\sigma_{\mathrm{PB}}^2}\right), candidates farther than 5σPB5\sigma_{\mathrm{PB}} are

Algorithm 1 Step-Constrained BO with Thompson Sampling

Require: Simulation data Dsim\mathcal{D}_{\mathrm{sim}}, parameter bounds, iterations TT

Require: Step control ∈{ProxBias,StepLmt}\in\{\mathrm{ProxBias},\mathrm{StepLmt}\}, scales σPB,smax⁡\sigma_{\mathrm{PB}},s_{\max}, refit period KK

  1. Fit simulation GP ff on Dsim\mathcal{D}_{\mathrm{sim}} and freeze it

  2. Initialize g∼GP(0,kg)g \sim\mathcal{GP}(0,k_g), Dδ←∅\mathcal{D}_\delta\leftarrow\varnothing, and x0←xnom\mathbf{x}_0 \leftarrow\mathbf{x}_{\mathrm{nom}} Previous best setting

  3. for t=1,…,Tt=1,\ldots,T do

  4. Compute the correction-GP posterior from Dδ\mathcal{D}_\delta

  5. Combine its mean and covariance with those of frozen ff Independent-GP approximation

  6. Draw a Thompson sample from the combined posterior

  7. if step control = ProxBias then

  8. Select xt\mathbf{x}_t using proximal bias with scale σPB\sigma_{\mathrm{PB}} Eq. (11)

  9. else

  10. Select xt\mathbf{x}_t using hard step limit smax⁡s_{\max} Eq. (12)

  11. end if

  12. Enforce parameter bounds and evaluate yty_t at xt\mathbf{x}_t

  13. rt←yt−μf(xt)r_t \gets y_t-\mu_f(\mathbf{x}_t)

  14. Append (xt,rt)(\mathbf{x}_t,r_t) to Dδ\mathcal{D}_\delta

  15. Refit correction-GP hyperparameters every KK iterations

  16. end for

  17. xtbest←arg max⁡t∈{1,…,T} yt\mathbf{x}_{t_{\mathrm{best}}} \gets\underset{t\in\{1,\ldots,T\}}{\operatorname{arg\,max}}\ y_t

  18. return xtbest\mathbf{x}_{t_{\mathrm{best}}}

down-weighted by a factor of ∼10−6\sim10^{-6}. Given the observed scale of Thompson samples, such points are extremely unlikely to maximize the weighted acquisition. Consequently, in running BO-ProxBias we restrict candidate generation to a local Sobol hypercube of width ±5σPB\pm5\sigma_{\mathrm{PB}} centered at the previous evaluation point, after which the Gaussian proximity weighting is applied. For this work, we use σPB=0.1\sigma_{\mathrm{PB}}=0.1 (%/deg.).

Alternatively, we enforce a hard per-dimension step-size limit:

αSL(xt−1,xt)={αTS(xt)if ∣xt−1i−xti∣≤smax⁡i, ∀i−∞otherwise.(12)\alpha^{\mathrm{SL}}(\mathbf{x}_{t-1},\mathbf{x}_t)= \begin{cases} \alpha^{\mathrm{TS}}(\mathbf{x}_t) & \text{if } |x_{t-1}^{i}-x_t^{i}| \le s_{\max}^{i},\ \forall i\\ -\infty& \text{otherwise.} \end{cases} \tag*{(12)}

All step constraints are applied in raw units (percent for the amplitudes, degrees for the phases). For all ii, we set smax⁡i=0.2s_{\max}^{i}=0.2 (%/deg.). As with Proximal Biasing, we generate candidates only within a local hypercube centered at xt−1\mathbf{x}_{t-1}.

One could also put explicit safety limits, such as requiring the count to always remain above a certain value. In the results, we will see that having constraints on the step sizes effectively maintains a high count in our tests.

Models

Four methods are evaluated:

  1. BO-Vanilla: standard Bayesian optimization with Thompson Sampling,

  1. BO-ProxBias: Bayesian optimization with proximal biasing, implemented by multiplying the Thompson sampled acquisition function by a Gaussian weighting factor as in Eq. (11),

  1. BO-StepLmt: Bayesian optimization with explicit step-size limits on successive control updates, as in Eq. (12),

  1. Nelder–Mead: a classical, derivative-free optimizer that uses simplexes, included as a baseline.

All the steps for BO-ProxBias and BO-StepLmt can be seen in Algorithm 1.

For the GPs and BO, all training and online optimization were done with the packages BoTorch [29] and GPyTorch [30]. For Nelder-Mead, scipy.optimize [31] was used.

Experimental Setup

The simulation starts by evaluating the particle count using the previous best setting, x0x_0. Note: due to stochasticity from the numerics, each run will give different values for this. From there, each different method will run for 75 iterations (including x0∗x_0^*), with ten runs each.

Results and Analysis

Figure 2 shows the progression of each method. At first glance, Nelder–Mead appears to perform best, finding an optimal solution quicker. However, closer inspection reveals that this interpretation is misleading. First, as mentioned, we wish the control variables to vary slowly. Figure 3 shows boxplots of the step sizes. Nelder-Mead generally has substantially higher step sizes than BO-ProxBias and BO-StepLmt. BO-Vanilla does even worse.

Average noisy count measurements using BO methods and Nelder–Mead

Figure 2. Average of noisy count measurements using the three BO methods and Nelder-Mead. Each curve shows the mean of the 10 runs and the area shows plus/minus the standard error (SE = σ/n\sigma/\sqrt{n}).

Box plots of absolute step sizes for each method and control variable

Figure 3. Box plots of absolute step sizes for each method and control variable. Orange lines indicate medians; boxes span the 25th to 75th percentiles. Whiskers extend to the most extreme data points within 1.5 times the interquartile range of the box edges.

We can compare the solutions found with measurement noise and those found without. We estimated a reference optimum by running BO-Vanilla with measurement noise disabled for 250 iterations over 20 trials. BO-Vanilla was used as opposed to the other methods, as we wanted to avoid the possibility of finding just a local optimum. HPSim is a particle-in-cell code with some stochasticity entering in from sampling of the initial distribution given the Twiss parameters and emittance and also due to the finite number of macroparticles. As such, even with measurement noise turned off, the algorithm does not find a unique optimum. Figure 4 compares the solutions from each method against the noiseless reference distribution. Note: the simulation noise is of order σsim∼0.1−0.5%\sigma_{\mathrm{sim}} \sim0.1 - 0.5\%, consistent with a standard deviation of ∼1/Nsim\sim1/\sqrt{N_{\mathrm{sim}}}. This only changes the total noise variation slightly, as given the independence of measurement and simulation noise, the BO sees a total noise variation of σtot.=σmeas.2+σsim.2∼2.02%\sigma_{\mathrm{tot.}} = \sqrt{\sigma_{\mathrm{meas.}}^2 + \sigma_{\mathrm{sim.}}^2} \sim2.02\%.

Box plots of the 8 different variables being adjusted

Figure 4. Box plots of the 8 different variables being adjusted. The lined gray area represents the interquartile range of solutions found in the absence of measurement noise.

Using the mean and std. of the found optima, a metric of the diagonal Mahalanobis distance squared [32, 33],

S=∑i=18(xˉi∗−μref.,i)2σref.,i2,(13)S = \sum_{i=1}^{8} \frac{(\bar{x}_i^*-\mu_{\mathrm{ref.},i})^2}{\sigma_{\mathrm{ref.},i}^2}, \tag*{(13)}

can be used to determine closeness to the solution. In Eq. (13), xˉ∗\bar{x}^* is the mean final best setting across trials for a method; μref.\mu_{\mathrm{ref.}} and σref.\sigma_{\mathrm{ref.}} are the per-dimension mean and standard deviation, respectively, of the reference solution distribution. Table I shows that BO-ProxBias does best, and Nelder-Mead is much farther from the reference solution than the others.

MethodSS ↓\downarrow
BO-Vanilla13.99
BO-ProxBias13.08
BO-StepLmt16.65
Nelder–Mead26.58

Table I. Squared diagonal Mahalanobis distance SS (Eq. (13)) of xˉ∗\bar{x}^* for each method from the reference obtained without measurement noise. Boldface identifies the smallest distance. ↑\uparrow (↓\downarrow) indicates that higher (lower) values are better.

Finally, one can take the average of the best solution, xˉ∗\bar{x}^*, found in each method and evaluate it under the condition of no measurement noise. We repeat this evaluation 10 times to account for simulation noise, and the results can be seen in Figure 5 and Table II. BO-Prox does best, with BO-Step-Lmt being second, Nelder-Mead third and BO-Vanilla last. The results suggest that the high count found by Nelder-Mead was an artifact, and it was in fact chasing noise. This is borne out by the greater dispersion seen in Figure 5. All BO methods take into account noise and adjust accordingly during their search. The inferior solution found by BO-Vanilla, along with its wider step

MethodHPSim mean count ↑\uparrow (%)
BO-Vanilla81.58 ±\pm 0.04
BO-ProxBias82.96 ±\pm 0.02
BO-StepLmt82.33 ±\pm 0.02
Nelder–Mead82.05 ±\pm 0.05

Table II. Noiseless HPSim evaluation of optimized solutions. Values are reported as mean ±\pm standard error. Boldface identifies the highest mean count. ↑\uparrow (↓\downarrow) indicates that higher (lower) values are better.

Violin plots for the averaged best solution, $\bar{x}^{*}$, for each method evaluated under no measurement noise

Figure 5. Violin plots for the averaged best solution, xˉ∗\bar{x}^{*}, for each method evaluated under no measurement noise. Black horizontal bars represent the minimum, median, and maximum of each distribution. The simulations were run 30 times for each method.

sizes seen in Figure 3, supports the criticism that standard

Bayesian optimization wastes too much time exploring.

Simulating Dynamic Parameter Mismatch

Problem Statement

The problem is similar to that in the previous section, except now the exogenous parameters drift with time. Thus, in addition to the fixed perturbation η\boldsymbol{\eta} in Eq. (2), there is an iteration-dependent drift, d(t)\mathbf{d}(t):

a′(t)=a+d(t)+η.(14)\mathbf{a}'(t) = \mathbf{a} + \mathbf{d}(t) + \boldsymbol{\eta}. \tag*{(14)}

Here, exactly how the system is perturbed and how it is drifting are unknown to the optimizer; only the noisy measurements are known.

Data

We again work in simulation. Two drift terms that mimic real-world changing conditions will be considered:

Linear: di(t)=bitd_i(t) = b_i t,

di(t)=bit,(15)d_i(t) = b_i t, \tag*{(15)}

Sinusoidal: di(t)=Di(sin⁡(2πfit+Φi)−sin⁡Φi)d_i(t) = D_i \left(\sin(2\pi f_i t + \Phi_i) - \sin\Phi_i\right),

di(t)=Di(sin⁡(2πfit+Φi)−sin⁡Φi),(16)d_i(t) = D_i \left(\sin(2\pi f_i t + \Phi_i) - \sin\Phi_i\right), \tag*{(16)}

with parameterization chosen such that di(0)=0d_i(0) = 0. For each exogenous parameter, we assign values randomly and uniformly:

bi∼Unif⁡([0.025,0.075]),Di∼Unif⁡([0.25,1.5]),fi∼Unif⁡([0.01,0.025])⇒Tidrift∈[40,100],Φi∼Unif⁡([0,2π]).\begin{aligned} b_i &\sim\operatorname{Unif}([0.025, 0.075]),\\ D_i &\sim\operatorname{Unif}([0.25, 1.5]),\\ f_i &\sim\operatorname{Unif}([0.01, 0.025]) \Rightarrow T_i^{\mathrm{drift}} \in[40, 100],\\ \Phi_i &\sim\operatorname{Unif}([0, 2\pi]). \end{aligned}

Here, bib_i is the rate at which the ithi^{\mathrm{th}} parameter is drifting in the linear case, DiD_i is the sinusoidal drift amplitude, fif_i is its frequency in cycles per iteration, and Tidrift=1/fiT_i^{\mathrm{drift}} = 1/f_i is its period in iterations. Tuning is now more difficult than before, as the 88 exogenous variables are all changing, each with its own linear rate or amplitude, frequency, and phase.

Methods

Some of the previous methods were adapted for the dynamic case. Since Nelder-Mead is designed for static optimization, we do not employ it here.

Time-Varying BO

We explore time variation by exponentially weighting the data to emphasize more recent observations. In addition, an exponentially decaying step-size limit is introduced, with a half-life of 50 iterations. This was done because BO did not settle with a constant step-size limit in our tests. One possible explanation is excessive exploration, an issue that motivated the localized search used in trust-region Bayesian optimization (TuRBO) [34]. TuRBO adjusts its trust-region size adaptively, whereas our exponential decay schedule was selected empirically.

Extremum Seeking

Like Bayesian optimization, extremum seeking is an optimization method used when the analytic form of a function is unknown; see Table III for a comparison against BO. Coming from control theory, the approach oscillates the control variables, each with its own frequency. In the asymptotic limit of high frequencies, the average behavior of the system replicates gradient descent, despite the exact gradients not being directly available. The approach has a number of nice theoretical properties [35] and has been demonstrated to work in accelerator applications [10, 13, 15, 36, 37].

CharacteristicBayesian optimizationExtremum seeking (bounded)
Search scopeGlobalLocal
System knowledgePrior information can be incorporatedModel-free
Step-size limitsCan be imposedInherent step size
Drift trackingRequires model adaptationNaturally tracks drift
Computational burdenHigh; standard GP fitting scales as O(n3)O(n^3)Low; simple feedback update

Table III. Comparison of Bayesian optimization and bounded extremum seeking. Here nn is the number of observations used to fit the Gaussian process.

The continuous ES dynamics are:

dxidτ=2αωicos⁡(ωiτ+κJ),(17)\frac{dx^i}{d\tau} = \sqrt{2\alpha\omega_i}\cos(\omega_i\tau+ \kappa J), \tag*{(17)}

where τ\tau is a continuous algorithmic time parameter, rather than physical time or the overall iteration index tt. Here, α\alpha controls the dithering amplitude, ωi\omega_i is the angular frequency of the ithi^{\mathrm{th}} parameter, κ>0\kappa> 0 is the ES gain, and JJ is the objective to be minimized. We let ωi=riω\omega_i = r_i\omega for some ω\omega and require that rir_i and rjr_j not be integer multiples for i≠ji \ne j, to avoid resonances. For particle-count maximization, we use J=−CJ = -C.

On average, Eq. (17) produces gradient descent on JJ. For a proof sketch of why this holds in the 1D case, see Appendix B. For the multidimensional case and a more rigorous treatment, see Ref. [35].

For the discrete implementation, let j=1,2,…,nESj = 1, 2, \ldots, n_{\mathrm{ES}}. Define:

τj=jΔτ,Δτ=2π10ωmax⁡,ωmax⁡=max⁡iωi.\tau_j = j\Delta\tau,\qquad\Delta\tau= \frac{2\pi}{10\omega_{\max}},\qquad\omega_{\max} = \max_i \omega_i.

We update the ithi^{\mathrm{th}} component according to:

xji=xj−1i+Δτ2αωicos⁡(ωiτj+κJj−1),(18)x_j^i = x_{j-1}^i + \Delta\tau\sqrt{2\alpha\omega_i}\cos(\omega_i\tau_j + \kappa J_{j-1}), \tag*{(18)}

where Jj−1J_{j-1} is the measured objective at the preceding setting xj−1x_{j-1}. Thus, the first ES update uses the phase ωiΔτ\omega_i\Delta\tau and the measurement at the initial ES setting. The ES updates were calculated by mapping the accelerator settings xjix_j^i onto the interval [−1,1][-1,1]. This was done using the average and range of the global bounds.

Defining Δxji=xji−xj−1i\Delta x_j^i = x_j^i - x_{j-1}^i, Eq. (18) gives:

∣Δxji∣≤Δτ2αωi≤2π102αωmax⁡.\begin{aligned} \lvert\Delta x_j^i \rvert&\le\Delta\tau\sqrt{2\alpha\omega_i}\\ &\le\frac{2\pi}{10}\sqrt{\frac{2\alpha}{\omega_{\max}}}. \end{aligned}

Algorithm 2 BO-ES

Require: Frozen simulation GP ff, parameter bounds Require: Switch iteration nswitchn_{\mathrm{switch}}, total iterations TT Require: Initial movement scale s0s_0, halving interval HH, refit period KK Require: Step control ∈{StepLmt,ProxBias}\in\{\mathrm{StepLmt},\mathrm{ProxBias}\}; ES parameters

  1. Initialize x0\mathbf{x}_0 at the previous best setting, δ∼GP(0,kδ)\delta\sim\mathcal{GP}(0,k_\delta), and Dδ←∅D_\delta\leftarrow\emptyset

  2. for t=1,…,Tt = 1,\ldots,T do

  3. if t≤nswitcht \le n_{\mathrm{switch}} then ▷ BO phase

  4. st←s02−t/Hs_t \leftarrow s_0 2^{-t/H} ▷ Exponential decay

  5. Compute the correction-GP posterior using age-weighted data

  6. Combine its mean and covariance with those of frozen ff ▷ Independent-GP approximation

  7. Draw a Thompson sample from the combined posterior

  8. Select xt\mathbf{x}_t using the chosen step control at scale sts_t ▷ Hard limit or proximal bias

  9. else ▷ ES phase

  10. j←t−nswitchj \leftarrow t-n_{\mathrm{switch}}, Jj−1ES←−yt−1J^{\mathrm{ES}}_{j-1} \leftarrow-y_{t-1}

  11. Take an ES step from xt−1\mathbf{x}_{t-1} using Eq. (18) ▷ Starts from the last BO iterate

  12. end if

  13. Enforce parameter bounds and applicable step limits

  14. Evaluate the system at xt\mathbf{x}_t to obtain yty_t

  15. if t≤nswitcht \le n_{\mathrm{switch}} then

  16. rt←yt−μf(xt)r_t \leftarrow y_t-\mu_f(\mathbf{x}_t)

  17. Append (xt,t−1,rt)(\mathbf{x}_t,t-1,r_t) to DδD_\delta ▷ Timestamp for age weighting

  18. Refit correction-GP hyperparameters every KK iterations using age-weighted data

  19. end if

  20. end for

Thus, like BO-StepLmt, ES has a hard step-size limit.

The oscillation phase can be written as:

ωiτj=2πωi10ωmax⁡j.(19)\omega_i\tau_j=\frac{2\pi\omega_i}{10\omega_{\max}}j. \tag*{(19)}

Therefore, the angular frequency per ES update is ωiiter=2πωi/(10ωmax⁡)\omega_i^{\mathrm{iter}}=2\pi\omega_i/(10\omega_{\max}). This determines how quickly the ithi^{\mathrm{th}} parameter oscillates when JJ is constant.

Hybrid: BO-ES

BO and ES offer complementary advantages. BO can exploit prior information through its surrogate model to accelerate convergence, while ES is a model-free feedback method that is particularly well-suited to systems with time-varying or drifting optima. This motivates a hybrid strategy for our case:

  1. Initiate search using BO with step-size constraints.

  2. After nswitchn_{\mathrm{switch}} BO iterations, switch to ES.

For BO-ES, the ES update number in Eq. (18) is j=t−nswitchj=t-n_{\mathrm{switch}}. For the pseudocode implementation, see Algorithm 2.

In this framework, BO compensates for long-term, run-to-run drift and provides a good warm start, after which ES takes over and provides continuous within-run adaptation by persistently perturbing and updating the control parameters during operation. A further practical advantage is scalability: ES can operate indefinitely, while standard BO implementations based on Gaussian processes become increasingly computationally expensive as the number of iterations grows, due to the O(n3)O(n^3) cost of the required kernel matrix inversion. Furthermore, in settings where step size is not an issue, BO can start with a global search and ES can then hone in on a promising location—a potential global optimum. The hybrid strategy without step limits for BO has been used before for this task in minimizing power consumption for a vapor compression system [38].

Models

The following four models are run for this setup:

  1. No Update: remains at the previous optimal point, x0∗\mathbf{x}_0^*. This baseline method also shows how the system is fluctuating.

  2. ES: Extremum seeking with κ=32\kappa=32, 1≤ωi≤1.751\le\omega_i\le1.75, and α=1\alpha=1.

  3. BO: Bayesian optimization with an exponentially decreasing movement scale: s(t)=0.1×2−t/50s(t)=0.1\times2^{-t/50},

where tt is the overall iteration index. Also, an exponential iteration weighting is used to discount older data.

  1. BO-ES: Run BO through iteration nswitch=40n_{\mathrm{switch}} = 40, then begin ES at iteration nswitch+1n_{\mathrm{switch}} + 1. Hyperparameters are the same as for ES and BO.

Furthermore, both BO and BO-ES will be tested with the different step size constraints of Step Limit or Proximal Bias.

Results and Analysis

Progress for each method in the sinusoidal case can be seen in Figure 6. The noiseless count is shown (for a comparison of the noisy vs noiseless measurements, see Appendix C). Table IV shows several metrics of the optimization for each method over all 10 runs. The No Update method can be seen to be sinusoidal with a period of T≈75T \approx75. A first-order expansion of C(x,a′)C(\mathbf{x}, a') with perturbative terms given by Eq. (16) will give a sum of sines. We can expect a frequency of T∼1/Δf∼67T \sim1/\Delta f \sim67, which is in line with the curve. All other methods do significantly better than the No Update baseline.

Noiseless DTL Optimization Progress - Sinusoidal Drift

Figure 6. Noiseless progress for sinusoidal drift. Displayed are the mean and standard error (SE = σ/n\sigma/\sqrt{n}) of the 10 runs for each method.

MethodAvg. CtC_t ↑ (all, %)Avg. CtC_t ↑ (after 50, %)Avg. ∣ΔCt∣|\Delta C_t| ↓ (all, %)Avg. ∣ΔCt∣|\Delta C_t| ↓ (after 50, %)Bottom 1% ↑ (%)
No Update76.63 ± 0.0376.73 ± 0.040.47 ± 0.010.48 ± 0.0173.88
ES81.73 ± 0.0782.70 ± 0.020.42 ± 0.020.26 ± 0.0269.83
BO-StepLmt80.68 ± 0.0581.11 ± 0.050.38 ± 0.010.29 ± 0.0175.11
BO-ProxBias79.71 ± 0.0880.73 ± 0.070.49 ± 0.050.31 ± 0.0569.08
BO-ES-StepLmt81.70 ± 0.0582.40 ± 0.030.41 ± 0.010.35 ± 0.0275.11
BO-ES-ProxBias81.47 ± 0.0782.60 ± 0.030.48 ± 0.040.27 ± 0.0270.84

Table IV. DTL optimization statistics under sinusoidal drift. CtC_t is the particle count percentage at iteration tt, and ΔCt=Ct−Ct−1\Delta C_t = C_t - C_{t-1}. Boldface identifies the best-performing methods, including multiple methods in cases of a statistical tie. ↑ (↓) indicates that higher (lower) values are better.

ES and the BO-ES methods settle to a similar plateau after iteration ∼40\sim40. However, the count under ES in the beginning actually decreases and reaches a low count. This can be seen in Table IV, where the Bottom 1% of the runs for BO-ES-StepLmt is significantly higher than that of ES. ES eventually corrects itself and matches the BO-ES methods even before the switch, but that initial decrease is undesirable. Meanwhile, all methods using BO generally increase monotonically, though for each individual run this was not necessarily the case. However, the pure BO methods struggle with handling drift relative to the ES and BO-ES runs. The observed BO behavior may arise from the decreasing step size, but incorporating this feature nonetheless yielded superior performance. Thus, BO-ES makes good use of the surrogate simulation model, even though the current state of the accelerator does not match the offline training data exactly. It also deals well with drifting conditions.

The results for linear drift follow a similar pattern, as can be seen in Figure 7. The BO methods exhibit on average a nearly monotonic increase in particle count during the initial phase. However, the pure BO methods generally have more variability, as can be seen with the wider uncertainty bands in the later stages relative to the other methods. Although they outperform the No Update baseline on average, their final particle counts are comparable to those of the baseline within the uncertainty bounds. BO-ES-StepLmt again achieves high particle counts both on average and in the bottom 1%, as seen in Table V.

Noiseless DTL Optimization Progress - Linear Drift

Figure 7. Noiseless progress for linear drift. Displayed are the mean and standard error (SE = σ/n\sigma/\sqrt{n}) of the 10 runs for each method.

MethodAvg. CtC_t ↑ (all, %)Avg. CtC_t ↑ (after 50, %)Avg. ∣ΔCt∣|\Delta C_t| ↓ (all, %)Avg. ∣ΔCt∣|\Delta C_t| ↓ (after 50, %)Bottom 1% ↑ (%)
No Update77.51 ± 0.0278.02 ± 0.010.40 ± 0.010.41 ± 0.0175.63
ES81.29 ± 0.0681.99 ± 0.020.40 ± 0.020.25 ± 0.0275.70
BO-StepLmt80.53 ± 0.0680.88 ± 0.070.37 ± 0.020.27 ± 0.0275.78
BO-ProxBias79.84 ± 0.0680.56 ± 0.060.46 ± 0.040.29 ± 0.0575.88
BO-ES-StepLmt81.64 ± 0.0482.21 ± 0.030.35 ± 0.020.25 ± 0.0278.74
BO-ES-ProxBias80.93 ± 0.0782.07 ± 0.030.42 ± 0.040.25 ± 0.0275.62

Table V. DTL optimization statistics under linear drift. CtC_t is the particle count percentage at iteration tt, and ΔCt=Ct−Ct−1\Delta C_t = C_t - C_{t-1}.

Optimizing the DTL at LANSCE

Problem Statement

We selected BO-ES-StepLmt for testing on the LANSCE accelerator based on its effective performance in simulation and its guaranteed hard step size limit. Deployment required some modifications to meet the stricter safety constraints of live accelerator operations.

First, following operational recommendations, we looked to minimize linac loss rather than to maximize particle count. This was primarily due to the loss monitors having better sensitivity than the current monitors. Second, we revised the formulation to incorporate both simulation and historical data, accounting for the latest setpoints following the accelerator’s recent calibration. Third, we adjusted the step size limits to comply with existing safety guidelines: a phase step limit of 0.05 deg. and an amplitude step limit of 0.02%. Global limits for the parameters were also narrower than in simulation: a global amplitude range of 0.25% and a global phase range of 1.0 deg. This is compared to ±\pm3%/deg. for the simulation data. Finally, following an operational recommendation to remove unnecessary degrees of freedom, we kept the phase of Tank 1 fixed.

We investigated the timescale over which historical data were most useful by considering periods of one week, one month, and three months.

Data

The same simulation data as in the preceding sections were used to train the GPs. Historical data were pre-processed to retain only observations collected while the accelerator was operational, with each dataset containing 1,000 observations from the corresponding period. Operational safety requirements restricted the range of parameter values in the historical data, whereas simulations provided data over a much wider parameter range.

The historical data were archived only when the phase change was more than 0.01 deg. or the amplitude by more than 0.1%, which limited the calibration to rough accuracy.

During testing on the LANSCE accelerator, we paused for three seconds after each iteration to allow the accelerator to settle. The linac loss is obtained by summing the readings of 88 loss monitors throughout the 44 CCL modules. Limited beam development time allowed only one run per method.

Methods

First, we trained separate latent GPs, g∼GPg \sim\mathcal{GP}, to model beam loss using only historical data spanning one week, one month, and three months.

In addition, we also trained a single GP, ff, on simulation data to predict particle count as before but now without ϕ1\phi_1: x∈R7\mathbf{x} \in\mathbb{R}^{7}. To map the predicted count percentage to loss and incorporate historical data, we fitted the following latent model:

g(x)=c0+c1f(x−Δ)+δhist(x).(20)g(x) = c_0 + c_1 f(x - \Delta) + \delta^{\mathrm{hist}}(x). \tag*{(20)}

The historical loss observations satisfy

Lihist=g(xi)+ϵihist,ϵihist∼N(0,σhist2).L_i^{\mathrm{hist}} = g(x_i) + \epsilon_i^{\mathrm{hist}}, \qquad\epsilon_i^{\mathrm{hist}} \sim\mathcal{N}(0,\sigma_{\mathrm{hist}}^2).

In Eq. (20), c0c_0 and c1c_1 are scalars that account for the change in observable and units, and Δ∈R7\Delta\in\mathbb{R}^{7} represents amplitude and phase offsets. The correction GP, δhist(x)\delta^{\mathrm{hist}}(x), used an RBF-7 kernel. The calibration and noise parameters, together with the RBF-7 kernel parameters, were fitted by minimizing the negative log likelihood, as in Eq. (8), against a two-week historical validation dataset. During fitting, the simulation GP, f(x)f(x), remained fixed while the correction GP, δhist(x)\delta^{\mathrm{hist}}(x), was updated. We also examined a simulation-only case, for which we fitted the simulation GP to Eq. (20). This gave us a reliable connection between the simulation’s percentage count and LANSCE’s loss in its own units. This simulation calibration also included, for practical reasons, two points from a historical δhist(x)\delta^{\mathrm{hist}}(x), but these have negligible impact, since the simulation-only GP was trained on 2,000 points. We thus classify this method as Sim-Only-Cal.

During live tuning, we used the pretrained loss model g(x)g(x) to define the following latent GP for BO:

h(x)=g(x)⏟simulation/historic data+δonline(x)⏟corrector.(21)h(x) = \underbrace{g(x)}_{\text{simulation/historic data}} + \underbrace{\delta^{\mathrm{online}}(x)}_{\text{corrector}}. \tag*{(21)}

The live loss observations satisfy:

Lt=h(xt)+ϵtonline,ϵtonline∼N(0,σonline2).L_t = h(x_t) + \epsilon_t^{\mathrm{online}}, \qquad\epsilon_t^{\mathrm{online}} \sim\mathcal{N}(0,\sigma_{\mathrm{online}}^2).

We kept the pretrained model g(x)g(x) fixed while updating the correction GP, δonline(x)\delta^{\mathrm{online}}(x), as well as its parameters, and the measurement noise variance, σonline2\sigma_{\mathrm{online}}^2.

The three methods were evaluated using the fitting scheme in Eq. (20):

  1. Sim-Only-Cal: δhist\delta^{\mathrm{hist}} incorporated only two data points, whereas ff incorporated 2,000,

  1. One-Week-Cal: δhist\delta^{\mathrm{hist}} incorporated 1,000 points of historical data across a one-week period,

  1. One-Month-Cal: δhist\delta^{\mathrm{hist}} incorporated 1,000 points of historical data across a one-month period.

We were unable to test a “Three-Months-Cal” method as the calibration (fitting as in Eq. (20)) failed. This was an early indicator that older historical data (or at least large windows of historical data) perform poorly.

Three other methods were constructed using an RBF-7 kernel to train a GP on 1,000 historical data points:

  1. One-Week-Hist: data from a week-long window,

  1. One-Month-Hist: data from a month-long window,

  1. Three-Months-Hist: data from a three-month-long window.

During live testing, we used Badger’s graphical user interface [39] to connect the BO-ES-StepLmt algorithm and the GP models to the LANSCE accelerator, with all algorithms running on a CPU. The ES hyperparameters were unchanged from those used in simulation, except that the step sizes were adjusted to comply with safety requirements. Similarly, the ES updates were calculated by mapping the accelerator settings xjix_j^i onto the interval [−1,1][-1,1], just like in simulation. This was done using the average and range of the global bounds, which were more stringent for the online test.

Results and Analysis

We began each run with seven iterations at identical amplitude and phase settings. This concentrated the initial data at a known safe operating point and provided each GP with repeated measurements to estimate noise within its run. Across the six runs, these 42 measurements also allowed us to estimate the measurement uncertainty under the assumption of homoscedastic noise. Unlike in simulation, noise-free values were unavailable. To estimate the underlying loss signal, we smoothed the loss time series using a centered moving average with a window of five observations.

Figure 8 shows the loss for each method, normalized by the initial loss, Lˉ0\bar{L}_0, estimated as the mean of the 42 initial measurements. Each GP was initialized using measurements at this known safe operating point. All methods reached final losses of approximately 70–80% of the initial value. Incorporating more than one week of historical data generally led to poorer performance. The methods using only simulation data or one week of historical data generally reduced loss during the initial BO phase, whereas the other methods initially increased loss. This initial deterioration resembles the behavior observed for ES in simulation and in previous work using ES to tune the LANSCE DTL [11], where optimization initially proceeded in the wrong direction (i.e., loss increased). However, the latter study used a more complex objective function based on readings from loss monitors at three locations.

Figure 8. Five-point window average of the normalized loss (normalized by Lˉ0\bar{L}_0) per iteration. Faint lines in the backdrop show the raw value for each iteration. Error bars represent 1σ1\sigma of uncertainty for the window average and are only displayed every 10th point for visual clarity. The dash-dotted line (red) shows measured loss using three months of historical data to train the GP for the BO. The dotted (blue and orange) lines show measured loss using one month of historical data to train the GP. In this case, we see that the calibrated GP yields considerably worse results, particularly when we look between the 25th and 75th iterations. The dashed (green and purple) lines show measured loss using one week of historical data for the GP training. We see that for these one-week GPs, the calibrated and purely historical GPs perform relatively equally over all iterations. Finally, the simulation-only GP (solid, cyan) gave the best results across the first few BO iterations, but was eventually outperformed by the one-week GPs (see Table VI for a comparison). A good benchmark for overall loss minimization is performance up to the 50th iteration, when we change from BO to ES. We see that only the One-Month-Calibrated and Three-Months-Historical GPs have performed genuinely poorly: indeed, they increased loss up to this benchmark. See Figure 9 for behavior past this benchmark.

These results suggest that the accelerator’s drift timescale renders data older than one week outdated and less helpful for DTL tuning. This remains the case even if one uses the initial loss for each method rather than estimating it with the mean of the 42 initial measurements (see Appendix D). Assigning less weight to older observations may mitigate this effect. However, given BO’s computational cost with large datasets, excluding data substantially older than one week and increasing the number of recent observations would likely be more computationally efficient. We limited each historical dataset to 1,000 observations to manage this cost. Future work could determine how much the sample size can be increased before the computational burden becomes prohibitive.

Using simulation data with calibration achieved performance comparable, albeit inferior, to that obtained by incorporating one week of historical data (Table VI). The coarseness of the historical amplitude data relative to the precision of the control suggests that the algorithms were not merely going to previous good set points.

MethodAvg. Lt/L‾0L_t/\overline{L}_0 ↓ (all)Avg. Lt/L‾0L_t/\overline{L}_0 ↓ (only ES)Avg. Lt/L‾0L_t/\overline{L}_0 ↓ (last 20 iterations)
Sim-Only-Cal0.818 ± 0.0050.797 ± 0.0050.757 ± 0.007
One-Week-Cal0.808 ± 0.0050.769 ± 0.0050.764 ± 0.007
One-Week-Hist0.802 ± 0.0050.769 ± 0.0050.736 ± 0.007
One-Month-Cal0.886 ± 0.0050.827 ± 0.0050.740 ± 0.007
One-Month-Hist0.842 ± 0.0050.789 ± 0.0050.746 ± 0.007
Three-Months-Hist0.908 ± 0.0050.856 ± 0.0050.754 ± 0.007
MethodRange ⟨Lt/L‾0⟩5\langle L_t/\overline{L}_0\rangle_5 (all)Range ⟨Lt/L‾0⟩5\langle L_t/\overline{L}_0\rangle_5 (only BO)Range ⟨Lt/L‾0⟩5\langle L_t/\overline{L}_0\rangle_5 (only ES)max⁡tLt/L‾0\max_t L_t/\overline{L}_0 ↓ (only BO)max⁡tLt/L‾0\max_t L_t/\overline{L}_0 ↓ (last 100 iterations)
Sim-Only-Cal0.30 ± 0.020.19 ± 0.020.19 ± 0.021.05 ± 0.040.89 ± 0.03
One-Week-Cal0.35 ± 0.020.18 ± 0.020.23 ± 0.021.06 ± 0.040.85 ± 0.03
One-Week-Hist0.37 ± 0.020.23 ± 0.020.21 ± 0.021.06 ± 0.040.82 ± 0.03
One-Month-Cal0.46 ± 0.020.21 ± 0.020.40 ± 0.021.17 ± 0.040.93 ± 0.03
One-Month-Hist0.40 ± 0.020.23 ± 0.020.24 ± 0.021.13 ± 0.040.85 ± 0.03
Three-Months-Hist0.54 ± 0.020.31 ± 0.020.54 ± 0.021.23 ± 0.040.86 ± 0.03

Table VI. DTL optimization statistics at LANSCE. LtL_t is the measured loss at iteration tt, and L‾0\overline{L}_0 is the mean of the 42 initial measurements. Uncertainties are propagated measurement uncertainties. ⟨⋅⟩5\langle\cdot\rangle_5 represents a five-point window average. ↑ (↓) indicates that higher (lower) values are better.

Figure 9 shows the cumulative loss during the ES phase.

Figure 9. Integral of the normalized loss (normalized by Lˉ0\bar{L}_0) using different GPs for the BO. The color and line-style schemes mimic Figure 8. The algorithm changed from BO to ES at iteration 50. The lines have error bands for the integral uncertainty. The inset zooms into the accrued loss over the last ten iterations. We see that, as seen in Figure 8, the One-Month-Cal and Three-Months-Hist GPs produced substantially worse results. The other GPs led to better loss reductions over the ES phase, with the one-week GPs delivering the best results.

To determine whether the reduction in beam loss came at the expense of a significant reduction in transmitted beam current, we examined measurements from current monitors at the end of the linac. The transmitted currents remained largely stable, generally staying within approximately 2% of their initial values (see Appendix D).

BO-ES-StepLmt performed successfully despite the substantial modifications required for live accelerator operation, strongly suggesting that the method is robust. Switching to ES also enabled the One-Month-Cal and Three-Months-Hist runs to recover substantially from their poor initial performance, although their final losses remained higher than those of the other methods.

Most algorithm hyperparameters selected in simulation successfully transferred to live accelerator operation, demonstrating the value of the simulation trials. The principal exception was the step size limits, which required adjustment to comply with safety standards. We also increased the number of iterations from 150 to 200 just in case the methods took longer to converge in the more complicated case of the real world. Nonetheless, the algorithms operated smoothly. Valuable accelerator time was not wasted on hyperparameter tuning.

Conclusion

We have demonstrated the effectiveness of BO-ES for accelerator tuning in both simulation and live operation. Combining BO with ES allows historical and simulation data to be incorporated into the initial BO stage, providing information about the optimization landscape and guiding the algorithm toward a promising basin of solutions. ES can then take over, providing effective local optimization while handling drifting conditions very well. The imposed step limit in BO and the inherent step limit in bounded ES allow smooth parameter adjustments, as often required in accelerator operation.

BO-ES can be extended in several ways. The BO search was locally constrained and myopic. Future work could investigate path-based and multi-step planning approaches that enable global exploration while still respecting step size limits [40, 41, 42]. Whether such methods can be useful in the drifting conditions of accelerators is an open question. For real-world usages of BO-ES, more attention would be needed for safety considerations, which were only addressed here via step size limits and global bounds. Further extensions could incorporate safety constraints by modifying both BO [9] and ES [10]. Performance constraints, like the desire for the transmitted current to be above a certain threshold, can also be included.

Here we found that using historical-data windows longer than one week was detrimental. A more systematic study could also examine how best to combine simulation and historical data and select the time window over which the historical data are most useful.

Acknowledgments

Los Alamos National Laboratory is operated by Triad National Security, LLC, for the national Nuclear Security Administration of the US Department of Energy (Contract No. 89233218CNA000001).

Training Data and RBF Kernel Testing

The simulation dataset used for training GPs was made in HPSim. Figure 10 shows the particle count along the accelerator for many different runs with their own RF parameters. The particle count at the end was used to train the simulation surrogate GPs. For the kernel in Eq. (5), which we label RBF-8, each dimension gets its own dimension scaling, ℓi\ell_i. Instead, we can have a single scale for all dimensions:

Particle count along accelerator showing average, trajectories, and ±1σ deviation

Figure 10. Simulation data for particle count along the linac section. The light gray curves represent different particle trajectories through the accelerator. The bright blue curve is the average of all trajectories and the shaded blue area shows the 1σ1\sigma deviation away from it. Track elements correspond to DTL modules, CCL modules, and other apparatuses.

k(x,x′)=σf2exp⁡(−12∥x−x′∥2/ℓ2).k(\mathbf{x},\mathbf{x}') = \sigma_f^2 \exp\left(-\frac{1}{2}\lVert\mathbf{x}-\mathbf{x}'\rVert^2/\ell^2\right).

We label this kernel RBF. We tested both kernels on the HPSim data. This used an older calibration. 2,000 data points were generated, uniformly sampled to be between ±3%\pm3\% (deg.) for the amplitude (phase) of the reference calibration. To test the fits, the GP models were trained on 85% of the data and tested on the remaining 15%. Figure 11 shows the results of the fit, with RBF-8 performing better.

Comparison of fits for different kernels

Figure 11. Comparison of fits for different kernels. (a) A plot of true vs. predicted count for the two RBF kernels on the test set. (b) Histogram of errors for the two RBF kernels on the test set.

For one further test, BO was performed in simulation with both kernels, as seen in Figure 12. Since the starting calibration point was already quite optimal, neither method increased the count by much. However, RBF produced much wilder swings, with the count falling below 30%, which is far too low. RBF-8’s low point was close to 70%. Subsequently, we decided to go with RBF-8 for all experiments involving BO.

BO Progress (Count %)

Figure 12. A comparison of BO runs using GPs with RBF and RBF-8 kernels.

Proof sketch for average gradient descent in 1D for ES

For a smooth, time-independent objective J(x)J(x), the high-frequency averaged dynamics of Eq. (17) produce gradient descent on JJ.

Proof sketch for the 1D case:

For compact notation, define the oscillation phase:

θ(τ)=ωτ+κJ(x(τ)).\theta(\tau) = \omega\tau+ \kappa J(x(\tau)).

Subtract the high-frequency component by defining:

X(τ)=x(τ)−2αωsin⁡θ(τ).(22)X(\tau) = x(\tau) - \sqrt{\frac{2\alpha}{\omega}}\sin\theta(\tau). \tag*{(22)}

Then, from Eq. (17):

dXdτ=dxdτ−2αωcos⁡θ(τ)[ω+κJ′(x(τ))dxdτ]=−2ακJ′(x(τ))cos⁡2θ(τ).\begin{aligned} \frac{dX}{d\tau} &= \frac{dx}{d\tau} - \sqrt{\frac{2\alpha}{\omega}}\cos\theta(\tau) \left[\omega+ \kappa J'(x(\tau))\frac{dx}{d\tau}\right] \\ &= -2\alpha\kappa J'(x(\tau))\cos^2\theta(\tau). \end{aligned}

Integrating:

X(τ)=X(0)−2ακ∫0τJ′(x(u))cos⁡2θ(u) du.X(\tau) = X(0) - 2\alpha\kappa\int_{0}^{\tau} J'(x(u))\cos^2\theta(u)\,du.

Using cos⁡2θ=(1+cos⁡2θ)/2\cos^2\theta= (1+\cos2\theta)/2:

X(τ)=X(0)−ακ∫0τJ′(x(u)) du−ακ∫0τJ′(x(u))cos⁡(2θ(u)) du.(23)X(\tau) = X(0) - \alpha\kappa\int_{0}^{\tau} J'(x(u))\,du - \alpha\kappa\int_{0}^{\tau} J'(x(u))\cos(2\theta(u))\,du. \tag*{(23)}

In the high-frequency averaging approximation, the rapidly oscillating last term is neglected. This is motivated by the Riemann–Lebesgue lemma, which states that integrals of fixed integrable amplitudes multiplied by sinusoids tend to zero as the oscillation frequency tends to infinity, ω→∞\omega\to\infty. Also, from Eq. (22),

∣x(τ)−X(τ)∣≤2αω.|x(\tau)-X(\tau)| \le\sqrt{\frac{2\alpha}{\omega}}.

To define the averaged trajectory precisely, first average the drift over one oscillation cycle while holding the slow coordinate zz fixed:

F‾(z)=−2ακJ′(z)2π∫02πcos⁡2ϑ dϑ=−ακJ′(z).\overline{F}(z)=-\frac{2\alpha\kappa J'(z)}{2\pi}\int_{0}^{2\pi}\cos^{2}\vartheta\,\mathrm{d}\vartheta =-\alpha\kappa J'(z).

We define X‾(τ)\overline{X}(\tau) as the solution of the averaged initial-value problem:

dX‾dτ=F‾(X‾)=−ακJ′(X‾).(24)\frac{\mathrm{d}\overline{X}}{\mathrm{d}\tau}=\overline{F}(\overline{X})=-\alpha\kappa J'(\overline{X}). \tag*{(24)}

Its initial condition is X‾(0)=x(0)\overline{X}(0)=x(0), since the difference between X(0)X(0) and x(0)x(0) vanishes as ω→∞\omega\to\infty.

Thus, Xˉ\bar{X} describes the slow motion after averaging over the rapid oscillations, and its dynamics are gradient descent on JJ.

Noisy Measurement Plots

Figure 13 shows the noisy vs. true measurements for each method in the sinusoidal drift case.

BO progression under sinusoidal drift conditions

Figure 13. BO progression under sinusoidal drift conditions. The left plots show the noisy measurements the algorithms see, while the right plots show the true measurement values. All ten runs for each method are shown.

Amplitudes, phases, current and adjusted loss during LANSCE DTL Tuning

The change in the amplitudes for each method tried is depicted in Figure 14. The phases and current are shown in Figure 15. It is seen that the current remains steady across iterations both between and within each method.

Figure 14. RF amplitudes suggested by the BO-ES algorithm at each iteration for each of the four DTL modules. Labels follow the scheme from Figure 8. Note that all amplitudes were held fixed for the first seven iterations; the horizontal black line represents this initial value in each plot. The transition to ES at the 50th50^{\mathrm{th}} iteration is visible by the change to a sinusoidal sweep of the values.

Figure 15. RF phases suggested by the BO-ES algorithm at each iteration for each of the last three DTL modules. The bottom right graph shows the measured current at the end of the 44 CCL modules, along with a 1σ1\sigma uncertainty band. Labels follow the scheme from Figure 8. Note that all phases were held fixed for the first seven iterations; the horizontal black line represents this initial value in each phase plot. The transition to ES at the 50th iteration is visible by the change to a sinusoidal sweep of the values. We removed a current outlier at iteration 40 of the One-Week-Hist run due to a momentary malfunction of one of the CCL modules downstream from our experiment. There is no current reading for the One-Week-Cal run because we did not record it.

Figure 16 shows the normalized loss if one normalizes by the initial loss per run rather than normalizing by an estimate of the 42 initial measurements from the 6 runs. The performance at the beginning is still better for the Sim-Only-Cal and the one-week cases.

Figure 16. Five-point window average of the per-run normalized loss. Faint lines in the backdrop show the raw value for each iteration. Error bars represent 1σ1\sigma of uncertainty for the window average and are only displayed every 10th iteration for visual clarity. Here, we normalized the loss by the first data point of that specific run. This is why the raw data all start at 1. In comparison to Figure 8, Sim-Only-Cal performs slightly better than the one-week GPs. However, the general conclusions about the robustness of BO-ES and of Sim-Only-Cal, One-Week-Hist, and One-Week-Cal being the best-performing GPs remain valid. Errors are larger than those in Figure 8 due to increased uncertainty in the normalization constant. That is, normalization by 42 data points is more robust than normalization by an initial value.

References

  1. [8]Tobias Boltz, Jose L Martinez, Connie Xu, Kathryn RL Baker, Zihan Zhu, Jenny Morgan, Ryan Roussel, Daniel Ratner, Brahim Mustapha, and Auralee L Edelen, “Leveraging prior mean models for faster bayesian optimization of particle accelerators,” Scientific Reports 15, 12232 (2025).DOI
  2. [9]Ryan Roussel, Auralee L Edelen, Tobias Boltz, Dylan Kennedy, Zhe Zhang, Fuhao Ji, Xiaobiao Huang, Daniel Ratner, Andrea Santamaria Garcia, Chenran Xu, et al., “Bayesian optimization algorithms for accelerator physics,” Physical Review Accelerators and Beams 27, 084801 (2024).
  3. [10]Alan Williams, Alexander Scheinker, En-Chuan Huang, Charles Taylor, and Miroslav Krstic, “Experimental safe extremum seeking for accelerators,” IEEE Transactions on Control Systems Technology 32, 1881–1890 (2024).arxiv.org/abs/2308.15584
  4. [11]Alexander Scheinker, Peter Nafziger, and Antonio Garcia, “Extremum seeking for minimization of beam loss in the lansce linear accelerator by tuning rf cavities,” in 2020 American Control Conference (ACC) (IEEE, 2020) pp. 5071–5075.DOI
  5. [12]Alexander Scheinker and David Scheinker, “Bounded extremum seeking with discontinuous dithers,” Automatica 69, 250–257 (2016).DOI
  6. [13]Alexander Scheinker, Auralee Edelen, Dorian Bohler, Claudio Emma, and Alberto Lutman, “Demonstration of model-independent control of the longitudinal phase space of electron beams in the linac-coherent light source with femtosecond resolution,” Physical Review Letters 121, 044801 (2018).DOI
  7. [14]Alexander Scheinker, Dorian Bohler, Sergey Tomin, Raimund Kammering, Igor Zagorodnov, Holger Schlärb, Matthias Scholz, Bolko Beutner, and Winfried Decking, “Model-independent tuning for maximizing free electron laser pulse energy,” Physical review accelerators and beams 22, 082802 (2019).DOI
  8. [15]Alexander Scheinker, En-Chuan Huang, and Charles Taylor, “Extremum seeking-based control system for particle accelerator beam loss minimization,” IEEE Transactions on Control Systems Technology 30, 2261–2268 (2021).DOI
  9. [16]Alexander Scheinker, “Adaptive control meets deep learning: Extremum seeking in latent space with particle accelerator applications,” IEEE Control Systems 46, 150–176 (2026).DOI
  10. [17]Shaifalee Saxena, Alan Williams, Rafael Fierro, and Alexander Scheinker, “Improved robustness of deep reinforcement learning for control of time-varying systems by bounded extremum seeking,” in 2026 American Control Conference (ACC) (IEEE, 2026) pp. 1165–1172.arxiv.org/abs/2510.02490
  11. [18]Yuri Batygin, “Introduction to accelerating structures,” (2019), lecture notes for Proton and Ion Linear Accelerators, U.S. Particle Accelerator School (USPAS), Al- buquerque, New Mexico, June 17–28, 2019. LA-UR-16-29625. Accessed 2026-02-20.
  12. [19]Kilean Hwang, Tomofumi Maruta, Alexander Plastun, Kei Fukushima, Tong Zhang, Qiang Zhao, Peter Ostroumov, and Yue Hao, “Prior-mean-assisted bayesian optimization application on rf front-end tuning (2022),” arXiv preprint arXiv:2211.06400.arxiv.org/abs/2211.06400
  13. [20]Kilean Hwang, Qiang Zhao, Tong Zhang, Tomofumi Maruta, Alexander Plastun, Kei Fukushima, and Peter Ostroumov, “Customized bayesian optimization for efficient beam tuning at the facility for rare isotope beams,” Physical Review Accelerators and Beams 29, 024601 (2026).DOI
  14. [21]Carl Edward Rasmussen, “Gaussian processes in machine learning,” in Summer school on machine learning (Springer, 2003) pp. 63–71.DOI
  15. [22]Xiaoying Pang and Gary Rybarcyk, “Gpu accelerated online multi-particle beam dynamics simulator for ion linear particle accelerators,” Computer Physics Communications 185, 744–753 (2014).DOI
  16. [23]LN Engel, “Geometrical and electromagnetic parameters of the accelerating and coupling cells of the 805 mhz linac for lamp,” A LANL, Los Alamos, NM, USA, Rep. MP-3-58 (1968).
  17. [24]William R Thompson, “On the likelihood that one unknown probability exceeds another in view of the evidence of two samples,” Biometrika 25, 285–294 (1933).DOI
  18. [25]William R Thompson, “On the theory of apportionment,” American Journal of Mathematics 57, 450–456 (1935).DOI
  19. [26]Kirthevasan Kandasamy, Akshay Krishnamurthy, Jeff Schneider, and Barnabás Póczos, “Parallelised bayesian optimisation via thompson sampling,” in International conference on artificial intelligence and statistics (PMLR, 2018) pp. 133–142.
  20. [27]Ryan Roussin and Auralee Edelen, “Proximal biasing for bayesian optimization and characterization of physical systems,” in Workshop on Machine Learning and the Physical Sciences (2021).
  21. [28]Ilya M Sobol, “Distribution of points in a cube and approximate evaluation of integrals,” USSR Computational mathematics and mathematical physics 7, 86–112 (1967).DOI
  22. [29]Maximilian Balandat, Brian Karrer, Daniel Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Eytan Bakhshy, “Botorch: A framework for efficient monte-carlo bayesian optimization,” (2020), arXiv:1910.06403 [cs.LG].arxiv.org/abs/1910.06403
  23. [30]Jacob R. Gardner, Geoff Pleiss, Kilian Q. Weinberger, David Bindel, and Andrew Gordon Wilson, “Gpytorch: Blackbox matrix-matrix gaussian process inference with gpu acceleration,” in Advances in Neural Information Processing Systems (2018).arxiv.org/abs/1809.11165
  24. [31]Pauli Virtanen et al., “SciPy 1.0: Fundamental algorithms for scientific computing in python,” Nature Methods 17, 261–272 (2020).
  25. [32]Prasanta Chandra Mahalanobis, “On the generalized distance in statistics,” Sankhyā: The Indian Journal of Statistics, Series A (2008-) 80, S1–S7 (2018).
  26. [33]Shaifalee Saxena and Alexander Scheinker, “Mahalanobis-guided latent ood detection for hybrid es-drl control in time-varying systems,” arXiv preprint arXiv:2606.11474 (2026).arxiv.org/abs/2606.11474
  27. [34]David Eriksson, Michael Pearce, Jacob Gardner, Ryan D Turner, and Matthias Poloczek, “Scalable global optimization via local bayesian optimization,” Advances in neural information processing systems 32 (2019).arxiv.org/abs/1910.01739
  28. [35]Alexander Scheinker and Miroslav Krstić, Model-free stabilization by extremum seeking (Springer, 2017).DOI
  29. [36]Alexander Scheinker, Frederick Cropp, Sergio Paiagua, and Daniele Filippetto, “An adaptive approach to machine learning for compact particle accelerators,” Scientific Reports 11, 19187 (2021).DOI
  30. [37]Ryan Roussel, A Edelen, A Bartnik, and Christopher Mayes, “Xopt: A simplified framework for optimization of accelerator problems using advanced algorithms,” Proc. IPAC 23, 4796–4799 (2023).DOI
  31. [38]Ankush Chakrabarty, Claus Danielson, Scott A Bortoff, and Christopher R Laughman, “Accelerating self-optimization control of refrigerant cycles with bayesian optimization and adaptive moment estimation,” Applied Thermal Engineering 197, 117335 (2021).DOI
  32. [39]Zhe Zhang, Auralee Edelen, C Mayes, J Garrahan, J Shtalenkova, R Roussel, S Miskovich, Daniel Ratner, Michael Boese, Sergey Tomin, et al., “Badger: The missing optimizer in acr,” Proc. IPAC’22, 999–1002 (2022).DOI
  33. [40]Jose Pablo Folch, James Odgers, Shiqiang Zhang, Robert M Lee, Behrang Shafei, David Walz, Calvin Tsay, Mark van der Wilk, and Ruth Misener, “Practical path-based bayesian optimization,” arXiv preprint arXiv:2312.00622 (2023).arxiv.org/abs/2312.00622
  34. [41]Jose P Folch, Calvin Tsay, Robert M Lee, Behrang Shafei, Weronika Ormaniec, Andreas Krause, Mark van der Wilk, Ruth Misener, and Mojmír Mutný, “Transition constrained bayesian optimization via markov decision processes,” Advances in Neural Information Processing Systems 37, 88194–88235 (2024).arxiv.org/abs/2402.08406
  35. [42]Joel A Paulson, Farshad Souriraj, and Ankush Chakrabarty, “Efficient multi-step lookahead bayesian optimization with local search constraints,” in 2022 IEEE 61st Conference on Decision and Control (CDC) (IEEE, 2022) pp. 123–129.DOI

Paper details

vlnc:W_nkhexvha
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents