betaFeedback

WorksComputer Science

Adapting neural operators for mechanics decisions under changing operating conditions

Abstract

Neural operators can accelerate repeated nonlinear mechanics calculations, but their accuracy can deteriorate as operating conditions move beyond the training range. This work studies whether high-fidelity solutions acquired during use can be reused to adapt a neural operator and improve subsequent mechanics-based command selection. Two hard-magnetic soft-material systems are simulated using high-fidelity finite-element (FE) models, providing reference solutions for evaluating surrogate predictions and selected commands. A neural operator predicts deformation from known material, loading, and magnetic-field inputs, while an empirical error estimator determines which predictions may be used for command selection. Selected FE evaluations supplement these predictions, and their complete loading paths are retained for periodic updates of the neural operator and estimator. In both examples, the fixed operator loses substantial accuracy when stiffness and loading move outside the training range. Updates using 16 acquired paths recover much of the lost accuracy while preserving accuracy in the nominal regime. Under the same FE evaluation budget, the updated operators also improve command selection, although the benefit varies with the operating condition. Error estimation is less consistent, with inaccurate predictions sometimes accepted and accurate predictions rejected. These results demonstrate that reusing high-fidelity loading paths can extend the useful operating range of a neural operator. However, improved forward accuracy alone does not guarantee reliable prediction acceptance, highlighting prediction-specific error assessment as a separate requirement for trustworthy decision making.

Introduction

A computational twin used for mechanics-based decision making must repeatedly evaluate the response of a physical system as operating conditions and requested actions change. High-fidelity finite-element (FE) models can provide the displacement, strain, and other mechanical quantities needed for these decisions from known boundary conditions and material properties, but repeated FE calculations may be too expensive for practical use. This difficulty is pronounced for field-responsive soft materials, where finite-strain equilibrium calculations commonly require incremental loading and iterative solution of a nonlinear problem at each increment. Reduced-order and learned models can reduce this computational cost by approximating the forward response in place of repeated FE solutions [1, 2, 3].

For forward models governed by parameterized partial differential equations (PDEs), neural operators learn the map from model inputs to solution fields. Representative architectures include DeepONet [4], the Fourier neural operator [5], and projection-based approaches that represent the solution in a low-dimensional basis and learn the corresponding coefficients [6]. Once trained, these operators can approximate the solution at new inputs without repeatedly solving the governing PDEs. This capability has motivated their use in forward prediction, inverse problems, and design, where many evaluations of the same solution map are required [7, 8, 9, 10].

The usefulness of this approximation depends on whether its predictions are sufficiently accurate for the quantities of interest (QoIs) used in a decision. Neural-operator error depends on the solution representation, network approximation, and sampling, as described by error analyses for DeepONet and Fourier neural operators [11, 12]. Accuracy is usually assessed using test samples drawn from the distribution represented during training. Operating conditions encountered during use may move beyond this nominal regime, however, and neural-operator accuracy can deteriorate under the resulting distribution shift [13, 14, 15]. Moreover, aggregate test accuracy does not determine whether an individual prediction satisfies the accuracy requirements of a particular QoI or decision [10]. In nonlinear mechanics, an inaccurate displacement prediction can misrepresent the achieved translation or rotation, incorrectly indicate that a strain constraint is satisfied, and change the action selected from a discrete set. Evaluating every candidate action by FE avoids relying on these surrogate predictions but removes much of their computational benefit.

Prediction-specific error assessment and refinement address this limitation in several ways. Goal-oriented estimation evaluates approximation error through a selected output rather than only through a global field norm [16, 17, 18, 19, 20]. Residual-based methods use additional variational calculations to improve individual neural-operator predictions [9, 21], while a posteriori approaches seek computable estimates of their errors [22, 23]. Conformal operator-learning methods provide calibrated uncertainty under their sampling assumptions, although this does not guarantee accuracy conditional on every shifted input [24, 25]. These methods provide information for assessing or refining a prediction, but repeated use under changing conditions also raises the question of how to improve the surrogate itself.

High-fidelity FE calculations obtained during use can provide data for this improvement. Adaptive operator learning introduces additional high-fidelity data in regions encountered during an inverse problem [26], while hierarchical and multifidelity methods combine approximations of different cost and fidelity [27, 28, 29]. For repeated mechanics decisions, the value of additional data must be assessed beyond the resulting reduction in forward error. It is also necessary to determine whether the updated predictions improve action selection and whether their errors can still be estimated reliably. This motivates studying the reuse of high-fidelity solutions together with prediction-specific error assessment and decision quality under changing known operating conditions.

The present study addresses four related questions. First, does a neural operator that is accurate on held-out nominal inputs remain accurate when known stiffness and mechanical loads move beyond its training range? Second, can a small number of FE loading paths collected under these shifted conditions recover the lost forward accuracy without degrading accuracy in the nominal regime? Third, does improved forward accuracy lead to better action selection under the same FE budget? Fourth, does adaptation of the forward operator also improve the reliability of its error estimator?

These questions are examined for two hard-magnetic soft-material (hMSM) structures. Hard-magnetic particles embedded in a compliant matrix retain a prescribed remanent magnetization, allowing an applied field to deform the structure without direct mechanical contact [30, 31, 32]. The deformation produced by a given field also depends on material stiffness and mechanical loading, so a field selected under one condition need not produce the requested response under another. The examples draw on prior work in hMSM topology and joint material–structural optimization [33, 34] and the MatTO framework [35]. Neural-network surrogates have also been used to search hMSM morphology and magnetization for prescribed magnetic fields [36]. The physical systems are simulated using high-fidelity FE models, with material properties and mechanical loads supplied as known inputs. This setting permits direct assessment of surrogate errors and selected actions without experimental uncertainty, sensor noise, or hidden-parameter inference. The tests vary known stiffness and mechanical loading beyond the training range while keeping the magnetic-command range unchanged.

The two structures in Figure 1 provide different command-selection tasks. The compliant positioning platform is supported by four curved hMSM ligaments. Its horizontal translation and rotation define the requested pose, while vertical drift and a regional strain measure determine admissibility. The gripping wishbone is based on the gripper geometry studied in [34]. Its two magnetically active fingers are supported by passive branches, and its response here is characterized by aperture, lateral position, vertical mismatch, and root strain. In both examples, a magnetic command specifies the magnitude and direction of a uniform applied field. The objective is to select a command that produces the requested response while satisfying the prescribed mechanical admissibility criteria.

Image not extracted

Figure 1. The two hard-magnetic soft-material structures considered in this study. (a) A compliant positioning platform supported by four magnetically active ligaments and clamped at the outer roots. (b) A gripping wishbone with two magnetically active fingers supported by passive lower branches and clamped along the base. Arrows within the active regions show remanent magnetization, and grey denotes passive material. Dark outlines show representative FE deformations; the platform displacement is magnified twofold, while the wishbone is shown at true scale.

A projection-based neural operator is constructed separately for each structure. The displacement is represented in a fixed proper orthogonal decomposition (POD) basis, and a neural network learns the dependence of its coefficients on material, mechanical-loading, and magnetic-field inputs. For each operating condition, the operator predicts the displacement under every candidate magnetic command. The QoIs extracted from these predictions are used to evaluate command performance and admissibility. An empirical estimator uses the nonlinear residual and one linearized residual solve to estimate the QoI error following [20, 18] and determine which predictions may be used. The linearized solve supplies information for error estimation; it does not correct the predicted displacement.

The accepted surrogate predictions are supplemented by four FE evaluations at each operating condition. The commands evaluated by FE are selected either using the error estimator or by random sampling, with the same four-path budget for both strategies. Their FE QoIs enter the current command calculation, while the complete sequence of equilibrium solutions along each loading path is retained for adaptation. The neural operator is updated after 8 and 16 acquired paths, and the estimator is refitted as the operator and available FE data change. Fixed and updated operators are then compared on held-out operating conditions to assess forward accuracy, estimator reliability, and command selection. The platform and wishbone use separate POD bases, training data, operators, and estimators.

The numerical studies show that accuracy within the training regime does not persist under the prescribed changes in stiffness and loading. In both examples, periodic updates using 16 acquired FE paths recover much of the lost forward accuracy while preserving accuracy in the nominal regime. These improvements also lead to better command selection under the same FE budget, although the benefit varies with the operating condition. Updating the forward operator and refitting its estimator do not consistently produce reliable acceptance decisions: inaccurate predictions may still be accepted, and accurate predictions may be rejected. The comparisons also do not establish an advantage of estimator-guided acquisition over random acquisition.

Together, these findings support reusing FE loading paths to maintain the usefulness of a neural operator under changing operating conditions. The benefit extends beyond reducing forward error to improving subsequent mechanics-based decisions. However, adaptation alone does not establish when the updated predictions can be accepted. The study therefore demonstrates the value of high-fidelity data reuse for forward adaptation and identifies reliable prediction-specific error assessment as a separate requirement for its use in decision making.

The rest of the article is organized as follows. § 2 defines the forward model and formulates the two command-selection problems. § 3 presents the neural operator, QoI-error estimator, selective FE evaluation, and periodic adaptation. § 4 and § 5 present the numerical setup and results for the platform and wishbone, respectively. § 6 and § 7 discuss the results and summarize the conclusions.

Forward mechanics and command-selection problems

This section defines the forward model that predicts the deformation of a magnetically active soft structure from known material properties, boundary conditions, and magnetic loading. The predicted response is used in the command-selection problem illustrated in Figure 2, where the objective is to select a magnetic field that achieves a desired response, characterized by quantities of interest (QoIs), while satisfying mechanical admissibility criteria. We first present the common mechanics formulation and then define the QoIs and command-selection problems for the two structures shown in Figure 1. The neural-operator approximation and error estimation are presented in § 3.

Image not extracted

Figure 2. Reference and surrogate-assisted command-selection sequence. For a fixed operating condition θ\theta, each candidate command a∈A\mathbf{a} \in\mathcal{A} defines the known forward input m=(a,θ)\mathbf{m} = (\mathbf{a},\theta). The neural operator predicts the displacement and associated mechanics QoIs, while selected commands are evaluated using the high-fidelity FE model. The QoI-error estimator determines which neural-operator predictions may enter the command calculation. The available set comprises commands with accepted neural-operator predictions and the FE-evaluated commands. An admissible command is selected from this set by minimizing the loss. Acquired FE paths are retained for periodic updates of the neural operator and estimator.

Forward hMSM mechanics problem

Let Ω⊂R2\Omega\subset\mathbb{R}^{2} denote the reference domain of the structure, ΓD\Gamma_{D} the boundary on which displacement is prescribed, and ΓN\Gamma_{N} the loaded boundary. Both structures are modeled under plane strain, with in-plane displacement u=(ux,uy)\mathbf{u} = (u_{x},u_{y}) and unit out-of-plane stretch. The FE displacement space U\mathcal{U} incorporates the prescribed displacement conditions, while the corresponding test space U0\mathcal{U}_{0} contains functions that vanish on ΓD\Gamma_{D}.

The known material and loading inputs are collected in m∈M\mathbf{m} \in\mathcal{M}. Both examples use

m=(By,Bx,γG,fx,fy),(1)\mathbf{m} = (B_{y}, B_{x}, \gamma_{G}, f_{x}, f_{y}), \tag*{(1)}

