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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Excited-state uncertainties in lattice-QCD calculations of multi-hadron systems

Excited-state effects lead to hard-to-quantify systematic uncertainties in lattice quantum chromodynamics (LQCD) spectroscopy calculations when computationally accessible imaginary times are smaller than inverse excitation gaps, as often arises for multi-hadron systems with signal-to-noise problems. Lanczos residual bounds address this by providing two-sided constraints on energies that do not require assumptions beyond Hermiticity, but often give very conservative systematic uncertainty estimates. Here, a more-constraining set of gap bounds is introduced for hadron spectroscopy. These bounds provide tighter constraints whose validity requires an explicit assumption about an energy gap. Exactly solvable lattice field theory correlators are used to test the utility of residual and gap bounds at finite and infinite statistics. Two-sided bounds and other analysis methods are then applied to a high-statistics LQCD calculation of nucleon-nucleon scattering at $m_π\sim 800$ MeV. Generalized eigenvalue problem (GEVP) and Lanczos energy estimators are compatible when applied to the same correlator data, but analyses including different interpolating operators show statistically significant inconsistencies. However, two-sided bounds from all operators are consistent. Under the assumption that the number of energy levels below $NΔ$ and $ΔΔ$ thresholds is the same as for non-interacting nucleons, gap bounds are sufficient to constrain nucleon-nucleon scattering amplitudes at phenomenologically relevant precision. Lanczos methods further reveal that energy-eigenstate estimates from previously studied asymmetric correlators have not converged over accessible imaginary times. Nevertheless, data-driven examples demonstrate why assumptions are required to draw conclusions about the natures of two-nucleon ground states at these masses.

Detmold, William [MIT, Cambridge, CTP]↗
DOE OSTI2025

Comparing approaches for introducing polycyclic aromatic hydrocarbons to Ge(001) to seed graphene nanoribbon synthesis by CH 4 chemical vapor deposition

Here, we evaluate two approaches for introducing polycyclic aromatic hydrocarbons (PAHs) to a graphene catalyst substrate as part of a two-step chemical vapor deposition (CVD) process for growing graphene nanoribbons (GNRs). In this process, PAHs first form graphene-like seeds on Ge, and then GNRs are subsequently evolved from these PAH-derived seeds via substrate-mediated anisotropic growth kinetics during the CVD of CH4. The first seeding approach sublimes controlled doses of PAH thin films into the CVD chamber, while the second delivers PAHs directly from the vapor phase at set concentrations. Using these two approaches, we measure the dependence of GNR density on PAH dose and compare the experimental results with predictions from a rate model of PAH diffusion, desorption, and clustering. We find that PAHs that more strongly adsorb to the catalyst surface (generally larger PAHs) desirably remain more individualized prior to GNR evolution whereas smaller, more weakly bound PAHs aggregate into larger clusters with various sizes on Ge that are undesirable for synthesizing more monodisperse GNRs. As a result, this work is important because it offers a framework that enables the rational selection and design of seed molecules, advancing anisotropic GNR CVD synthesis.

CVD↗
DOE OSTI2024

Production of meson molecules in ultraperipheral heavy ion collisons

In this work we present a calculation of exotic charmonium production in ultraperipheral collisions, in which the exotic state is explicitly treated as a meson molecule. Our formalism is general, but we focus on the lightest possible exotic charmonium state: a 𝐷 + ⁢𝐷 − molecular bound state. It was proposed some time ago, and it has been an object of experimental searches. Here we study the production of the open charm pair in the process 𝛾⁢𝛾 → 𝐷 + ⁢𝐷 − . Then we use a prescription to project the free pair |𝐷 + ⁢𝐷 − ⟩ onto a bound state at the amplitude level and compute the cross section of the process 𝛾⁢𝛾 → 𝐵 (where 𝐵 is the bound state). Finally, we convolute this last cross section with the equivalent photon distributions coming from the projectile and target in an ultraperipheral collision and find the 𝐴⁢𝐴 → 𝐴⁢𝐴⁢𝐵 cross section, which, for 𝑃⁢𝑏 −𝑃⁢𝑏 collisions at $\sqrt{s_{NN}}$ =5.02 TeV, is of the order of 3 μ⁢b.

Sobrinho, F. C.↗
DOE OSTI2025

Warm and fuzzy dark matter: Free streaming of wave dark matter

Wave or fuzzy dark matter that is produced with relativistic wave numbers exhibits free-streaming effects analogous to warm or hot particle dark matter with relativistic momenta. Axions produced after inflation provide such a warm or mildly relativistic candidate, where the enhanced suppression and observational bounds are only moderately stronger than that from wave propagation of initially cold axions. More generally, the free-streaming damping also impacts isocurvature fluctuations from generation in causally disconnected patches. As coherent spatial fluctuations free stream away they leave incoherent and transient superpositions in their wakes. These multiple wave momentum streams are the wave analog of particle phase space fluctuations or directional collisionless damping of massive neutrinos or hot dark matter. The observable impact on both adiabatic and isocurvature fluctuations of fuzzy dark matter can differ from their cold dark matter counterparts due to free streaming depending on how warm or hot is their momentum distribution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Non-Gaussian Generalized Two-Mode Squeezing: Applications to Two-Ensemble Spin Squeezing and Beyond

