Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Generalization error”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Geometric Interpretation of the Cluster Location Problem Part I: Theory

We present a new framing of the seismic location problem using principles drawn from differential geometry. Our interpretation relies upon the common assumption that travel times observed across a network are continuous, differentiable functions of source location. In consequence, travel‐time functions constitute a differentiable map between the source region and a Riemannian manifold. The manifold is said to be the image of the source region embedded in a generally high‐dimension travel‐time vector space. A cluster of events in the source region has an image of discrete points on the manifold, that, except in the simplest cases, cannot be viewed directly. However, it is possible to project the image of a cluster into a tangent space of the manifold for direct visualization. The projection operator can be computed directly from the data without a velocity model, but produces a distorted rendering of the cluster geometry. With a model we can predict the distortions and correct them to estimate cluster geometry. We develop these points with the simplest possible example, one for which direct visualization of the manifold is possible, using the example as an introduction to the relevant concepts from differential geometry in a familiar setting. The tangent space, a local linearization of the manifold, plays a key role. We develop a metric to estimate the limits of linearization, that is, to determine when the curvature of the manifold invalidates the linear assumption. We also examine the interplay of model error, inadequate network geometry, and pick error. We then generalize our results from the simple case to the general case of 3D source regions observed by general networks. Although we do suggest a new “project and correct” method for location, we do not develop it into a practical algorithm. In conclusion, our intention rather is to highlight new analytical methods grounded in differential geometry.

East Pacific Ocean Islands↗
DOE OSTI2024

Mitigative Strategies for Recovering From Large Language Model Trust Violations

In this study, we investigated strategies to address trust issues arising from errors in large language models (LLMs). The study examined the impact of confidence scores, system capability explanations, and user feedback on trust restoration post-error. 68 participants viewed the responses of an LLM to 20 general trivia questions, with an error introduced on the third trial. Each participant was presented with one mitigation strategy. Participants rated their overall trust in the model and the reliability of the answer. Results showed an immediate drop in trust after the error; however, there were no differences across the three strategies in trust recovery. All conditions had a logarithmic trend in trust recovery following error. Differences in overall trust were predicted by perceived reliability of the answer, suggesting that participants were evaluating results critically and using that to inform their trust in the model. Qualitative data supported this finding; participants expressed lasting distrust despite the LLM’s later accuracy. Results showcase the need to prioritize accuracy in LLM deployment, because early errors may irrevocably damage user trust calibration and later adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Extended Galerkin Neural Network Approximation of Singular Variational Problems with Error Control

We present extended Galerkin neural networks, a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory guiding the construction of new weighted least squares variational formulations suitable for use in neural network approximation of general BVPs, and (2) an “extended” feedforward network architecture which incorporates and is even capable of learning singular solution structures, thus greatly improving approximability of singular solutions. Furthermore, numerical results are presented for several problems, including steady Stokes flow around reentrant corners and in convex corners with Moffatt eddies in order to demonstrate efficacy of the method.

a posteriori error estimate↗
DOE OSTI2026

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗
DOE OSTI2025

More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing

Quantum sensing is one of the most promising applications for quantum technologies. However, reaching the ultimate sensitivities enabled by the laws of quantum mechanics can be a challenging task in realistic scenarios where noise is present. While several strategies have been proposed to deal with the detrimental effects of noise, these come at the cost of an extra shot budget. Given that shots are a precious resource for sensing – as infinite measurements could lead to infinite precision – care must be taken to truly guarantee that any shot not being used for sensing is actually leading to some metrological improvement. In this work, we study whether investing shots in error-mitigation, inference techniques, or combinations thereof, can improve the sensitivity of a noisy quantum sensor on a (shot) budget. We present a detailed bias–variance error analysis for various sensing protocols. Our results show that the costs of zero-noise extrapolation techniques outweigh their benefits. We also find that pre-characterizing a quantum sensor via inference techniques leads to the best performance, under the assumption that the sensor is sufficiently stable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Uniformly decaying subspaces for error-mitigated quantum computation

Here, we present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Systematic improvement of x -dependent unpolarized nucleon generalized parton distributions in lattice-QCD calculation

We present a first study of the effects of renormalization-group resummation (RGR) and leading-renormalon resummation (LRR) on the systematic errors of the unpolarized isovector nucleon generalized parton distribution in the framework of large-momentum effective theory. This work is done using lattice gauge ensembles generated by the MILC Collaboration, consisting of 2 + 1 + 1 flavors of highly improved staggered quarks with a physical pion mass at lattice spacing a ≈ 0.09 fm and a box width L ≈ 5.76 fm . We present results for the nucleon H and E generalized parton distributions (GPDs) with average boost momentum P z ≈ 2 GeV at momentum transfers Q 2 = [ 0 , 0.97 ] GeV 2 at skewness ξ = 0 as well as Q 2 ∈ 0.23 GeV 2 at ξ = 0.1 , renormalized in the modified minimal subtraction ( MS ¯ ) scheme at scale μ = 2.0 GeV , with two- and one-loop matching, respectively. We demonstrate that the simultaneous application of RGR and LRR significantly reduces the systematic errors in renormalized matrix elements and distributions for both the zero and nonzero skewness GPDs, and that it is necessary to include both RGR and LRR at higher orders in the matching and renormalization processes. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2025