where (Bx,By)(B_{x},B_{y}) are the components of the uniform applied magnetic flux density, γG\gamma_{G} is a stiffness multiplier, and (fx,fy)(f_{x},f_{y}) is the prescribed mechanical force. For each input m\mathbf{m}, the equilibrium problem seeks u∈U\mathbf{u} \in\mathcal{U} satisfying

R(u;m)[v]=∫ΩP(u;m):∇v dA−∫ΓNtˉ(m)⋅v ds=0∀ v∈U0,(2)\mathcal{R}(\mathbf{u};\mathbf{m})[\mathbf{v}] = \int_{\Omega} \mathbf{P}(\mathbf{u};\mathbf{m}) : \nabla\mathbf{v}\,\mathrm{d}A - \int_{\Gamma_{N}} \bar{\mathbf{t}}(\mathbf{m}) \cdot\mathbf{v}\,\mathrm{d}s = 0 \qquad\forall\,\mathbf{v} \in\mathcal{U}_{0}, \tag*{(2)}

where P\mathbf{P} is the in-plane first Piola–Kirchhoff stress and tˉ\bar{\mathbf{t}} is the prescribed traction representing the force (fx,fy)(f_{x},f_{y}) on ΓN\Gamma_{N}.

The stress in Eq. (2) is obtained from the elastic and magnetic energy of the material. The deformation gradient and its determinant are

F=I+∇u,J=det⁡F,(3)\mathbf{F} = \mathbf{I} + \nabla\mathbf{u}, \qquad J = \det\mathbf{F}, \tag*{(3)}

where I\mathbf{I} and F\mathbf{F} are 2×22 \times2 tensors, and the gradient is taken with respect to the reference coordinates. The total energy density and corresponding stress are

W(F;m)=Wel(F;γG,ϕ)+Wmag(F;ϕ,Br,Ba),P=∂W∂F.(4)W(\mathbf{F};\mathbf{m}) = W_{\mathrm{el}}(\mathbf{F};\gamma_G,\phi) + W_{\mathrm{mag}}(\mathbf{F};\phi,\mathbf{B}^{r},\mathbf{B}^{a}), \qquad\mathbf{P} = \frac{\partial W}{\partial\mathbf{F}}. \tag*{(4)}

The elastic and magnetic contributions are

Wel=G2[tr⁡(FTF)−2−2ln⁡J]+K2(J−1)2,(5)W_{\mathrm{el}} = \frac{G}{2}\left[\operatorname{tr}(\mathbf{F}^{T}\mathbf{F}) - 2 - 2\ln J\right] + \frac{K}{2}(J-1)^2, \tag*{(5)}
Wmag=−ϕμ0(FBr)⋅Ba,Ba=(Bx,By).(6)W_{\mathrm{mag}} = -\frac{\phi}{\mu_0}(\mathbf{F}\mathbf{B}^{r})\cdot\mathbf{B}^{a}, \qquad\mathbf{B}^{a} = (B_x,B_y). \tag*{(6)}

Here, ϕ\phi is the magnetic-particle volume fraction, Br\mathbf{B}^{r} is the prescribed remanent flux density associated with the magnetic particles, Ba\mathbf{B}^{a} is the applied flux density, and μ0=4π×10−7 N/A2\mu_0 = 4\pi\times10^{-7}\ \mathrm{N/A^2} is the permeability of free space. The factor ϕ\phi in WmagW_{\mathrm{mag}} accounts for the magnetic-particle volume fraction; it is not already included in Br\mathbf{B}^{r}. The effective shear modulus and volumetric coefficient are specified by

G=γGG0exp⁡(2.5ϕ1−1.35ϕ),K=500G,(7)G = \gamma_G G_0 \exp\left(\frac{2.5\phi}{1-1.35\phi}\right), \qquad K = 500G, \tag*{(7)}

Here, G0G_0 is the reference matrix shear modulus. The elastic energy is the NH2 neo-Hookean form used in [34], and the effective shear modulus uses the Mooney relation that gave the best overall agreement among the relations tested there against mechanical stress–strain data. The magnetic term is the FF-based Zeeman energy used in [30, 34]. In the present calculations, γG\gamma_G varies the stiffness with operating condition, and K=500GK = 500G specifies the volumetric coefficient. The geometry, material parameters, boundary conditions, and force application are specified for the platform and wishbone in § 4.1 and § 5.1, respectively.

For command selection, the input in Eq. (1) is separated into the operating condition θ\theta and magnetic command a\mathbf{a}:

θ=(γG,fx,fy),a=(B,α).(8)\theta= (\gamma_G,f_x,f_y), \qquad\mathbf{a} = (B,\alpha). \tag*{(8)}

Here, BB is the magnitude of the applied magnetic field, and α\alpha is its angle measured from +y+y toward +x+x. The field components are

Bx=Bsin⁡α,By=Bcos⁡α.(9)B_x = B\sin\alpha, \qquad B_y = B\cos\alpha. \tag*{(9)}

Thus, at a fixed operating condition, each candidate command specifies the applied field in Eq. (6) and defines one equilibrium problem through Eqs. (1) and (2).

The nonlinear equilibrium problem is solved using 16 load increments. The applied magnetic field and mechanical force are increased proportionally from zero to their prescribed endpoint values, while γG\gamma_G remains fixed. At each increment, Newton’s method is initialized with the converged displacement from the preceding increment. Both FE models are implemented in FEniCSx/DOLFINx [37]. In both models, the energy density enters the variational form directly, and the residual and tangent used by Newton’s method are obtained by differentiation with respect to the displacement. No history-dependent constitutive update is performed at the material points.

Following the operator notation in [7], this FE calculation defines the forward solution operator

F:M→U,u=F(m).(10)\mathcal{F}:\mathcal{M}\to\mathcal{U},\qquad\boldsymbol{u}=\mathcal{F}(\boldsymbol{m}). \tag*{(10)}

For each prescribed input m\boldsymbol{m}, F(m)\mathcal{F}(\boldsymbol{m}) returns the converged displacement at the endpoint of the loading path. This displacement provides the QoIs used in the two command-selection problems defined below.

Platform command problem

The primary example is the compliant positioning platform shown in Figure 1(a). For each operating condition θ\boldsymbol{\theta} and candidate command a\boldsymbol{a}, the displacement u=F(m)\boldsymbol{u}=\mathcal{F}(\boldsymbol{m}) provides four QoIs describing the platform pose and local strain. Their geometric definitions are illustrated in Figure 3.

Image not extracted

Figure 3. Platform quantities of interest. The translations dxd_x and dyd_y are area-averaged displacements of the stiff platform ΩP\Omega_P, and ϕP\phi_P is its finite rigid-body rotation. The displaced outline is exaggerated to illustrate the pose quantities. The yellow regions mark the four ligament roots and four ligament–platform junctions; q99q_{99} is the maximum of their area-weighted 99th-percentile equivalent strains.

Let ΩP\Omega_P denote the stiff central platform. Its translation is defined by the area-averaged displacement

d=(dx,dy)=1∣ΩP∣∫ΩPu dA.(11)\boldsymbol{d}=(d_x,d_y)=\frac{1}{\lvert\Omega_P\rvert}\int_{\Omega_P}\boldsymbol{u}\,\mathrm{d}A. \tag*{(11)}

The platform rotation ϕP\phi_P is the angle of the rigid rotation that best aligns the reference and deformed platform coordinates after removing translation. This rotation is determined by minimizing the squared mismatch between corresponding positions.

Local strain is assessed in the eight regions near the four clamped roots and four ligament–platform junctions highlighted in Figure 3. Denote these regions by Ωkq\Omega_k^q, k=1,…,8k=1,\ldots,8. Let EE be the three-dimensional extension of (FTF−I)/2(\mathbf{F}^{T}\mathbf{F}-\mathbf{I})/2 with E33=0E_{33}=0 under plane strain. The equivalent strain is εeq=(2/3)dev⁡E:dev⁡E\varepsilon_{\mathrm{eq}}=\sqrt{(2/3)\operatorname{dev}\mathbf{E}:\operatorname{dev}\mathbf{E}}, where the deviator is taken in three dimensions. The strain QoI is

q99=max⁡1≤k≤8perc⁡99(εeq|Ωkq).(12)q_{99}=\max_{1\leq k\leq8}\operatorname{perc}_{99}\left(\varepsilon_{\mathrm{eq}}\middle|_{\Omega_k^q}\right). \tag*{(12)}

Here, perc⁡99\operatorname{perc}_{99} denotes the area-weighted 99th percentile: the strain level at or below which approximately 99% of the region’s area lies. The percentile is calculated separately within each region before the maximum over the eight regions is taken. This choice avoids basing admissibility on a single sampled peak while retaining the largest regional percentile among the roots and junctions.

The platform QoIs are collected as

qP=QP(u)=(dx,ϕP,dy,q99).(13)\mathbf{q}_{P}=\mathcal{Q}_{P}(\mathbf{u})=(d_x,\phi_P,d_y,q_{99}). \tag*{(13)}

The horizontal translation dxd_x and rotation ϕP\phi_P are compared with the requested pose. The vertical drift dyd_y and regional strain q99q_{99} enter the mechanical admissibility checks.

The candidate command set is

AP={(0,0)}∪{(B,α):B∈{10,20,…,80} mT,α∈{−20,−10,0,10,20}∘},(14)\mathcal{A}_{P}=\{(0,0)\}\cup\{(B,\alpha):B\in\{10,20,\ldots,80\}\ \mathrm{mT},\alpha\in\{-20,-10,0,10,20\}^{\circ}\}, \tag*{(14)}

which contains 41 commands, including a single zero-field command.

For a prescribed target pose (dx∗,ϕP∗)(d_x^*,\phi_P^*), the command loss is

LP(a;θ)=(dx−dx∗0.05 mm)2+(wrap⁡(ϕP−ϕP∗)0.2887∘)2.(15)L_P(a;\theta)=\left(\frac{d_x-d_x^*}{0.05\ \mathrm{mm}}\right)^2+\left(\frac{\operatorname{wrap}(\phi_P-\phi_P^*)}{0.2887^{\circ}}\right)^2. \tag*{(15)}

The denominators set the relative scales of translation and rotation in the loss. The function wrap⁡(⋅)\operatorname{wrap}(\cdot) returns the signed angular difference on the principal interval.

Let APadm(θ)⊆AP\mathcal{A}_{P}^{\mathrm{adm}}(\theta)\subseteq\mathcal{A}_{P} contain the commands satisfying the prescribed mechanical admissibility criteria at operating condition θ\theta. The reference command minimizes the loss over this admissible set:

aP∗(θ)=arg⁡min⁡a∈APadm(θ)LP(a;θ).(16)a_P^*(\theta)=\mathop{\arg\min}_{a\in\mathcal{A}_{P}^{\mathrm{adm}}(\theta)}L_P(a;\theta). \tag*{(16)}

The platform admissibility limits and operating conditions are given in § 4.1 and 4.1.2.

Wishbone command problem

The second example is the gripping wishbone shown in Figure 1(b), with two magnetically active fingers supported by passive lower branches. For each operating condition and candidate command, the displacement u=F(m)\mathbf{u}=\mathcal{F}(\mathbf{m}) provides QoIs describing the relative positions of the finger tips and the strain near the root. These quantities are illustrated in Figure 4.

Image not extracted