Bosonic two-mode squeezed states are paradigmatic entangled Gaussian states that have wide utility in quantum information and metrology. Here, in this study, we show that the basic structure of these states can be generalized to arbitrary bipartite quantum systems in a manner that allows simultaneous, Heisenberg-limited estimation of two independent parameters for finite-dimensional systems. Further, we show that these general states can always be stabilized by a relatively simple Markovian dissipative process. In the specific case where the two subsystems are ensembles of two-level atoms or spins, our generalized states define a notion of two-mode spin squeezing that is valid beyond the Gaussian limit and that enables true multiparameter estimation. We discuss how generalized Ramsey measurements allow one to reach the two-parameter quantum Cramér-Rao bound, and how the dissipative preparation scheme is compatible with current experiments.

Mamaev, Mikhail [Univ. of Chicago, IL (United Stat↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2025

Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage

Here, we show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on “thermodynamic codes” to general local spin and different irreducible representations using only properties of the angular momentum algebra, we obtain bounds on the code inaccuracy under generic noise on any known 𝑑 sites, under independent and identically distributed noise, and under heralded 𝑑-local erasures. We demonstrate that this family of codes protects a probe state with quantum Fisher information surpassing the standard quantum limit when the sensing parameter couples to the generator of the U(1) logical gate.

quantum error correction↗
DOE OSTI2025

HEU Systems at Low Temperatures [Slides]

This project is sponsored by the Nuclear Criticality Safety Program (NCSP) in collaboration with Lawrence Livermore National Laboratory (LLNL) with a novel interest surrounding the transportation of fissile material: there is a concern regarding the inadvertent introduction of the material in a low-temperature environment. The low-temperature environment will be bounded down to temperatures not below -40 ºC, since this is the limit allotted for packages containing general radioactive material exposed to air. Eventually, the goal of the project is to conduct experiments spanning multiple fission energies at these low temperatures, concluding in an International Criticality Safety Benchmark Evaluation Project (ICSBEP) benchmark.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

The Effect of the Prior and the Experimental Design on the Inference of the Precision Matrix in Gaussian Chain Graph Models

Here, we investigate whether (and how) experimental design could aid in the estimation of the precision matrix in a Gaussian chain graph model, especially the interplay between the design, the effect of the experiment and prior knowledge about the effect. Estimation of the precision matrix is a fundamental task to infer biological graphical structures like microbial networks. We compare the marginal posterior precision of the precision matrix under four priors: flat, conjugate Normal-Wishart, Normal-MGIG and a general independent. Under the flat and conjugate priors, the Laplace-approximated posterior precision is not a function of the design matrix rendering useless any efforts to find an optimal experimental design to infer the precision matrix. In contrast, the Normal-MGIG and general independent priors do allow for the search of optimal experimental designs, yet there is a sharp upper bound on the information that can be extracted from a given experiment. We confirm our theoretical findings via a simulation study comparing (i) the KL divergence between prior and posterior and (ii) the Stein’s loss difference of MAPs between random and no experiment. Our findings provide practical advice for domain scientists conducting experiments to better infer the precision matrix as a representation of a biological network.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration

The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.

complexity theory↗
DOE OSTI2025

Anisotropic Response of Defect Bound States to the Magnetic Field in Epitaxial FeSn Films

Crystal defects, whether intrinsic or engineered, drive many fundamental phenomena and novel functionalities of quantum materials. Here, we report symmetry-breaking phenomena induced by Sn vacancy defects on the surface of epitaxial Kagome antiferromagnetic FeSn films using low-temperature scanning tunneling microscopy and spectroscopy. Near the single Sn vacancy, anisotropic quasiparticle interference patterns are observed in the differential conductance dI/dV maps, breaking the 6-fold rotational symmetry of the Kagome layer. Furthermore, the Sn vacancy defects induce bound states that exhibit anomalous Zeeman shift under an out-of-plane magnetic field, where the energy of the bound states moves linearly toward higher energy independent of the direction of the magnetic field. Under an in-plane magnetic field, the shift of the bound state energy also shows a 2-fold oscillating behavior as a function of the azimuth angle. These findings demonstrate defectenabled new functionalities in Kagome antiferromagnets for potential applications in nanoscale spintronic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Unitarity of bespoke amplitudes

We use partial wave unitarity to constrain various bespoke four-point amplitudes. We start by constructing bespoke generalizations of the type-I superstring amplitude, which we show satisfy dual resonance and have suitable high-energy limits. By analyzing the behavior of partial wave coefficients for highly massive states, we strictly rule out all bespoke amplitudes with asymptotically nonlinear Regge trajectories and place constraints on the first few nontrivial parameters in asymptotically linear cases. Finally, we argue that while a large class of unitary bespoke amplitudes fails to satisfy Regge sum rules, there exists a smaller subclass with a vanishing mass gap that is superpolynomially bounded.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
DOE OSTI2024

A General Framework for Error-controlled Unstructured Scientific Data Compression

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression ratios. We present a multi-component, error-bounded compression framework designed to enhance the compression of floating-point unstructured mesh data, which is common in scientific applications. Our approach involves interpolating mesh data onto a rectilinear grid and then separately compressing the grid interpolation and the interpolation residuals. This method is general, independent of mesh types and typologies, and can be seamlessly integrated with existing lossy compressors for improved performance. We evaluated our framework across twelve variables from two synthetic datasets and two real-world simulation datasets. The results indicate that the multi-component framework consistently outperforms state-of-the-art lossy compressors on unstructured data, achieving, on average, a 2.3 − 3.5× improvement in compression ratios, with error bounds ranging from 1 × 10 the −6 to 1×10−2. We further investigate impact of hyperparameters, such as grid spacing and error allocation, to deliver optimal compression ratios in diverse datasets.

Gong, Qian↗
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 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↗