Verification of the REBUS Software

Ongoing design activities at Argonne National Laboratory are requiring a thorough verification of the Argonne Reactor Computation codes be performed. REBUS is central to this system. The driver for this effort requires the Triangular-Z and hexagonal-Z core geometry options of REBUS to be verified. Previous work identified the REBUS features required to be verified to support current design activities, features of which are generally applicable to hexagonal-Z fast reactor designs. The scope of this verification effort includes verifying REBUS’s ability to correctly intepret the user input model, verifying that the features identified yield the intended results, and verifying the correctness of the REBUS output tables. The REBUS software verification relies heavily upon the accuracy of the embedded DIF3D software, the verification of which was completed and documented elsewhere. Given that DIF3D produces an accurate solution, the primary focus of the verification in the REBUS software is to ensure that it properly uses the DIF3D solution and that the depletion system (Bateman equations) are correctly implemented. This manuscript reiterates the verification tasks and displays results with respect to the features needed for current design activities. Analytic solutions of the Batemen equations are displayed and the results calculated with REBUS are displayed demonstrating the accuracy. Since coupled Bateman and neutron diffusion/transport solutions are extremely difficult to obtain, much of the focus is placed on how REBUS uses a given DIF3D solution assuming the accuracy of the DIF3D solution. The verification effort identified no issues that are debilitating or otherwise impactful to the design usage of REBUS, and thus REBUS version 11.0, release 3012 is considered verified. It is important to note that several outputs of REBUS are identified to be inaccurate, such as burnup in MWD/MT. Most of the relevant ones for VTR are generally accurate with 10-20% errors which is not impactful as all regular REBUS users are aware of this issue and know how to hand calculate the results. The REBUS manual further makes it clear that these values are consistent with the methodology being used by REBUS and thus the “errors” are more of an inconsistent definition with respect to what a user would expect given a definition in literature. Other issues that were identified included unclear documentation and software bugs all of which were inconsequential to the final results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Isochronous and period-doubling diagrams for symplectic maps of the plane

Symplectic mappings of the plane serve as key models for exploring the fundamental nature of complex behavior in nonlinear systems. Central to this exploration is the effective visualization of stability regimes, which enables the interpretation of how systems evolve under varying conditions. While the area-preserving quadratic Hénon map has received significant theoretical attention, a comprehensive description of its mixed parameter-space dynamics remain lacking. This limitation arises from early attempts to reduce the full two-dimensional phase space to a one-dimensional projection, a simplification that resulted in the loss of important dynamical features. Consequently, there is a clear need for a more thorough understanding of the underlying qualitative aspects. This paper aims to address this gap by revisiting the foundational concepts of reversibility and associated symmetries, first explored in the early works of G.D. Birkhoff. We extend the original framework proposed by Hénon by adding a period-doubling diagram to his isochronous diagram, which allows to represents the system’s bifurcations and the groups of symmetric periodic orbits that emerge in typical bifurcations of the fixed point. A qualitative and quantitative explanation of the main features of the region of parameters with bounded motion is provided, along with the application of this technique to other symplectic mappings, including cases of multiple reversibility. Modern chaos indicators, such as the Reversibility Error Method (REM) and the Generalized Alignment Index (GALI), are employed to distinguish between various dynamical regimes in the mixed space of variables and parameters. These tools prove effective in differentiating regular and chaotic dynamics, as well as in identifying twistless orbits and their associated bifurcations. Additionally, we discuss the application of these methods to real-world problems, such as visualizing dynamic aperture in accelerator physics, where our findings have direct relevance.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Holographic codes and bulk RG flows

We consider the coarse-graining of holographic quantum error correcting codes under a generalized notion of bulk renormalization-group flow. In particular, we study the renormalization under this flow of the $A/4G$ term in the Faulkner-Lewkowycz-Maldacena formula and in its Rényi generalization. This provides a general quantum code perspective on the arguments of Susskind and Uglum. Specifically, given a 'UV' code with two-sided recovery and appropriately flat entanglement spectrum together with a set of 'seed' states in the UV code, we explicitly construct an 'IR' code with corresponding properties which contains the given seed states and is of minimal size in a sense we describe.

FOS: Physical sciences↗
DOE OSTI2025

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗
DOE OSTI2024

One-to-one aeroservoelastic validation of operational loads and performance of a 2.8 MW wind turbine model in OpenFAST

Abstract. This article presents a validation study of the popular aeroservoelastic code suite OpenFAST leveraging weeks of measurements obtained during normal operation of a 2.8 MW land-based wind turbine. Measured wind conditions were used to generate one-to-one turbulent flow fields (i.e., comparing simulation to measurement in 10 min increments, or bins) through unconstrained and constrained assimilation methods using the kinematic turbulence generators TurbSim and PyConTurb. A total of 253 bins of 10 min of normal turbine operation were selected for analysis, and a statistical comparison in terms of performance and loads is presented. We show that successful validation of the model was not strongly dependent on the type of inflow assimilation method used for mean quantities of interest, which had median modeling errors per wind-speed interval generally within 5 %–10 % of the measurement. The type of inflow assimilation method did have a larger effect on the fatigue predictions for blade-root flapwise and tower-base fore–aft quantities, which surprisingly saw larger errors from the assumed higher-fidelity assimilation methods. Avenues for further work are discussed and include possible improvements to the aerodynamic, structural, and controller modeling that may offer insight on the origin of the up to ∼ 40 % median overprediction of fatigue for these quantities.