Figure 4. Wishbone quantities of interest. The points cLc_L and cRc_R represent averages of the deformed positions along the highlighted inner tip segments, weighted by reference arclength. Their horizontal separation defines the aperture gg, the horizontal coordinate of their midpoint defines cxc_x, and their signed vertical difference defines δy\delta_y. The shaded root region ΩWq\Omega^{q}_{W} is used to calculate the area-weighted 99th-percentile equivalent strain q99q_{99}. The reference configuration is shown in light grey, and the deformed configuration illustrates the QoI definitions.

Let ΓLc\Gamma_L^c and ΓRc\Gamma_R^c denote the fixed inner tip segments in the reference configuration. Their averaged deformed positions are

cν=1∣Γνc∣∫Γνc(X+u) ds,ν∈{L,R},(17)\mathbf{c}_{\nu}=\frac{1}{|\Gamma_{\nu}^{c}|}\int_{\Gamma_{\nu}^{c}}(\mathbf{X}+\mathbf{u})\,\mathrm{d}s,\qquad\nu\in\{L,R\}, \tag*{(17)}

where ds\mathrm{d}s and ∣Γνc∣|\Gamma_{\nu}^{c}| are measured in the reference configuration. From these averaged positions, define

g=cR,x−cL,x,cx=cR,x+cL,x2,δy=cR,y−cL,y.(18)g=c_{R,x}-c_{L,x},\qquad c_x=\frac{c_{R,x}+c_{L,x}}{2},\qquad\delta_y=c_{R,y}-c_{L,y}. \tag*{(18)}

The aperture gg measures the horizontal separation of the two averaged tip positions, cxc_x gives the horizontal coordinate of their midpoint, and δy\delta_y measures their signed vertical mismatch.

The strain QoI uses the same area-weighted percentile as the platform but is evaluated over a single fixed root region ΩWq\Omega^{q}_{W}, highlighted in Figure 4:

q99=perc⁡99(εeq∣ΩWq).(19)q_{99} = \operatorname{perc}_{99}\left(\left.\varepsilon_{\mathrm{eq}}\right|_{\Omega^{q}_{W}}\right). \tag*{(19)}

No maximum over multiple regions is required. The wishbone QoIs are collected as

qW=QW(u)=(g,cx,δy,q99).(20)\mathbf{q}_{W} = \mathcal{Q}_{W}(u) = (g,c_x,\delta_y,q_{99}). \tag*{(20)}

The candidate command set is

AW={(0,0)}∪{(B,α):B∈{20,40,60,80} mT, α∈{−20,−10,0,10,20}},(21)\mathcal{A}_{W} = \{(0,0)\} \cup\{(B,\alpha): B \in\{20,40,60,80\}\,\mathrm{mT},\ \alpha\in\{-20,-10,0,10,20\}\}, \tag*{(21)}

which contains 21 commands, with all zero-field choices represented by (0,0)(0,0). Eight fixed targets are generated at the reference operating condition

θref=(1,0,0)(22)\theta_{\mathrm{ref}} = (1,0,0) \tag*{(22)}

using magnetic commands not included in AW\mathcal{A}_{W}. Each target jj specifies a desired aperture and lateral midpoint, (gj∗,cx,j∗)(g^{*}_{j},c^{*}_{x,j}). For target jj, the command loss is

LW,j(a;θ)=(g−gj∗5 mm)2+(cx−cx,j∗3 mm)2+0.25(δy3 mm)2+0.002(B80 mT)2.(23)L_{W,j}(a;\theta) = \left(\frac{g-g^{*}_{j}}{5\,\mathrm{mm}}\right)^{2} + \left(\frac{c_x-c^{*}_{x,j}}{3\,\mathrm{mm}}\right)^{2} + 0.25\left(\frac{\delta_y}{3\,\mathrm{mm}}\right)^{2} + 0.002\left(\frac{B}{80\,\mathrm{mT}}\right)^{2}. \tag*{(23)}

The first two terms measure the difference from the requested tip configuration, the third penalizes vertical mismatch, and the final term weakly penalizes magnetic-field magnitude. The aperture and root strain also enter the mechanical admissibility checks, whose limits are given in § 5.1.

Let AWadm(θ)⊆AW\mathcal{A}^{\mathrm{adm}}_{W}(\theta) \subseteq\mathcal{A}_{W} contain the mechanically admissible commands at operating condition θ\theta. The reference command for target jj is

aW,j⋆(θ)=arg⁡min⁡a∈AWadm(θ)  LW,j(a;θ).(24)a^{\star}_{W,j}(\theta) = \underset{a \in\mathcal{A}^{\mathrm{adm}}_{W}(\theta)}{\arg\min}\; L_{W,j}(a;\theta). \tag*{(24)}

Both examples use the displacement field to evaluate the achieved response and mechanical admissibility before selecting the command that minimizes the loss over the admissible set. § 3 introduces the neural-operator approximation and selective FE evaluations used to perform this calculation, together with the reuse of FE loading paths for adaptation.

Neural operator, QoI-error estimator, and adaptation

The command problems in § 2 require displacement predictions for a discrete set of candidate magnetic commands. The procedure in Figure 2 combines neural-operator predictions with a fixed number of FE evaluations. For each operating condition, the neural operator predicts the displacement for every candidate command, and an empirical error estimator determines which predicted QoIs may be used. Four commands are also evaluated by FE. Command selection then uses the accepted surrogate predictions and the FE results, while the complete FE loading paths are retained for subsequent adaptation.

POD neural operator

We use a projection-based neural operator [6] (see [7 Sections 2.3 and 4.2]) to approximate the forward map m↦um \mapsto u in Eq. (10) by learning the coefficients of a reduced displacement representation. In this section, u∈RpUu \in\mathbb{R}^{p_U} denotes the vector of FE displacement degrees of freedom. A proper orthogonal decomposition (POD) gives

u≈uˉ+Vru~,VrTMVr=I,r=16,(25)u \approx\bar{u} + V_r \tilde{u}, \qquad V_r^{T} M V_r = I, \qquad r = 16, \tag*{(25)}

where uˉ\bar{u} is the mean of the FE displacement snapshots, MM is the displacement mass matrix, Vr∈RpU×rV_r \in\mathbb{R}^{p_U \times r} contains the retained POD modes, and u~∈Rr\tilde{u} \in\mathbb{R}^{r} contains their coefficients. Each snapshot is an FE displacement solution at a loading increment. The basis is orthonormal with respect to the mass inner product, with associated norm ∥v∥M=(vTMv)1/2\lVert v \rVert_M = (v^{T} M v)^{1/2}.

The learned forward map is

FNOp(m;Θ)=uˉ+VrF~NOp(ξ(m);Θ),(26)\mathcal{F}_{\mathrm{NOp}}(m;\boldsymbol{\Theta}) = \bar{u} + V_r \widetilde{\mathcal{F}}_{\mathrm{NOp}}(\xi(m);\boldsymbol{\Theta}), \tag*{(26)}

where F~NOp\widetilde{\mathcal{F}}_{\mathrm{NOp}} is the neural network that predicts the POD coefficients, Θ\boldsymbol{\Theta} contains its trainable parameters, and ξ(m)\xi(m) is its input vector. This vector contains the five components of mm in Eq. (1), augmented by

ByγG,BxγG,fxγG,fyγG,(27)\frac{B_y}{\gamma_G}, \qquad\frac{B_x}{\gamma_G}, \qquad\frac{f_x}{\gamma_G}, \qquad\frac{f_y}{\gamma_G}, \tag*{(27)}

giving nine inputs. All nine quantities are then affinely scaled using fixed bounds determined from the nominal input box; inputs outside those bounds are not clipped. The additional ratios express the applied field and mechanical force relative to the stiffness multiplier.

The data and training settings for the initial operator M0M_0 are summarized in Table 1. For each example, disjoint nominal FE loading paths are used for training, validation, and final evaluation. Validation determines which trained operator is retained, while the test paths are reserved for final assessment. The platform and wishbone use the same settings but have separate POD bases, neural operators, estimators, and data.

QuantitySpecification
Nominal FE data
Training paths200
Validation paths25
Held-out test paths30
Retained increments per training path16
Coefficient network
ArchitectureFully connected neural network
Hidden layersFour layers, each containing 256 units
ActivationGaussian error linear unit (GELU)
Outputs16 POD coefficients
Trainable parameters204,048
Initial training
OptimizerAdamW
Learning rate10−310^{-3}
Weight decay10−610^{-6}
Batch size128
Maximum training duration4000 epochs
Early stopping250 consecutive epochs without improvement

Table 1. Data, coefficient-network architecture, and initial training settings for each example.

Training uses AdamW, an adaptive gradient optimizer with weight decay. The squared coefficient error corresponds to the squared mass-norm displacement error within the retained POD space; it does not include the error from truncating the POD representation.

QoI error and empirical estimate

The accuracy needed for command selection is assessed through the QoIs defined in § 2. For an input m\mathbf{m}, the current neural operator gives u^=FNOp(m;Θ)\hat{\mathbf{u}} = \mathcal{F}_{\mathrm{NOp}}(\mathbf{m};\boldsymbol{\Theta}) and predicted QoIs q^=Q(u^)\hat{\mathbf{q}} = \mathcal{Q}(\hat{\mathbf{u}}). When the FE solution is available, these predictions can be compared with q=Q(u)\mathbf{q} = \mathcal{Q}(\mathbf{u}) using

EQ=max⁡1≤k≤4∣q^k−qk∣τk,(28)E_Q = \max_{1 \leq k \leq4} \frac{\lvert\hat{q}_k - q_k \rvert}{\tau_k}, \tag*{(28)}

where τk\tau_k is the prescribed error tolerance for the kkth QoI. Thus, EQ≤1E_Q \leq1 means that all four QoI errors satisfy their error tolerances.

For the platform, the error tolerances are

τP=(0.05 mm,0.2887∘,0.05 mm,0.01),(29)\boldsymbol{\tau}_P = (0.05\ \mathrm{mm}, 0.2887^\circ, 0.05\ \mathrm{mm}, 0.01), \tag*{(29)}

corresponding to (dx,ϕP,dy,q99)(d_x, \phi_P, d_y, q_{99}). For the wishbone,

τW=(0.05 mm,0.05 mm,0.05 mm,0.01),(30)\boldsymbol{\tau}_W = (0.05\ \mathrm{mm}, 0.05\ \mathrm{mm}, 0.05\ \mathrm{mm}, 0.01), \tag*{(30)}

corresponding to (g,cx,δy,q99)(g, c_x, \delta_y, q_{99}). These tolerances constrain the surrogate error, whereas the mechanical admissibility limits constrain the response itself.

At an input not evaluated by FE, EQE_Q is unavailable. Its empirical estimate is constructed from four scalar features: two describe the residual and linearized response at the predicted displacement, and two describe the location of the input relative to the available data.

For the first two features, the nonlinear residual is assembled at u^\hat{u} and the linear system

A(u^;m) δu=−R(u^;m),A(u^;m)=DuR(u^;m)(31)A(\hat{u};m)\,\delta u=-R(\hat{u};m), \qquad A(\hat{u};m)=D_uR(\hat{u};m) \tag*{(31)}

is solved once. Here, RR is the assembled residual of the equilibrium problem in Eq. (2), and AA is its derivative with respect to the displacement vector. The resulting δu\delta u describes the response of this linearized problem to the residual. It is used only for error estimation; the QoIs continue to be evaluated from u^\hat{u}, not from u^+δu\hat{u}+\delta u.

