Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generalization Bounds”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

INTERDUNE DEPOSITS AND STRATIGRAPHIC FRAMEWORK OF THE NAVAJO SANDSTONE IN THE LAKE POWELL AREA, UTAH, USA

The Western Interior of the USA was dominated by desert environments for much of the Jurassic. Of these desert environments, the most extensive by far was the Navajo Sandstone erg, which, in conjunction with its correlative Nugget and Aztec Sandstones, is thought to have covered well over 500,000 km2, and is one of the largest ergs preserved in the rock record. The Navajo Sandstone is also one of a few geologic units which show promise as a potential CO2 sequestration reservoir in Utah. It outcrops along the eastern and southern margin of the state, and subcrops throughout most of the central area. The Navajo Sandstone consists of stacked eolian deposits, composed of well sorted, clean sandstone, deposited in commonly tabular, high angle cross bedded paleodunes, which are on average 15 m thick. Interspersed between these paleodunes are interdune deposits. Interdune deposits consist of sandy to calcareous, predominantly planar bedded, lensoid units, ranging from <1 m up to 7 m thick. In some cases, these interdune deposits occur along more extensive stratigraphic bounding surfaces. Dating within the Navajo Sandstone has historically been very difficult, as a result of its predominantly clean, aeolian sandstone composition. In addition, complexity of internal stratigraphic surfaces coupled with a low structural dip and generally flat topography has resulted in a poor understanding of the internal stratigraphy of the Navajo Sandstone. Exceptional three-dimensional exposures of the Navajo Sandstone in the upper portions of Lake Powell permit us to relate interdune carbonates to a hierarchical bounding surfaces model. Here we use this combined approach to interpret the internal stratigraphy of the Navajo Sandstone in this region. This work forms part of a larger study of the Navajo Sandstone across Utah and its potential as a CO2 reservoir, by developing a more comprehensive stratigraphic framework, and increasing understanding of stratigraphic complexity within one of the most significant eolian systems in the world.

Mahon, Elizabeth↗
DOE OSTI2020

The distribution-based remapping of the nodal mass and momentum between arbitrary meshes for staggered arbitrary Lagrangian-Eulerian hydrodynamics

We present a new distribution-based remapping of the nodal mass and momentum between arbitrary source (Lagrangian) and arbitrary target (rezoned) meshes for indirect staggered arbitrary Lagrangian-Eulerian hydrodynamics. Here, the method is based on the following ideas: define cell-centered momentum and mass on the source mesh; conservatively remap those cell-centered quantities from source to target meshes; and use local constrained optimization for each cell of the target mesh to conservatively distribute cell mass and momentum to the nodes of the cell. This new method is efficient, conservative, accurate and bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
DOE OSTI2023

Revealing protonation states and tracking substrate in serine hydroxymethyltransferase with room-temperature X-ray and neutron crystallography

Pyridoxal 5’-phosphate (PLP)-dependent enzymes utilize a vitamin B 6 -derived cofactor to perform a myriad of chemical transformations on amino acids and other small molecules. Some PLP-dependent enzymes, such as serine hydroxymethyltransferase (SHMT), are promising drug targets for the design of small-molecule antimicrobials and anticancer therapeutics, while others have been used to synthesize pharmaceutical building blocks. Understanding PLP-dependent catalysis and the reaction specificity is crucial to advance structure-assisted drug design and enzyme engineering. Here we report the direct determination of the protonation states in the active site of Thermus thermophilus SHMT (TthSHMT) in the internal aldimine state using room-temperature joint X-ray/neutron crystallography. Conserved active site architecture of the model enzyme TthSHMT and of human mitochondrial SHMT (hSHMT2) were compared by obtaining a room-temperature X-ray structure of hSHMT2, suggesting identical protonation states in the human enzyme. The amino acid substrate serine pathway through the TthSHMT active site cavity was tracked, revealing the peripheral and cationic binding sites that correspond to the pre-Michaelis and pseudo-Michaelis complexes, respectively. At the peripheral binding site, the substrate is bound in the zwitterionic form. By analyzing the observed protonation states, Glu53, but not His residues, is proposed as the general base catalyst, orchestrating the retro-aldol transformation of L-serine into glycine.

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

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Apparent fine tunings for field theories with broken space-time symmetries

We exhibit a class of effective field theories that have hierarchically small Wilson coefficients for operators that are not protected by symmetries but are not finely tuned. These theories possess bounded target spaces and vacua that break space-time symmetries. We give a physical interpretation of these theories as generalized solids with open boundary conditions. We show that these theories realize unusual RG flows where higher dimensional (seemingly irrelevant) operators become relevant even at weak coupling. Finally, we present an example of a field theory whose vacuum energy relaxes to a hierarchically small value compared to the UV cut-off.

Physics↗
DOE OSTI2025

Feature learning and generalization in deep networks with orthogonal weights