17 WIND ENERGY↗
DOE OSTI2026

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Structure Sensitive Reaction Kinetics of Chiral Molecules on Intrinsically Chiral Surfaces

Enantiospecific heterogeneous catalysis utilizes chiral surfaces to resolve enantiomers via structure sensitive surface chemistry. The catalyst design challenge is the identification of chiral surface structures that maximize enantiospecificity. Herein, we develop data driven models for the enantiospecificity of tartaric acid reactions on chiral Cu(hkl) R&S surfaces. Measurements of enantiospecific rate constants were obtained by using curved Cu(hkl) R&S surfaces that enable kinetic measurements on hundreds of chiral surface orientations. One model uses feature vectors derived from generalized coordination numbers to capture the local structure around Cu atoms exposed by the Cu(hkl) R&S surfaces. The second model introduces the use of chiral cubic harmonic functions to capture the symmetry constraints of the face-centered cubic Cu structure. The model using 58 generalized coordination numbers has a fitting error similar to that of the model using only 5 cubic harmonic functions. The two models predict maxima in the enantiospecificity on surfaces with very similar surface orientations. The models developed in this work are applicable for any enantiospecific reaction happening on any chiral material with a cubic lattice structure, opening the way to understanding the surface structure sensitivity of the enantiospecific reaction kinetics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Improved loss functions for machine-learned atomic potentials

Machine learning (ML) has become an invaluable tool across a wide array of domains in science as researchers find new ways to leverage its predictive power. This is especially true in chemistry, where ML is used to fit chemical properties or desirable attributes to the local structure of molecules and materials. In the pursuit of greater accuracy, it is relatively simple to increase the size or complexity of such models, although this often requires simultaneously seeking larger datasets in order to both fit and interpret the larger number of parameters. However, it is equally important to assess the quality and relative importance of the data and how these factors impact the training process. We, therefore, investigate the impact of using different loss functions for training neural network potentials (NNPs), as the loss function defines the error and parameter gradients used to train the NNP. In particular, we test the mean-squared error and Huber loss functions and, using insight from these functions, derive a new loss function based on the Asinh function, which yields significant improvement in the accuracy and generality of NNPs. We show that by discounting/minimizing errors and anomalies in the optimization process, both the Huber and Asinh loss functions improve the training of NNPs, leading to a final potential with a greater effective dimensionality.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Robust Design Under Uncertainty in Quantum Error Mitigation

Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical postprocessing of quantum computation outcomes is a popular approach for error mitigation, which includes methods, such as zero noise extrapolation, virtual distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number of a quantum measurement. In this work, we introduce general and unbiased methods for quantifying the uncertainty and error of error-mitigated observables based on the strategic sampling of error mitigation outcomes. We then extend our approach to demonstrate the optimization of performance and robustness of error mitigation under uncertainty. To illustrate our methods, we apply them to zero noise extrapolation and Clifford date regression in the ground state of the XY model simulated using depolarizing and International Business Machines Corporation (IBM) Toronto noise models, respectively. In particular, we optimize the choice of noise levels and the allocation of shots for zero noise extrapolation and the distribution of the training circuits for Clifford data regression. While our methods are readily applicable to any postprocessing-based error mitigation approach, in practice they must not be prohibitively expensive—even though they perform optimizations of the error mitigation hyperparameters requiring sampling of a statistical distribution of error mitigation outcomes. By leveraging surrogate-based optimization, we show that our methods can efficiently perform optimal design for a zero noise extrapolation implementation. We then further demonstrate the transferability of learned zero noise extrapolation hyperparameters to other similar circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Out-of-Distribution Generalization for Learning Quantum Channels with Low-Energy Coherent States

When experimentally learning the action of a continuous-variable quantum process by probing it with inputs, there will often be some restriction on the input states used. One experimentally simple way to probe a quantum channel is to use low-energy coherent states. Learning a quantum channel in this way presents difficulties, due to the fact that two channels may act similarly on low-energy inputs but very differently for high-energy inputs. They may also act similarly on coherent-state inputs but differently on nonclassical inputs. Extrapolating the behavior of a channel for more general input states from its action on the far more limited set of low-energy coherent states is a case of out-of-distribution generalization. To be sure that such generalization gives meaningful results, one needs to relate error bounds for the training set to bounds that are valid for all inputs. We show that for any pair of channels that act sufficiently similarly on low-energy coherent-state inputs, one can bound how different the input-output relations are for any (high-energy or highly nonclassical) input. This proves that out-of-distribution generalization is always possible for learning quantum channels using low-energy coherent states, as long as enough samples are used.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