The two residual-based features are

ρ=∥R(u^;m)∥2∥R(0;m)∥2,ηδu=∥δu∥M∥u^∥M.(32)\rho=\frac{\lVert R(\hat{u};m)\rVert_2}{\lVert R(0;m)\rVert_2}, \qquad\eta_{\delta u}=\frac{\lVert\delta u\rVert_M}{\lVert\hat{u}\rVert_M}. \tag*{(32)}

The quantity ρ\rho measures the residual at the predicted displacement relative to that at zero displacement, while ηδu\eta_{\delta u} measures the size of the linearized response relative to the prediction.

The distance features use the five-component input vector in Eq. (1). Let ℓ\ell and hh denote the componentwise lower and upper bounds of the nominal input box, and let w=h−ℓw=h-\ell. The normalized distance outside this box is

dbox=∥[ℓ−m]++[m−h]+w∥2,(33)d_{\mathrm{box}}=\left\lVert\frac{[\ell-m]_+ + [m-h]_+}{w}\right\rVert_2, \tag*{(33)}

where [⋅]+[\cdot]_+ replaces negative components by zero and division by ww is componentwise. Thus, dbox=0d_{\mathrm{box}}=0 inside the nominal box. The distance to the nearest input in the augmented data is

daug=min⁡mi∈Daug∥m−miw∥2,(34)d_{\mathrm{aug}}=\min_{m_i\in\mathcal{D}_{\mathrm{aug}}}\left\lVert\frac{m-m_i}{w}\right\rVert_2, \tag*{(34)}

where Daug\mathcal{D}_{\mathrm{aug}} contains the increment inputs from the 200 nominal training paths and the FE paths acquired during adaptation. For a fixed input, dboxd_{\mathrm{box}} remains unchanged as data are added, whereas daugd_{\mathrm{aug}} reflects the additional inputs represented by the acquired paths.

The estimator uses the feature vector

s=(log⁡ρ,log⁡ηδu,dbox,daug).(35)s=(\log\rho,\log\eta_{\delta u},d_{\mathrm{box}},d_{\mathrm{aug}}). \tag*{(35)}

Before taking logarithms, values of ρ\rho and ηδu\eta_{\delta u} below 10−1610^{-16} are replaced by 10−1610^{-16}. The same lower bound is applied to EQE_Q when fitting log⁡EQ\log E_Q.

The estimator is fitted using development data with FE reference solutions, divided into regression and calibration subsets. The regression subset supplies the componentwise feature means μs\boldsymbol{\mu}_s and standard deviations σs\boldsymbol{\sigma}_s used for standardization:

z=diag⁡(σs)−1(s−μs).(36)z=\operatorname{diag}(\boldsymbol{\sigma}_s)^{-1}(s-\boldsymbol{\mu}_s). \tag*{(36)}

Ridge regression fits a linear approximation β0+βTz\beta_0+\boldsymbol{\beta}^{T}z to log⁡EQ\log E_Q, with a quadratic penalty on the regression coefficients. Here, β0\beta_0 is the intercept and β\boldsymbol{\beta} contains the coefficients. The penalty parameter is selected from 10−4,10−3,…,10210^{-4},10^{-3},\ldots,10^2 using leave-path-out validation, in which all samples belonging to a validation path are excluded from the regression fit.

The calibration subset supplies an additive adjustment to the fitted log-error:

E^Q=exp⁡(β0+βTz+qcal),qcal=Q0.90[log⁡EQ−(β0+βTz)].(37)\begin{aligned} \widehat{E}_Q &= \exp\left(\beta_0+\beta^T z+q_{\mathrm{cal}}\right),\\ q_{\mathrm{cal}} &= Q_{0.90}\left[\log E_Q-\left(\beta_0+\beta^T z\right)\right]. \tag*{(37)} \end{aligned}

Here, Q0.90Q_{0.90} is the empirical 90th percentile of the regression residuals on the calibration subset. Exponentiation returns the estimate to the scale of EQE_Q.

A surrogate prediction is accepted for command selection when E^Q≤1\widehat{E}_Q \le1 and the predicted field satisfies the prescribed mechanical admissibility checks. Values of log⁡E^Q\log\widehat{E}_Q above log⁡(106)\log(10^6) are capped and recorded, and the corresponding predictions are not accepted. A false acceptance occurs when an accepted prediction is subsequently evaluated by FE and found to have EQ>1E_Q > 1. This acceptance criterion is empirical: calibration does not establish a guaranteed upper bound on the error at an individual input.

Selective FE evaluation and command calculation

For a fixed operating condition θ\theta, the current neural operator and estimator evaluate every command in the candidate set. Exactly four commands are selected for FE evaluation under either an estimator-guided or a random acquisition strategy. The number of FE evaluations is fixed, regardless of how many surrogate predictions are accepted.

Estimator-guided acquisition first considers commands whose surrogate predictions are not accepted. If this set is nonempty, the command with the largest E^Q\widehat{E}_Q is selected first. Further commands from this set are chosen to maximize their minimum normalized input-space distance from those already selected, with E^Q\widehat{E}_Q used to break ties. This rule prioritizes commands with unaccepted predictions while separating the selected inputs. If fewer than four predictions are unaccepted, the remaining evaluations are assigned to the unselected commands with the largest E^Q\widehat{E}_Q.

Random acquisition selects four commands uniformly without replacement from the complete candidate set using fixed random seeds. This comparison uses the same FE budget without using the error estimate to determine which commands are evaluated.

After these evaluations, the available command set is

Aavail=AFE∪ANOpacc,(38)\mathcal{A}_{\mathrm{avail}}=\mathcal{A}_{\mathrm{FE}}\cup\mathcal{A}_{\mathrm{NOp}}^{\mathrm{acc}}, \tag*{(38)}

where AFE\mathcal{A}_{\mathrm{FE}} contains the four FE-evaluated commands and ANOpacc\mathcal{A}_{\mathrm{NOp}}^{\mathrm{acc}} contains the commands with accepted surrogate predictions that were not selected for FE. For each command in AFE\mathcal{A}_{\mathrm{FE}}, the FE QoIs replace the surrogate values. A command whose prediction is not accepted and that is not selected for FE remains unavailable.

The available QoIs enter the loss functions in Eqs. (15) and (23). The four-FE calculation selects among the four FE-evaluated commands, whereas the hybrid calculation also includes commands with accepted neural-operator predictions. In both calculations, mechanical admissibility is assessed using the corresponding FE solution or surrogate prediction, and the command with the smallest loss among the admissible candidates is selected.

For final assessment, the complete candidate command set at each test condition is also evaluated by FE. These reference evaluations provide the FE-optimal command and are kept separate from command selection, estimator fitting, and adaptation. Command quality is measured by agreement with the FE-optimal command and by the FE-evaluated regret,

R=LFE(aselected)−LFE(aFE∗),(39)R=L_{\mathrm{FE}}\left(a_{\mathrm{selected}}\right)-L_{\mathrm{FE}}\left(a_{\mathrm{FE}}^*\right), \tag*{(39)}

where aFE∗a^{*}_{\mathrm{FE}} minimizes the loss over the complete FE-admissible command set. Both losses are evaluated for the same operating condition and target. Regret therefore measures the excess FE loss of the selected command relative to the reference optimum; R=0R = 0 when the two losses are equal.

Periodic adaptation

The FE solutions at the loading-path endpoints provide the QoIs used for command selection. The intermediate equilibrium solutions are also retained, so each acquired path supplies 16 displacement samples for adaptation. Four paths are collected at each of four adaptation conditions. Updates after eight and 16 acquired paths produce candidate operators M1M_1 and M2M_2, respectively. The POD mean and basis remain fixed; only the learned input-to-coefficient map is updated. A candidate update is used only if it satisfies the validation requirements described below.

At each adaptation condition, the acquired path with the smallest command index is reserved for adaptation validation. The remaining acquired paths are used for continued training. Each training batch contains equal numbers of acquired samples and samples from 32 fixed nominal paths. Reusing the nominal samples alongside the new data is intended to preserve accuracy within the initial training regime. All 16 increments from each path are retained.

Continued training starts from the parameters of the current operator and uses AdamW with a learning rate of 10−410^{-4} and a batch size of 128. Training continues for at most 1000 epochs and stops after 100 epochs without improvement. A candidate updated operator must reduce the adaptation-validation mass error relative to the operator before updating. It must also satisfy two requirements on the 25 nominal validation paths:

median⁡valEQ≤0.25,#{EQ≤1}≥24.(40)\operatorname{median}_{\mathrm{val}} E_Q \le0.25,\qquad\#\{E_Q \le1\} \ge24. \tag*{(40)}

Among the candidates satisfying these requirements, the operator with the smallest adaptation-validation mass error is retained. If none qualifies, the preceding operator remains in use. Preservation of nominal accuracy is subsequently assessed on the separate 30-path test set, not on the validation data used to select the update.

The empirical error estimator is refitted for each accepted updated operator using its predictions and the available FE data. Separate estimator fits are used for acquisition and final assessment. The acquisition estimator uses only FE reference data available before the four new commands are selected at the current adaptation condition. The estimator used for final assessment may additionally use the prescribed development data and previously acquired paths, but neither fit uses the held-out shifted paths or final command-test data. These final data therefore assess the resulting predictions and decisions without influencing the estimator used to make them.

Compliant positioning platform

The platform study examines whether FE loading paths collected under changing stiffness and mechanical loading can improve subsequent displacement predictions and positioning decisions. The command problem uses horizontal translation and rotation to specify the requested pose, with vertical drift and regional strain entering the admissibility checks; see Eqs. (13) and (15). The numerical setup is presented first, followed by the results for forward accuracy, error estimation, command selection, and computational work.

Numerical setup

Geometry and FE model

The platform geometry, boundary conditions, mesh, and representative deformations are shown in Figure 5. Four curved hMSM ligaments of width 1.4 mm support a stiff central platform. The outer ligament roots are clamped, and the prescribed force (fxP,fyP)(f_x^P, f_y^P) is applied to the top edge of the platform. The modeled thickness is 3 mm. The base ligament shear modulus is 100 kPa, and the platform stiffness is 100 times the ligament stiffness. The ligaments have a magnetic-particle volume fraction ϕ=0.30\phi= 0.30 and a remanent flux density of magnitude 200 mT, directed at −25∘-25^\circ in the upper ligaments and +25∘+25^\circ in the lower ligaments. The platform is magnetically inactive.

Image not extracted

Figure 5. Platform geometry and representative FE responses. (a) Reference geometry, mesh, clamped roots, and loaded platform edge. The yellow and cyan regions identify the root and junction regions used to calculate q99q_{99}. (b) Platform translation and rotation. (c)–(e) FE deformations at T1T_1 in Table 3, for B=0B = 0 and for B=80 mTB = 80\,\mathrm{mT} at α=−20∘\alpha= -20^\circ and +20∘+20^\circ, respectively. Displacements in the deformation panels are amplified by a factor of two.