Fully-connected deep neural networks with weights initialized from independent Gaussian distributions can be tuned to criticality, which prevents the exponential growth or decay of signals propagating through the network. However, such networks still exhibit fluctuations that grow linearly with the depth of the network, which may impair the training of networks with width comparable to depth. We show analytically that rectangular networks with tanh activations and weights initialized from the ensemble of orthogonal matrices have corresponding preactivation fluctuations which are independent of depth, to leading order in inverse width. Moreover, we demonstrate numerically that, at initialization, all correlators involving the neural tangent kernel (NTK) and its descendants at leading order in inverse width—which govern the evolution of observables during training—saturate at a depth of ~20, rather than growing without bound as in the case of Gaussian initializations. We speculate that this structure preserves finite-width feature learning while reducing overall noise, thus improving both generalization and training speed in deep networks with depth comparable to width. We provide some experimental justification by relating empirical measurements of the NTK to the superior performance of deep non-linear orthogonal networks trained under full-batch gradient descent on the MNIST and CIFAR-10 classification tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Diagnostics of Mixed-State Topological Order and Breakdown of Quantum Memory

Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the two-dimensional (2D) Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Reduced Order Modeling conditioned on monitored features for response and error bounds estimation in engineered systems

Reduced Order Models (ROMs) form essential tools across engineering domains by virtue of their function as surrogates for computationally intensive digital twinning simulators. Although purely data-driven methods are available for ROM construction, schemes that allow to retain a portion of the physics tend to enhance the interpretability and generalization of ROMs. However, physics-based techniques can adversely scale when dealing with nonlinear systems that feature parametric dependencies. This study introduces a generative physics-based ROM that is suited for nonlinear systems with parametric dependencies and is additionally able to provide numerical error bounds associated with the respective estimates. A main contribution of this work is the conditioning of these parametric ROMs to features that can be derived from monitoring measurements, feasibly in an online fashion. This is contrary to most existing ROM schemes, which remain restricted to the prescription of the physics-based, and usually a priori unknown, system parameters. Our work utilizes conditional Variational Autoencoders to continuously map the required reduction bases to a feature vector extracted from limited output measurements, while additionally allowing for a probabilistic assessment of the ROM-estimated Quantities of Interest. An auxiliary task using a neural network-based parametrization of suitable probability distributions is introduced to re-establish the link with physical model parameters. We verify the proposed scheme on a series of simulated case studies incorporating effects of geometric and material nonlinearity under parametric dependencies related to system properties and input load characteristics.

Conditional VAEs↗
DOE OSTI2023

Quantum error correction from complexity in Brownian SYK

We study the robustness of quantum error correction in a one-parameter ensemble of codes generated by the Brownian SYK model, where the parameter quantifies the encoding complexity. The robustness of error correction by a quantum code is upper bounded by the “mutual purity” of a certain entangled state between the code subspace and environment in the isometric extension of the error channel, where the mutual purity of a density matrix ρAB is the difference $\mathcal{F}$ p ($A : B$) ≡ $\mathrm{T}$r $p^{2}_{AB}$ - $\mathrm{T}$r $p^{2}_{A}$ $\mathrm{T}$r $p^{2}_{B}$. We show that when the encoding complexity is small, the mutual purity is O(1) for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming O(1/N) for O(log N) encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of O(e -N ). We also find a hierarchy of complexity scales associated to a tower of subleading contributions to the mutual purity that quantitatively, but not qualitatively, adjust our error correction bound as encoding complexity increases. In the AdS/CFT context, our results suggest that any portion of the entanglement wedge of a general boundary subregion A with sufficiently high encoding complexity is robustly protected against low-rank errors acting on A with no prior access to the encoding map. From the bulk point of view, we expect such bulk degrees of freedom to be causally inaccessible from the region A despite being encoded in it.

1/N expansion↗
DOE OSTI2024

Photovoltaic Inverter Failure Mechanism Estimation Using Unsupervised Machine Learning and Reliability Assessment

This article introduces a data-driven approach to assessing failure mechanisms and reliability degradation in outdoor photovoltaic (PV) string inverters. The manufacturer's stated PV inverter lifetime can vary due to the impact of operating site conditions. To address limitations in degradation estimation through accelerated testing, condition monitoring, or degradation modeling, we propose a machine learning (ML) oriented approach. Utilizing data from a 1.4 MW PV power plant operational since 2016, with 46 string PV inverters tied to the grid, we employ the unsupervised one-class support vector machine ML technique to analyze inverter and sensor data, capable of classifying humidity cycling and temperature fluctuations as dominant failure mechanisms. Utilizing the anomaly alert relationship and alert details specific to the inverter, the level of PV inverter output is considered as its availability or available reliability. Subsequently, a continuous Markov model is applied to six-month alert data, revealing an average stated reliability of 20% after 20 years of continuous operation. These results support recommendations for time-bound preventive measures to enhance PV inverter reliability under diverse outdoor conditions. Furthermore, the approach provides a nondestructive, top–down, and generalized method for analyzing any commercial PV inverter exposed to outdoor conditions, contingent on the availability of relevant data.

14 SOLAR ENERGY↗
DOE OSTI2026

Emergent pair density wave order across a Lifshitz transition