The domain is discretized using 8,360 triangles and vector-valued quadratic displacement elements, giving 35,358 displacement degrees of freedom. The equilibrium solution follows the Newton iteration and 16-increment loading procedure in § 2. An FE path is admissible only if the nonlinear solution converges, JJ is positive at the sampled locations, and no contact or self-intersection is detected. The platform must remain separated from the frame and the central cavity must remain open. The response must also satisfy ∣dy∣≤0.05|d_y| \le0.05 mm, q99≤0.10q_{99} \le0.10, and εrig<10−3\varepsilon_{\mathrm{rig}} < 10^{-3}. Here, εrig=∥u−urig∥L2(ΩP)/∥u∥L2(ΩP)\varepsilon_{\mathrm{rig}} = \lVert\mathbf{u} - \mathbf{u}_{\mathrm{rig}}\rVert_{L^2(\Omega_P)}/\lVert\mathbf{u}\rVert_{L^2(\Omega_P)}, where urig(X)=d+[QP(ϕP)−I](X−Xc)\mathbf{u}_{\mathrm{rig}}(\mathbf{X}) = \mathbf{d} + [\mathbf{Q}_P(\phi_P) - \mathbf{I}](\mathbf{X} - \mathbf{X}_c). The matrix QP(ϕP)\mathbf{Q}_P(\phi_P) is the planar rotation through ϕP\phi_P, and Xc\mathbf{X}_c is the reference centroid of the platform.

Nominal data and shifted operating conditions

Nominal FE loading paths are generated from endpoint inputs in the ranges

B∈[0,80] mT,α∈[−20,20]∘,γG∈[0.95,1.05],fxP∈[−0.10,0.10] mN,fyP∈[−0.65,0] mN.(41)B \in[0,80]\ \mathrm{mT}, \qquad\alpha\in[-20,20]^\circ, \qquad\gamma_G \in[0.95,1.05], \\ f_x^P \in[-0.10,0.10]\ \mathrm{mN}, \qquad f_y^P \in[-0.65,0]\ \mathrm{mN}. \tag*{(41)}

The 200 training, 25 validation, and 30 test paths are disjoint, as specified in Table 1. All 16 increments of each training path are retained. The 41 candidate commands in Eq. (14) lie within the magnetic-field ranges used to generate the nominal data.

The controlled shift reduces the stiffness multiplier and increases the horizontal force while preserving the vertical-force and magnetic-field ranges. Three shifted input ranges, S1, S2, and S3, are prescribed before final evaluation and assessed using 12 preliminary paths each; see Table 2. The range selected for the final shifted test is the first for which the initial operator has median EQ>1E_Q > 1 on these preliminary paths. S3 meets this criterion with median EQ=1.181E_Q = 1.181. A separate set of 30 S3 paths is reserved before adaptation for final evaluation.

Input rangeγG\gamma_GfxPf_x^P (mN)Preliminary median EQE_Q
Nominal[0.95, 1.05][−0.10, 0.10]—
S1[0.86, 0.94][0.25, 0.70]0.275
S2[0.78, 0.89][0.45, 1.00]0.735
S3[0.72, 0.84][0.70, 1.30]1.181

Table 2. Nominal and shifted input ranges for the platform. The magnetic-field ranges are those in Eq. (41), and fyP∈[−0.65,0]f_y^P \in[-0.65,0] mN for every set. Each shifted range is assessed using 12 preliminary paths.

Four operating conditions, A1A_1 through A4A_4, are used to acquire FE paths for adaptation. Four additional conditions, T1T_1 through T4T_4, are reserved for testing command selection. Their inputs are listed in Table 3. Eight target poses are generated from FE solutions at the nominal reference condition (γG,fxP,fyP)=(1,0,−0.5 mN)(\gamma_G, f_x^P, f_y^P) = (1, 0, -0.5\,\mathrm{mN}): two use B=30 mTB = 30\,\mathrm{mT} with α=±15∘\alpha= \pm15^\circ, and six use B∈{50,70} mTB \in\{50, 70\}\,\mathrm{mT} with α∈{−15,0,15}∘\alpha\in\{-15, 0, 15\}^\circ. Six target-generating commands therefore use angles between those in the candidate set, while the two zero-angle commands belong to the set. The target poses remain fixed across the four test conditions.

AdaptationCommand tests
ConditionγG\gamma_GfxPf_x^PfyPf_y^PConditionγG\gamma_GfxPf_x^PfyPf_y^P
A1A_10.8160.82-0.4875T1T_10.8040.88-0.260
A2A_20.7920.94-0.1625T2T_20.7801.00-0.520
A3A_30.7681.06-0.3250T3T_30.7561.12-0.130
A4A_40.7441.18-0.4875T4T_40.7321.24-0.390

Table 3. Platform operating conditions. Force components are in mN. Four FE paths are acquired at each AkA_k. The conditions T1T_1 through T4T_4 are reserved for testing command selection.

Training, adaptation, and evaluation

The initial operator M0M_0 uses the rank-16 POD basis, coefficient network, and training procedure in § 3. The initial error estimator uses 32 FE endpoint solutions: 16 nominal and 16 shifted. Eight nominal and eight shifted endpoints form the regression subset, and the remaining 16 form the calibration subset used for the quantile adjustment in Eq. (37). Subsequent estimator fits use these original endpoints together with those acquired in the corresponding adaptation sequence. Acquired endpoints from A1A_1 and A3A_3 are assigned to regression, while those from A2A_2 and A4A_4 are assigned to calibration.

Five paired adaptation sequences compare random and estimator-guided acquisition. Each sequence collects four FE paths at each AkA_k, giving eight paths after A2A_2 and 16 after A4A_4. These data are used to construct candidate operators M1M_1 and M2M_2. An update is used for subsequent command calculations only if it satisfies Eq. (40); otherwise, the preceding operator remains in use.

Forward accuracy is assessed using EQE_Q in Eq. (28) on the 30 held-out nominal paths and the 30 held-out S3 paths. The condition EQ≤1E_Q \le1 means that all four QoI errors satisfy their prescribed tolerances. Estimator reliability is assessed by comparing E^Q\widehat{E}_Q with EQE_Q, including false acceptance of inaccurate predictions, false rejection of accurate predictions, and their rank correlation. For the field comparisons, each 30-path test set is ordered by increasing EQE_Q for the initial operator, and the 15th path is shown. This selects the lower of the two middle paths rather than the path with the smallest error.

Command selection is assessed for the eight fixed targets at each of the four test conditions in Table 3, giving 32 combinations of target and operating condition per operator. The complete 41-command FE response set at each condition provides the reference optimum and the losses used to calculate regret in Eq. (39). Each hybrid calculation uses only its four selected FE evaluations and the accepted surrogate predictions, as described in § 3. The remaining reference FE solutions are used for assessment, not to select the command or update the operator and estimator.

Results

Nominal forward accuracy

Within the nominal input range in Eq. (41), the initial operator M0M_0 accurately reproduces the FE response. Its median EQE_Q is 0.0088 on the 25 validation paths and 0.0081 on the 30 held-out test paths. Every prediction in both sets satisfies EQ≤1E_Q \le1.

The field comparison in Figure 6 uses the 15th path after ordering the 30 nominal test paths by the initial operator’s error, as specified in § 4.1.3. For this path, the relative mass-weighted displacement error is 3.58×10−43.58 \times10^{-4}. The FE pose is (dx,ϕP)=(−0.0127 mm,−6.1452∘)(d_x,\phi_P)=(-0.0127\ \mathrm{mm},-6.1452^\circ), compared with (−0.0126 mm,−6.1475∘)(-0.0126\ \mathrm{mm},-6.1475^\circ) from M0M_0. The corresponding QoI error is EQ=0.0077E_Q=0.0077.

Image not extracted

Figure 6. Platform FE solution and initial neural-operator prediction for the 15th of 30 nominal test paths ordered by the initial operator’s EQE_Q. The first two panels use the same displacement-magnitude scale; the third shows the pointwise displacement error. All fields are shown on the reference configuration.

Shifted forward accuracy and adaptation

The same operator loses accuracy in S3, the reduced-stiffness and increased-horizontal-force range selected in Table 2. On the separate 30-path S3 test, median EQE_Q increases to 1.147, and 21 predictions exceed the prescribed tolerance. The median relative mass-weighted displacement error is 0.0431.

To distinguish error in the learned coefficients from error due to the reduced representation, the same 30 FE displacement fields are projected onto the fixed rank-16 POD basis. The QoIs computed from these projected fields have median EQ=7.08×10−4E_Q = 7.08 \times10^{-4}. The basis therefore represents the tested shifted responses accurately; the substantial error of M0M_0 is primarily associated with the learned input-to-coefficient map.

Figure 7 compares the initial and updated predictions for the 15th path after ordering the S3 test set by the initial operator’s error. The FE response is dx=0.0374d_x = 0.0374 mm and ϕP=−4.6702∘\phi_P = -4.6702^\circ. The initial operator predicts dx=0.0172d_x = 0.0172 mm and ϕP=−4.3438∘\phi_P = -4.3438^\circ, giving EQ=1.131E_Q = 1.131. The accepted M2M_2 operator from random-acquisition seed 1 predicts dx=0.0422d_x = 0.0422 mm and ϕP=−4.8976∘\phi_P = -4.8976^\circ, reducing the error to EQ=0.788E_Q = 0.788. This comparison uses the same input before and after adaptation; it is not selected by the updated operator’s error.

Image not extracted

Figure 7. Platform FE solution, initial prediction, and accepted 16-path updated prediction for the same S3S3 test input. The input is the 15th of 30 paths ordered by the initial operator’s EQE_Q. The update uses random-acquisition seed 1. Displacement panels share one color scale, and error panels share a separate scale. Results across all five acquisition sequences are given in Figure 8.

Figure 8 reports the errors over the complete S3 test set. For each random-acquisition sequence, the median is calculated over the 30 test paths. The median of these five sequence-level medians decreases from 1.147 for M0M_0 to 0.226 after eight acquired paths and 0.144 after 16 paths. All five random-acquisition sequences produce accepted updates at both stages under Eq. (40). After 16 paths, the numbers of predictions with EQ>1E_Q > 1 are 1, 1, 0, 0, and 1 across the five sequences.

Image not extracted

Figure 8. Platform QoI errors before and after adaptation. The leftmost distribution uses the 30 nominal test paths; the remaining distributions use the 30 S3 test paths from Table 2. The five random-acquisition sequences are shown individually. Only estimator-guided seed 3 satisfies the update-acceptance requirements at both stages. The shaded candidate updates reduce shifted error but are not used for command selection because they fail validation.

For estimator-guided acquisition, only seed 3 produces accepted updates at both stages. Its 16-path operator has median EQ=0.178E_Q = 0.178, with all 30 shifted predictions satisfying the tolerance. The other four candidate M2M_2 operators reduce the shifted median to values between 0.35 and 0.46 but fail the adaptation-validation requirement. They are shown for comparison and are not used for command selection. Every accepted update preserves EQ≤1E_Q \le1 on all 30 nominal test paths.

The different update-acceptance counts do not by themselves establish that random acquisition is preferable. Estimator-guided acquisition selects the zero-field command first at each adaptation condition. Under the smallest-command-index rule in § 3, zero-field paths therefore supply the adaptation-validation data. Four estimator-guided sequences share one 16-path set, while seed 3 selects different commands at A3A_3 and A4A_4 and produces a second set. Random acquisition produces five distinct path sets. The comparison consequently depends on both the acquired data and the validation requirement and does not support a general ranking of the acquisition strategies.

QoI-error estimation

The initial error estimator is assessed on the same 30 held-out S3S3 paths used for the forward-error test. In Figure 9, E^Q\widehat{E}_Q is compared with the FE-evaluated error EQE_Q. The estimator rejects 28 of the 30 predictions. Of the 21 predictions with EQ>1E_Q > 1, one is incorrectly accepted. Of the nine predictions with EQ≤1E_Q \le1, eight are incorrectly rejected. The fraction satisfying EQ≤E^QE_Q \le\widehat{E}_Q, reported as empirical coverage, is 0.87. The Spearman rank correlation between estimated and actual error is −0.11-0.11.

Image not extracted

Figure 9. Initial platform error estimate versus FE-evaluated QoI error on the 30 S3 test paths. Acceptance requires E^Q≤1\widehat{E}_Q \le1, while the actual accuracy requirement is EQ≤1E_Q \le1. The estimator accepts one inaccurate prediction and rejects eight accurate predictions. Its rejection of 28 of 30 predictions and negative rank correlation indicate poor discrimination between acceptable and unacceptable errors.

The estimator excludes most inaccurate predictions, but it also excludes nearly all accurate predictions in this shifted test. The small number of false acceptances therefore does not establish effective discrimination. When few surrogate predictions are accepted, the hybrid command calculation has little information beyond its four FE evaluations. The estimate remains empirical and does not provide a guaranteed error bound.

Command selection

The command tests use the eight fixed target poses and four operating conditions defined in § 4.1.2 and Table 3. The hybrid calculation combines the four selected FE evaluations with accepted surrogate predictions. Its selected command is assessed using the FE loss in Eq. (15) and regret in Eq. (39).

Figure 10 illustrates the calculation at T1T_1 for the eighth fixed target, labeled T8 in the figure. The initial-operator calculation selects command 29, whose FE loss is 5.76. The FE-optimal command is 23, with loss 0.79, giving regret 4.97. After the accepted 16-path random update, the hybrid calculation selects command 23 and has zero regret. The same four commands are evaluated by FE before and after updating. The total available command set, including FE-evaluated commands, expands from four to all 41 candidates as more surrogate predictions are accepted.

Image not extracted

Figure 10. FE responses of all 41 platform commands in the (dx,ϕP)(d_x,\phi_P) plane at T1T_1 for the eighth target, labeled T8T8. The dashed ellipses are contours of the pose loss LPL_P about T8T8. The initial hybrid calculation selects command 29 rather than the FE-optimal command 23. The accepted 16-path random update selects command 23 while using the same four FE evaluations. The remaining FE responses are used only to assess the selected commands.

The complete command results are shown in Figure 11. At each test condition, each acquisition sequence is summarized by its median regret over the eight targets. Taking the median across the five random-acquisition sequences gives 7.51, 13.16, 9.51, and 14.34 before adaptation at T1T_1 through T4T_4, respectively. After eight acquired paths, these values are 0, 0, 0, and 5.74. After 16 paths, the median is zero at every condition. Residual differences remain between sequences: the largest reported seed-level regrets after 16 paths are 0 at T1T_1 and T2T_2, 0.189 at T3T_3, and 0.108 at T4T_4. Zero median regret does not mean that every target selects the FE-optimal command, as the agreement results in the lower row of the figure show.

Image not extracted

Figure 11. Platform command results before adaptation and after eight and 16 acquired paths at the conditions in Table 3. The upper row shows median FE-evaluated regret over eight targets for each acquisition sequence; the lower row shows the fraction of targets selecting the FE-optimal command. Random and estimator-guided acquisition already select different four-command FE sets before adaptation, so their initial differences are not caused by learning. Sequences whose operator updates fail validation retain M0M_0, although refitting the estimator and selecting a new four-command FE set can change their decisions.

The accepted estimator-guided sequence, seed 3, reduces its median regret across the four conditions from 182 to 0.121 after eight paths and to zero after 16 paths. The other four estimator-guided sequences retain M0M_0 because their candidate updates fail validation. Changes in their command results arise from refitting the estimator and changing the four commands selected for FE, rather than from updating the forward operator.

Computational work

The platform study uses 681 unique FE loading paths and 2.74 h of recorded single-process FE solution time. Their purposes are separated in Figure 12. The nominal data comprise 200 training, 25 validation, and 30 test paths, totaling 255. Preliminary evaluation of S1 through S3 uses 36 paths, and initial estimator calibration uses 32. Acquisition contributes 82 unique paths after accounting for reuse, and final shifted forward evaluation uses 30 S3 paths. The complete-command FE response sets contain 328 paths, of which 82 are reused from acquisition and 246 require additional solutions.

Image not extracted

Figure 12. Unique platform FE loading paths and recorded FE solution time by purpose. The nominal category includes training, validation, and testing. Complete-command reference calculations are used to assess the selected commands; only four selected FE evaluations enter each hybrid command calculation. These totals do not constitute a measurement of the time required for one complete surrogate-assisted decision.

Training M0M_0 takes 88 s, and the 20 attempts to train updated operators take 105 s in total. These measurements quantify FE data generation and operator training. They do not establish an end-to-end speedup because the combined times for neural-operator evaluation, residual assembly, the linearized solve, QoI evaluation, and command selection were not recorded for the final tests.

Gripping wishbone

The wishbone study applies the same prediction, error-estimation, and adaptation procedure to a different geometry and command objective. The target response is specified by finger aperture and lateral midpoint, while vertical mismatch contributes to the loss and root strain enters the admissibility checks; see Eqs. (20) and (23). Its FE data, POD basis, neural operator, and estimator are constructed independently of those used for the platform.

Numerical setup

Geometry and FE model

The wishbone geometry, candidate command set, and representative FE deformations are shown in Figure 13. The base is clamped, and the prescribed force (fxR,fyR)(f_x^R, f_y^R) is applied to the right tip. The lower branches are passive, with ϕ=0\phi= 0, while both upper fingers have ϕ=0.30\phi= 0.30 and a remanent flux density of magnitude 40 mT. The mirrored remanent directions are indicated in the figure. The active fingers meet the passive branches at y=20.32y = 20.32 mm in the reference configuration.

Image not extracted

Figure 13. Wishbone geometry, candidate commands, and FE responses. (a) Plane-strain geometry and mesh, clamped base, right-tip force, and active and passive regions. The fingers have ϕ=0.30\phi= 0.30 and ∣Br∣=40\lvert B^{r}\rvert= 40 mT, with mirrored remanent directions indicated by arrows. (b) The 21 candidate commands in the (Bx,By)(B_x, B_y) plane. (c) FE deformations at T2T_2 in Table 4: the zero-field command a0a_0 and commands a16a_{16} and a20a_{20} with B=80B = 80 mT and α=−20∘\alpha= -20^\circ and +20∘+20^\circ, respectively. Deformations are shown at true scale over the reference mesh.

The domain is discretized using 6,820 conforming triangles and vector-valued quadratic Lagrange elements, giving 28,510 displacement degrees of freedom. The equilibrium solution uses Newton iteration with 16 load increments and the MUMPS direct linear solver. Each stored path is checked for nonlinear convergence, satisfaction of the prescribed displacement conditions, finite solution values, positive JJ at the sampled locations, and absence of finger intersections. Mechanical admissibility additionally requires g≥2g \ge2 mm and q99≤0.35q_{99} \le0.35. The strain limit is a numerical constraint used in this study, not an experimentally determined failure threshold. The simulations describe free finger motion; contact with a gripped object and the resulting gripping force are not modeled.

Nominal data, shifted conditions, and targets

Nominal input combinations for the training, validation, and test sets are generated within the following ranges using randomized Sobol sampling, with a different seed for each set:

B∈[0,80] mT,α∈[−20,20]∘,γG∈[0.90,1.10],fxR,fyR∈[−0.75,0.75] mN.(42)B \in[0,80]\ \mathrm{mT}, \qquad\alpha\in[-20,20]^\circ, \qquad\gamma_G \in[0.90,1.10], \qquad f_x^R,f_y^R \in[-0.75,0.75]\ \mathrm{mN}. \tag*{(42)}

The 200 training, 25 validation, and 30 test paths are disjoint. The shifted operating range is

γG∈[0.75,0.89],fxR∈[1.00,2.00] mN,fyR∈[0.75,1.50] mN,(43)\gamma_G \in[0.75,0.89], \qquad f_x^R \in[1.00,2.00]\ \mathrm{mN}, \qquad f_y^R \in[0.75,1.50]\ \mathrm{mN}, \tag*{(43)}

with the magnetic-field ranges unchanged. Thirty held-out paths are generated from this shifted range using scrambled Sobol seed 26092101. These paths are excluded from estimator fitting, FE acquisition, continued training, and selection of the updated operators or training stopping criteria.

For the wishbone, Table 4 defines four adaptation conditions, A1A_1 through A4A_4, and four held-out command-test conditions, T1T_1 through T4T_4. Four FE paths are acquired at each AkA_k. The test conditions lie at increasing normalized distances dboxd_{\mathrm{box}} from the nominal input range, where the distance is defined in Eq. (33). The paths acquired at the adaptation conditions provide adaptation data, while FE solutions at the test conditions provide separate reference responses for final evaluation.

ConditionRoleγG\gamma_GfxRf_x^RfyRf_y^Rdboxd_{\mathrm{box}}
A1A_1Adaptation0.851.250.800.4180
A2A_2Adaptation0.831.400.900.5659
A3A_3Adaptation0.801.751.250.8975
A4A_4Adaptation0.782.001.501.1421
T1T_1Command test0.86931.00111.10060.3259
T2T_2Command test0.80861.11201.13090.5757
T3T_3Command test0.76851.53240.91380.8462
T4T_4Command test0.75431.67331.49011.0739

Table 4. Wishbone operating conditions. Force components are in mN. Four FE paths are acquired at each AkA_k; the conditions T1T_1 through T4T_4 are reserved for testing command selection. The last column gives the normalized distance outside the nominal input box.

The condition T1T_1 is separated by a normalized input distance of 0.066 from an earlier development condition used to select the estimator procedure. Its FE responses remain held out, but this proximity limits the conclusions that can be drawn about estimator performance away from the development conditions. The other three test conditions are at least 0.253 from the nearest earlier adaptation or decision condition.

The eight target apertures and lateral midpoints are generated at θref=(1,0,0)\boldsymbol{\theta}_{\mathrm{ref}} = (1, 0, 0) using magnetic commands outside the 21-command candidate set, as described in § 2. These targets remain fixed across T1T_1 through T4T_4. Evaluating all 21 commands at the four test conditions gives 84 FE loading-path endpoints. At each condition, the same response set is used for all eight targets, giving 32 command-selection problems per operator. Separate command tests at four nominal operating conditions also use the eight targets to assess performance before the operating inputs are shifted.

Training, estimator data, and evaluation

The initial operator M0M_0 uses the rank-16 representation and training settings in § 3 and Table 1. Updates after eight and 16 acquired paths give M1M_1 and M2M_2. Five training seeds are used for each acquisition strategy. Estimator-guided acquisition selects the same four command indices, (0, 20, 16, 18), at every adaptation condition, producing one distinct set of 16 paths. The five random-acquisition sequences produce five distinct path sets. Thus, estimator-guided acquisition is assessed through repeated training on one acquired dataset, while the random-acquisition comparison also varies the acquired data.

Separate error estimators are fitted for acquisition and final assessment. For each operator, the estimator used for final assessment is fitted using 146 development endpoints: 32 initial calibration endpoints, 30 earlier shifted endpoints, and 84 endpoints from complete 21-command evaluations at four earlier adaptation conditions. These data are divided into regression and quantile-calibration subsets of 73 endpoints each. The division is made by complete path or operating condition rather than by individual samples within those groups.