We numerically investigate the telltale signs of pair-density-wave order (PDW) in the Kondo-Heisenberg chain by focusing on the momentum resolved spectrum in different parameter regimes. Density matrix renormalization group calculations reveal that this phase is characterized by a dispersion with two minima and four Fermi points, indicating the emergence of an effective next-nearest-neighbor hopping that arises as a second-order effect to avoid magnetic frustration. The pairs appear in the spectrum as in-gap bound states with weight concentrated in the hole pockets. The low-energy physics can be understood by means of a generalized t−J model with next-nearest-neighbor hopping. Our results offer a guide for searching for experimental signatures, and for other models that can realize PDW physics.

Yang, Luhang [University of Tennessee Knoxville]↗
DOE OSTI2020

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Interplay Between Time and Energy in Bosonic Noisy Quantum Metrology

Quantum entanglement and coherence often allow for protocols that outperform classical ones in estimating a system’s parameter. When using infinite-dimensional probes (such as a bosonic mode), one could, in principle, obtain infinite precision in a finite time for both classical and quantum protocols, which makes it hard to quantify potential quantum advantage. However, such a situation is unphysical, as it would require infinite resources, so one needs to impose some additional constraint: typically the average energy employed by the probe is finite. Here we treat both energy and time as a resource, showing that, in the presence of noise, there is a nontrivial interplay between the average energy and the time devoted to the estimation. Our results are valid for the most general metrological schemes (e.g., adaptive schemes, which may involve entanglement with external ancillae or any kind of continuous measurement). We apply recently derived precision bounds for all parameters characterizing the paradigmatic case of a bosonic mode, subject to Lindbladian noise. We show how the time employed in the estimation should be partitioned in order to achieve the best possible precision. In most cases, the optimal performance may be obtained without the necessity of adaptivity or entanglement with ancilla. We compare results with classical strategies. Interestingly, for temperature estimation, applying a fast-prepare-and-measure protocol with Fock states provides better scaling with the number of photons than any classical strategy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Light-Front Field Theory on Current Quantum Computers

We present a quantum algorithm for simulation of quantum field theory in the light-front formulation and demonstrate how existing quantum devices can be used to study the structure of bound states in relativistic nuclear physics. Specifically, we apply the Variational Quantum Eigensolver algorithm to find the ground state of the light-front Hamiltonian obtained within the Basis Light-Front Quantization (BLFQ) framework. The BLFQ formulation of quantum field theory allows one to readily import techniques developed for digital quantum simulation of quantum chemistry. This provides a method that can be scaled up to simulation of full, relativistic quantum field theories in the quantum advantage regime. As an illustration, we calculate the mass, mass radius, decay constant, electromagnetic form factor, and charge radius of the pion on the IBM Vigo chip. This is the first time that the light-front approach to quantum field theory has been used to enable simulation of a real physical system on a quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Region-adaptive, Error-controlled Scientific Data Compression using Multilevel Decomposition

The increase of computer processing speed is significantly outpacing improvements in network and storage bandwidth, leading to the big data challenge in modern science, where scientific applications can quickly generate much more data than that can be transferred and stored. As a result, big scientific data must be reduced by a few orders of magnitude while the accuracy of the reduced data needs to be guaranteed for further scientific explorations. Moreover, scientists are often interested in some specific spatial/temporal regions in their data, where higher accuracy is required. The locations of the regions requiring high accuracy can sometimes be prescribed based on application knowledge, while other times they must be estimated based on general spatial/temporal variation. In this paper, we develop a novel multilevel approach which allows users to impose region-wise compression error bounds. Our method utilizes the byproduct of a multilevel compressor to detect regions where details are rich and we provide the theoretical underpinning for region-wise error control. With spatially varying precision preservation, our approach can achieve significantly higher compression ratios than single-error bounded compression approaches and control errors in the regions of interest.We conduct the evaluations on two climate use cases – one targeting small-scale, node features and the other focusing on long, areal features. For both use cases, the locations of the features were unknown ahead of the compression. By selecting approximately 16% of the data based on multi-scale spatial variations and compressing those regions with smaller error tolerances than the rest, our approach improves the accuracy of post-analysis by approximately 2 × compared to single-error-bounded compression at the same compression ratio. Using the same error bound for the region of interest, our approach can achieve an increase of more than 50% in overall compression ratio.

Gong, Qian↗
DOE OSTI2020

Bootstrap bounds on closed Einstein manifolds

A compact Riemannian manifold is associated with geometric data given by the eigenvalues of various Laplacian operators on the manifold and the triple overlap integrals of the corresponding eigenmodes. This geometric data must satisfy certain consistency conditions that follow from associativity and the completeness of eigenmodes. We show that it is possible to obtain nontrivial bounds on the geometric data of closed Einstein manifolds by using semidefinite programming to study these consistency conditions, in analogy to the conformal bootstrap bounds on conformal field theories. These bootstrap bounds translate to constraints on the tree-level masses and cubic couplings of Kaluza-Klein modes in theories with compact extra dimensions. We show that in some cases the bounds are saturated by known manifolds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