At condition AkA_k, the acquisition estimator uses only FE data available before the four new commands are selected. It cannot use the complete FE response set at that condition to choose which commands to acquire. Neither estimator fit uses the 30 final shifted endpoints, the 84 final command-test endpoints, or the 30 nominal test endpoints. The estimator procedure and the requirements for accepting an updated operator are fixed using development data before final testing.

Forward accuracy and estimator reliability are assessed on the nominal and shifted path tests and on the 21 candidate commands at each TkT_k. Command agreement and regret are evaluated over the eight targets at each condition. Results are calculated separately for each trained operator before taking a median across the five training seeds. The fixed operator and the five M1M_1 and five

M2M_2 variants for each of the two acquisition strategies give 21 operator variants, or 84 combinations of operator and operating condition over the four shifted test conditions.

For the field comparisons, each 30-path test set is ordered by increasing EQE_Q for the initial operator, and the 16th path is displayed. This is the upper of the two middle paths. The same shifted input is retained when comparing the initial and updated operators, with training seed 1 used for the illustrated update. The remaining results use all five seeds.

Results

Nominal forward accuracy

Within the nominal range in Eq. (42), the initial wishbone operator has median EQ=0.140E_Q = 0.140 on the 30 held-out test paths, with 29 predictions satisfying EQ≤1E_Q \le1. In the separate command tests at four nominal operating conditions described in § 5.1.2, it selects the FE-optimal command for all eight targets and has zero mean regret.

Figure 14 shows the 16th path after ordering the nominal test set by EQE_Q, following § 5.1.3. Its normalized QoI error is 0.145. The FE and predicted deformation fields are visually similar at the plotted scale, and their pointwise difference is much smaller than the displacement magnitude.

Figure 14. Wishbone FE solution and initial prediction for the 16th of 30 nominal test paths ordered by the initial operator’s EQE_Q. Panels (a) and (b) use a common displacement-magnitude scale; panel (c) shows the pointwise displacement error on a separate scale. Fields are shown on their deformed configurations at true scale over the reference mesh.

Shifted forward accuracy and adaptation

Under the reduced stiffness and increased tip forces in Eq. (43), median EQE_Q on the 30 held-out paths increases from 0.140 to 5.097, and only three predictions satisfy the tolerance. The separate command tests show increasing error along T1T_1 through T4T_4 in Table 4. The medians over the 21 candidate commands are 1.353, 2.299, 5.702, and 11.373, with 9, 3, 0, and 0 predictions satisfying EQ≤1E_Q \le1, respectively.

Figure 15 compares FE, initial-operator, and updated-operator responses at the 16th input after ordering the 30 shifted test paths by the initial error. The initial prediction gives EQ=5.51E_Q = 5.51, with visible differences in both deformation and displacement magnitude. For the same input, the estimator-guided M2M_2 operator from training seed 1 gives EQ=0.22E_Q = 0.22. This is one illustrative comparison rather than the aggregate error after adaptation.

Figure 15. Wishbone FE solution, initial prediction, and 16-path updated prediction for the same held-out shifted input. The input is the 16th of 30 paths ordered by the initial operator’s EQE_Q, and the illustrated update uses estimator-guided training seed 1. Panels (a), (b), and (e) share one displacement scale; panels (c) and (f) share one error scale. Deformations are shown at true scale. Results across all five seeds are reported in Table 5.

Table 5 separates the 30-path shifted test from the four command-test conditions. For each updated operator, the median is first calculated over the relevant paths or commands, followed by the median across the five training seeds. On the shifted path test, estimator-guided acquisition reduces this value from 5.097 to 3.439 after eight paths and to 1.132 after 16 paths. The corresponding 16-path value for random acquisition is 0.803. The second estimator-guided update does not improve every test condition: the median at T1T_1 increases from 0.785 to 1.024, while those at T2T_2, T3T_3, and T4T_4 decrease.

OperatorShifted pathsT1T_1T2T_2T3T_3T4T_4
M0M_05.0971.3532.2995.70211.373
M1M_1, estimator-guided3.4390.7851.1923.0307.532
M2M_2, estimator-guided1.1321.0240.7700.7751.131
M2M_2, random0.8030.9460.8190.8781.149

Table 5. Wishbone normalized QoI errors before and after adaptation. The shifted-path column uses the 30 test paths from Eq. (43); each TkT_k column uses the 21 candidate commands at that condition in Table 4. Entries for M0M_0 are medians over the corresponding inputs. Updated-operator entries are medians across five training seeds of those input-wise medians.

The updated operators retain accuracy on the separate nominal test. The five estimator-guided M2M_2 medians range from 0.134 to 0.206, with all 30 predictions satisfying the tolerance for every operator. The five random-acquisition M2M_2 medians range from 0.101 to 0.175; four operators satisfy the tolerance on all 30 paths and one on 29 paths. Random acquisition gives a smaller aggregate shifted error in this experiment, but the comparison uses one estimator-guided path set and five random path sets, as explained in § 5.1.3. It does not establish a general advantage of either acquisition strategy.

QoI-error estimation

The estimator associated with M0M_0 has no false acceptance on the nominal test paths, the shifted test paths, or the candidate commands at the four test conditions in Table 4. Its Spearman rank correlation with EQE_Q is 0.881 on the shifted paths and 0.730, 0.761, 0.816, and 0.748 at T1T_1 through T4T_4, respectively. It nevertheless accepts almost no surrogate prediction at the shifted command-test conditions, leaving command selection largely to the four FE evaluations.

After adaptation, the true error and fitted estimate both change. For estimator-guided M2M_2, no false acceptance occurs at T2T_2 or T3T_3 in any of the five training seeds. At T1T_1, every seed falsely accepts between one and three predictions. At T4T_4, only one seed accepts a surrogate prediction beyond the four FE-evaluated commands; one of its two accepted predictions is inaccurate. The relatively small distance between T1T_1 and an earlier estimator-development condition, noted in § 5.1.2, further limits its use as evidence of estimator reliability under unfamiliar conditions.

The estimator can also reject accurate predictions after adaptation. One updated operator has 30 accurate nominal test predictions, but its estimator accepts only 12. This shows that improved forward accuracy does not consistently lead to reliable prediction acceptance.

Command selection

The effect of estimator acceptance on the selected commands is assessed by comparing the hybrid and four-FE calculations defined in § 3. Both use the same four FE evaluations at a given test condition; the hybrid calculation additionally uses accepted surrogate predictions. For each trained operator and condition, agreement is the number of the eight targets for which the FE-optimal command is selected, and mean regret is calculated over the same eight targets. Table 6 reports the median of each quantity across the five estimator-guided M2M_2 training seeds.

ConditionAgreementMean regretSurrogate use
HybridFour FEHybridFour FE
T1T_1510.0451.0995/5; false acceptance
T2T_2310.5031.2134/5; no false acceptance
T3T_3320.3601.1743/5; no false acceptance
T4T_4221.0311.0311/5; one false acceptance

Table 6. Table 6: Wishbone command selection using estimator-guided M2M_2 operators at the conditions in Table 4. Agreement counts FE-optimal selections among eight targets. Regret is averaged over eight targets for each operator. Both statistics are then summarized by the median across five training seeds. The last column gives the number of seeds using additional accepted surrogate predictions and indicates whether false acceptance occurs.

At T2T_2, four of the five seeds accept at least one surrogate prediction beyond the FE-evaluated commands. The hybrid calculation increases median agreement from one to three targets and reduces the reported mean regret from 1.213 to 0.503. At T3T_3, three seeds use additional surrogate predictions; median agreement increases from two to three targets, and mean regret decreases from 1.174 to 0.360. Neither condition has a false acceptance in any of the five seeds. These intermediate shifts therefore show an improvement over selecting from the four FE-evaluated commands alone.

The largest reduction in reported mean regret occurs at T1T_1, but the false-acceptance counts are 2, 3, 1, 3, and 3 across the five seeds. The lower loss does not therefore establish reliable acceptance of the surrogate predictions. At the most severe test condition, T4T_4, the median hybrid result equals the four-FE result. Thus, inaccurate predictions can be accepted at the mildest shift, while insufficient surrogate acceptance limits the benefit at the most severe shift. Across all 84 combinations of operator and operating condition defined in § 5.1.3, every selected command is FE-admissible and every target has at least one available candidate.

Computational work

The final shifted evaluation uses 114 new FE paths: 30 for the forward test and 84 for the complete candidate command sets at the four test conditions. All satisfy the prescribed FE checks, and their recorded solution time is 652 s. For training seed 1, an estimator-guided M2M_2 update using stored paths takes 12.5 s. These measurements distinguish the time required for training an updated operator from that required to generate reference FE data. They do not establish an end-to-end speedup because the combined times for residual assembly, the linearized solve, QoI evaluation, and command selection were not measured under a common timing procedure.

Image not extracted

Figure 16. Wishbone forward accuracy and command selection after adaptation. (a) Median EQE_Q on the shifted path test and the four conditions in Table 4. For the updated operators, individual markers show training seeds and the lines give five-seed medians; the M0M_0 curve represents the single fixed operator. (b) Mean regret over eight targets for the estimator-guided M2M_2 hybrid and four-FE calculations; open circles show individual seeds, and bars give the median across seeds. Annotations report the number of seeds using additional surrogate predictions and total false acceptances.

Discussion

The two studies support the reuse of FE loading paths to adapt neural operators under the prescribed changes in stiffness and mechanical loading. Although the structures have different geometries, QoIs, and material parameters, adaptation improves forward accuracy while preserving accuracy in the nominal regime. The effects on error estimation and command selection are less consistent. Table 7 summarizes these distinctions.

AspectPlatformWishbone
Forward adaptationShifted median EQE_Q decreases from 1.147 to 0.144Shifted median EQE_Q decreases from 5.097 to 0.803
Error estimationInitial estimator rejects most shifted predictions but poorly distinguishes their errorsSome estimators falsely accept predictions after adaptation
Command selectionZero median regret at all four test conditions after adaptation; individual errors remainHybrid improves on the four-FE calculation at T2T_2 and T3T_3; equal median regret at T4T_4
Distinct acquired dataTwo estimator-guided and five random 16-path setsOne estimator-guided and five random 16-path sets

Table 7. Comparison of the principal findings. Updated forward errors correspond to 16 randomly acquired paths and are summarized by the median of the five per-operator median errors. The examples use different QoIs, tolerances, and shifted operating ranges.

The platform projection test identifies why adaptation within the fixed POD space is effective for the tested inputs. Under the S3 shift in Table 2, the reduced basis represents the substantially smaller QoI error than the initial neural operator. The dominant error therefore arises from the learned input-to-coefficient map rather than basis truncation. Updating this map improves predictions without modifying the reduced representation. This improvement is distinct from residual correction [9, 21]: the linearized residual solve in Eq. (31) supplies estimator information but does not modify the displacement used for command selection.

Forward accuracy, estimator reliability, and command quality must nevertheless be assessed separately. The initial platform estimator excludes most inaccurate predictions but also rejects nearly all accurate shifted predictions. For the wishbone, the adapted operators improve command selection at T2T_2 and T3T_3 (Table 4) without false acceptance in the tested cases. At T1T_1, however, lower regret is accompanied by false acceptance, while at T4T_4 the median hybrid regret equals that of the four-FE calculation. Thus, reduced command loss does not by itself establish reliable prediction acceptance, and improved forward accuracy does not ensure a benefit at every operating condition.

The acquisition comparison is limited by the number of distinct data sets in Table 7. Repeated training on the same acquired paths evaluates training variability, not additional acquisition outcomes. For the platform, the validation requirements also determine which candidate updates are used in subsequent decisions. The results therefore support adaptation using acquired FE paths but do not establish an advantage of estimator-guided acquisition over random sampling.

These conclusions apply to two-dimensional hMSM models with fixed rank-16 representations, prescribed input ranges, discrete command sets, and 30-path forward tests. The physical systems are simulated by FE with known inputs, so experimental uncertainty and sensor-based inference are outside the study. The demonstrated benefit is improved prediction and command quality under a fixed FE budget; reliable acceptance of the adapted predictions remains a separate requirement.

Conclusions

This work studied periodic adaptation of neural operators for command selection in two hard-magnetic soft-material structures under changing known operating conditions. The physical systems were simulated using high-fidelity FE models. Four selected FE evaluations per operating condition supplemented the surrogate predictions, while their complete loading paths were retained for updating the neural operator and its empirical QoI-error estimator.

Both initial operators lost substantial accuracy when stiffness and mechanical loading moved beyond their training ranges. Updates using 16 acquired FE paths recovered much of this accuracy while preserving accuracy in the nominal regime. The improved predictions also supported better command selection under the same FE budget, although the benefit depended on the operating condition. The acquisition comparisons did not establish an advantage of estimator-guided selection over random selection.

The empirical estimators remained unreliable at some operating conditions after adaptation, accepting inaccurate predictions or rejecting accurate ones. Improved forward accuracy therefore does not by itself establish which predictions are suitable for command selection. The study demonstrates that FE solutions generated during repeated mechanics calculations can improve subsequent predictions and decisions through data reuse. Reliable use of these adapted predictions additionally requires error assessment that remains effective as both the operating conditions and the learned approximation change.

Acknowledgments

PKJ acknowledges support from the National Science Foundation through the Engineering Research Initiation (ERI) program under award No. 2502279, and from the South Dakota Board of Regents Competitive Research Grant (SDBOR CRG) program. These awards supported IG’s and HA’s work on this project at different stages. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the funding agencies.

Data and code availability

The source and supporting data will be released with the accepted manuscript.

Declaration of competing interest

The authors declare no competing interests.

References

  1. [1]Adil Rasheed, Omer San, and Trond Kvamsdal. Digital twin: Values, challenges and enablers from a modeling perspective. IEEE Access, 8:21980–22012, 2020.DOI
  2. [2]Michael G. Kapteyn, Jacob V. R. Pretorius, and Karen E. Willcox. A probabilistic graphical model foundation for enabling predictive digital twins at scale. Nature Computational Science, 1:337–347, 2021.DOI
  3. [3]Matteo Torzoni, Marco Tezzele, Stefano Mariani, Andrea Manzoni, and Karen E. Willcox. A digital twin framework for civil engineering structures. Computer Methods in Applied Mechanics and Engineering, 418:116584, 2024.DOI
  4. [4]Lu Lu, Pengzhan Jin, Guofei Pang, Zhongqiang Zhang, and George Em Karniadakis. Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators. Nature Machine Intelligence, 3:218–229, 2021.
  5. [5]Zongyi Li, Nikola Kovachki, Kamyar Azizadehnesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differential equations. In International Conference on Learning Representations, 2021.
  6. [6]Kaushik Bhattacharya, Bamdad Hosseini, Nikola B. Kovachki, and Andrew M. Stuart. Model reduction and neural networks for parametric PDEs. SMAI Journal of Computational Mathematics, 7, 2021.arxiv.org/abs/2005.03180
  7. [7]Prashant K. Jha. From theory to application: A practical introduction to neural operators in scientific computing. Mathematics, 14(13):2421, 2026.DOI
  8. [8]Kazuma Kobayashi and Syed Bahauddin Alam. Deep neural operator-driven real-time inference to enable digital twin solutions for nuclear energy systems. Scientific Reports, 14:2101, 2024.DOI
  9. [9]Lianghao Cao, Thomas O’Leary-Roseberry, Prashant K. Jha, J. Tinsley Oden, and Omar Ghattas. Residual-based error correction for neural operator accelerated infinite-dimensional Bayesian inverse problems. Journal of Computational Physics, 486:112104, 2023.DOI
  10. [10]Prashant K. Jha and Koffi Enakoutsa. Neural operators with residual-based correction: Applications to optimization and Bayesian inference. Book chapter accepted for publication, 2026.
  11. [11]Samuel Lanthaler, Siddhartha Mishra, and George E. Karniadakis. Error estimates for Deep-ONets: A deep learning framework in infinite dimensions. Transactions of Mathematics and its Applications, 6(1):tnac001, 2022.arxiv.org/abs/2102.09618
  12. [12]Nikola Kovachki, Samuel Lanthaler, and Siddhartha Mishra. On universal approximation and error bounds for fourier neural operators. Journal of Machine Learning Research, 22(290):1–76, 2021.arxiv.org/abs/2107.07562
  13. [13]Makoto Takamoto, Timothy Praditia, Raphael Leiteritz, Daniel MacKinlay, Francesco Alesiani, Dirk Pflüger, and Mathias Niepert. PDEBench: An extensive benchmark for scientific machine learning. In Advances in Neural Information Processing Systems, volume 35, pages 1596–1611, 2022.arxiv.org/abs/2210.07182
  14. [14]Jayesh K. Gupta and Johannes Brandstetter. Towards multi-spatiotemporal-scale generalized PDE modeling. Transactions on Machine Learning Research, 2023.arxiv.org/abs/2209.15616
  15. [15]Jose Antonio Lara Benitez, Takashi Furuya, Florian Faucher, Anastasis Kratios, Xavier Tricoche, and Maarten V. de Hoop. Out-of-distribution risk bounds for neural operators with applications to the Helmholtz equation. Journal of Computational Physics, 513:113168, 2024.
  16. [16]Serge Prudhomme and J Tinsley Oden. On goal-oriented error estimation for elliptic problems: application to the control of pointwise errors. Computer Methods in Applied Mechanics and Engineering, 176(1-4):313–331, 1999.DOI
  17. [17]John Tinsley Oden and Serge Prudhomme. Goal-oriented error estimation and adaptivity for the finite element method. Computers & mathematics with applications, 41(5-6):735–756, 2001.DOI
  18. [18]J Tinsley Oden and Serge Prudhomme. Estimation of modeling error in computational mechanics. Journal of Computational Physics, 182(2):496–515, 2002.DOI
  19. [19]Roland Becker and Rolf Rannacher. An optimal control approach to a posteriori error estimation in finite element methods. Acta Numerica, 10:1–102, 2001.
  20. [20]Prashant K. Jha and J. Tinsley Oden. Goal-oriented a-posteriori estimation of model error as an aid to parameter estimation. Journal of Computational Physics, 470:111575, 2022.DOI
  21. [21]Prashant K. Jha. Residual-based error corrector operator to enhance accuracy and reliability of neural operator surrogates of nonlinear variational boundary-value problems. Computer Methods in Applied Mechanics and Engineering, 419:116595, 2024.DOI
  22. [22]Vladimir Fanaskov, Alexander Rudikov, and Ivan Oseledets. Neural functional a posteriori error estimates. arXiv preprint arXiv:2402.05585, 2024.arxiv.org/abs/2402.05585
  23. [23]Yuan Qiu, Wolfgang Dahmen, and Peng Chen. Variationally correct operator learning: Reduced basis neural operator with a posteriori error estimation, 2025. arXiv preprint arXiv:2512.21319.arxiv.org/abs/2512.21319
  24. [24]Ziqi Ma, David Pitt, Kamyar Azizadehnesheli, and Anima Anandkumar. Calibrated uncertainty quantification for operator learning via conformal prediction. Transactions on Machine Learning Research, 2024.arxiv.org/abs/2402.01960
  25. [25]Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ramdas, and Ryan J. Tibshirani. The limits of distribution-free conditional predictive inference. Information and Inference: A Journal of the IMA, 10(2):455–482, 2021.arxiv.org/abs/1903.04684
  26. [26]Zhiwei Gao, Liang Yan, and Tao Zhou. Adaptive operator learning for infinite-dimensional Bayesian inverse problems. SIAM/ASA Journal on Uncertainty Quantification, 12(4):1389–1423, 2024.arxiv.org/abs/2310.17844
  27. [27]Bernard Haasdonk, Hendrik Kleikamp, Mario Ohlberger, Felix Schindler, and Tizian Wenzel. A new certified hierarchical and adaptive RB-ML-ROM surrogate model for parametrized PDEs. SIAM Journal on Scientific Computing, 45(3):A1039–A1065, 2023.
  28. [28]Lu Lu, Raphaël Pestourie, Steven G. Johnson, and Giuseppe Romano. Multifidelity deep neural operators for efficient learning of partial differential equations with application to fast inverse design of nanoscale heat transport. Physical Review Research, 4(2):023210, 2022.arxiv.org/abs/2204.06684
  29. [29]Amanda A. Howard, Mauro Perego, George Em Karniadakis, and Panos Stinis. Multifidelity deep operator networks for data-driven and physics-informed problems. Journal of Computational Physics, 493:112462, 2023.DOI
  30. [30]Ruike Zhao, Yoonho Kim, Shawn A. Chester, Pradeep Sharma, and Xuanhe Zhao. Mechanics of hard-magnetic soft materials. Journal of the Mechanics and Physics of Solids, 124:244–263, 2019.
  31. [31]Yoonho Kim and Xuanhe Zhao. Magnetic soft materials and robots. Chemical Reviews, 122(5):5317–5364, 2022.DOI
  32. [32]Yoonho Kim, Hyunwoo Yuk, Ruike Zhao, Shawn A. Chester, and Xuanhe Zhao. Printing ferromagnetic domains for untethered fast-transforming soft materials. Nature, 558:274–279, 2018.DOI
  33. [33]Zhi Zhao and Xiaojia Shelly Zhang. Topology optimization of hard-magnetic soft materials. Journal of the Mechanics and Physics of Solids, 158:104628, 2022.DOI
  34. [34]Ian Galloway and Prashant K. Jha. Model-informed joint material–structural optimization of hard-magnetic soft materials. Preprint, arXiv:2607.14397; under review, 2026.arxiv.org/abs/2607.14397
  35. [35]Ian Galloway and Prashant K. Jha. MatTO: A modular framework for material and topology optimization of stimulus-responsive soft materials. Under review, 2026.
  36. [36]Alp C. Karacakol, Yunus Alapan, Sinan O. Demir, and Metin Sitti. Data-driven design of shape-programmable magnetic soft materials. Nature Communications, 16:2946, 2025.DOI
  37. [37]Igor A. Baratta, Joseph P. Dean, Jørgen S. Dokken, Michal Habera, Jack S. Hale, Chris N. Richardson, Marie E. Rognes, Matthew W. Scroggs, Nathan Sime, and Garth N. Wells. DOLFINx: The next generation FEniCS problem solving environment. Preprint, 2023.

Paper details

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

views · 0

downloads · 0

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

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents