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.

SourceResearch connectionFrom yearThrough year

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

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

NASA NTRS1972

Response of discrete linear systems to forcing functions with inequality constraints.

An analysis is made of the maximum response of discrete, linear mechanical systems to arbitrary forcing functions which lie within specified bounds. Primary attention is focused on the complete determination of the forcing function which will engender maximum displacement to any particular mass element of a multi-degree-of-freedom system. In general, the desired forcing function is found to be a bang-bang type function, i.e., a function which switches from the maximum to the minimum bound and vice-versa at certain instants of time. Examples of two-degree-of-freedom systems, with and without damping, are presented in detail. Conclusions are drawn concerning the effect of damping on the switching times and the general procedure for finding these times is discussed.

Michalopoulos, C. D.↗

NASA NTRS1993

Structure of the dayside reconnection layer in resistive MHD and hybrid models

Numerical simulations were performed to investigate the structure of the reconnection layer at the dayside magnetopause. Two typical cases are examined in detail; both are asymmetric in magnetic field and plasma density. In case 1, the guide fields in the magnetosheath and in the magnetosphere are set at zero and thus the tangential magnetic fields on the two sides of the initial current sheet are exactly antiparallel. In case 2, the angle between the tangential magnetic fields on the two sides of the initial current sheet is 145 deg. The results obtained from a resistive MHD model and from a hybrid model are found to be different. In the MHD simulation of case 1, a 2-4 intermediate shock is found to bound the reconnection layer on the magnetosheath side, while an Alfven wave pulse bounds the reconnection layer on the magnetospheric side. In case 2, it is found that a time-dependent intermediate shock (TDIS) bounds the reconnection layer on the magnetosheath side, with a slow expansion wave propagating behind. With the MHD simulations, in the general case in which the tangential magnetic fields on the two sides of the initial current sheet are not exactly antiparallel, a rotational discontinuity across which the tangential magnetic field rotates, a large angle is found to bound the reconnection layer on the magnetosheath side.

Lin, Y.↗

DOE OSTI2025

Probabilistic Error Bounds for Low-Rank Tensor Decompositions Used in Large-Scale Data Analysis Applications (LDRD Final Report)

This report documents a research project on analyzing low-rank tensor models for data analysis that took place at Sandia National Laboratories from October 2023–September 2025. The focus of this work was to extend theoretical frameworks from statistics and probability theory for use with models for scalar, vector, and matrix data to models with tensor, or general multi-dimensional array, data. Through this work, we have provided a new set of tools for bounding errors on low-rank tensor models of both complete and sampled data. The remainder of this report is organized as follows. In Section 1, we describe the proposed work at the start of the project. Section 2 describes the research advances made as part of the project. Other research contributions in the form of conference presentations and software development is provided in Section 3. Workforce development at Sandia and Florida Atlantic University (via a subcontract on this project) is provided in Section 4.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2020

Tests of General Relativity with Stellar-Mass Black Hole Binaries Observed by LISA

We consider the observation of stellar-mass black holes binaries with the Laser Interferometer Space Antenna(LISA). Preliminary results based on Fisher information matrix analyses have suggested that gravitational waves from those sources could be very sensitive to possible deviations from the theory of general relativity (GR) andfrom the strong equivalence principle during the low-frequency binary inspiral. We perform a full Markov Chain Monte Carlo Bayesian analysis to quantify the sensitivity of these signals to two phenomenological modifications of GR, namely a putative gravitational dipole emission and a non-zero mass for the graviton, properly accounting for the detector’s response. Moreover, we consider a scenario where those sources could be observed also with Earth-based detectors, which should measure the coalescence time with precision better than 1 ms. This constraint on the coalescence time further improves the bounds that we can set on those phenomenological deviations from GR. We show that tests of dipole radiation and the graviton’s mass should improve respectively by seven and half an order(s) of magnitude over current bounds. Finally, we discuss under which conditions one may claim the detection of a modification to General Relativity.

Alexandre Toubiana↗

DOE OSTI2026

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗

DOE OSTI2025

Charting the chemical space of Zintl phases with graph neural networks and bonding insights

A large number of Zintl phases have been discovered by solid-state chemists driven by empirical knowledge, chemical intuition and in some cases, through serendipitous accidents. These discoveries have only scratched the surface, given the vast compositional and structural diversity that Zintl phases can accommodate. The large chemical space of Zintl phases, as well as intermetallic compounds in general, remain under-explored. Here, we use graph neural networks and the upper bound energy minimization approach to efficiently scan a large chemical space of >90 000 hypothetical Zintl phases and accurately discover 1810 new thermodynamically stable phases with 90% precision, as validated with first-principles calculations. We show that our approach is more than 2× more accurate in predicting DFT stability than M3GNet (40% precision) on the same dataset. Using a random forest model and SHAP analysis, we demonstrate the critical role of ionic bonding in the thermodynamic stability of Zintl phases. Our results not only expand the known chemical landscape of Zintl phases but also highlight the efficacy of machine learning frameworks combined with domain knowledge in uncovering chemically meaningful insights across complex intermetallics.

36 MATERIALS SCIENCE↗

NASA NTRS1974

Error analysis of householder transformations as applied to the standard and generalized eigenvalue problems

Backward error analyses of the application of Householder transformations to both the standard and the generalized eigenvalue problems are presented. The analysis for the standard eigenvalue problem determines the error from the application of an exact similarity transformation, and the analysis for the generalized eigenvalue problem determines the error from the application of an exact equivalence transformation. Bounds for the norms of the resulting perturbation matrices are presented and compared with existing bounds when known.

Ward, R. C.↗

NASA NTRS1979

Primordial inhomogeneities in the expanding universe. II - General features of spherical models at late times

This paper studies the density profile that forms around a spherically symmetric bound central core immersed in a homogeneous-background k = 0 or k = -1 Friedmann-Robertson-Walker cosmological model, with zero pressure. Although the density profile in the linearized regime is almost arbitrary, in the nonlinear regime certain universal features of the density profile are obtained that are independent of the details of the initial conditions. The formation of 'halos' ('holes') with densities greater than (less than) the average cosmological density is discussed. It is shown that in most regions 'halos' form, and universal values are obtained for the slope of the ln (density)-ln (radius) profile in those 'halos' at late times, independently of the shape of the initial density profile. Restrictions are derived on where it is possible for 'holes' to exist at late times and on how such 'holes' must have evolved.

Olson, D. W.↗

NASA NTRS1987

More on the decoder error probability for Reed-Solomon codes

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occurs. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub e (u) for the (255, 223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Cheung, K.-M.↗

NASA NTRS1989

More on the decoder error probability for Reed-Solomon codes

The decoder error probability for Reed-Solomon codes (more generally, linear maximum distance separable codes) is examined. McEliece and Swanson offered an upper bound on P sub E (u), the decoder error probability given that u symbol errors occur. This upper bound is slightly greater than Q, the probability that a completely random error pattern will cause decoder error. By using a combinatoric technique, the principle of inclusion and exclusion, an exact formula for P sub E (u) is derived. The P sub E (u) for the (255,223) Reed-Solomon Code used by NASA, and for the (31,15) Reed-Solomon code (JTIDS code), are calculated using the exact formula, and the P sub E (u)'s are observed to approach the Q's of the codes rapidly as u gets larger. An upper bound for the expression is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P sub E (u) indeed approaches Q as u becomes large, and some laws of large numbers come into play.

Cheung, Kar-Ming↗

NASA NTRS2010

Chemical sensors using coated or doped carbon nanotube networks

Methods for using modified single wall carbon nanotubes ("SWCNTs") to detect presence and/or concentration of a gas component, such as a halogen (e.g., Cl.sub.2), hydrogen halides (e.g., HCl), a hydrocarbon (e.g., C.sub.nH.sub.2n+2), an alcohol, an aldehyde or a ketone, to which an unmodified SWCNT is substantially non-reactive. In a first embodiment, a connected network of SWCNTs is coated with a selected polymer, such as chlorosulfonated polyethylene, hydroxypropyl cellulose, polystyrene and/or polyvinylalcohol, and change in an electrical parameter or response value (e.g., conductance, current, voltage difference or resistance) of the coated versus uncoated SWCNT networks is analyzed. In a second embodiment, the network is doped with a transition element, such as Pd, Pt, Rh, Ir, Ru, Os and/or Au, and change in an electrical parameter value is again analyzed. The parameter change value depends monotonically, not necessarily linearly, upon concentration of the gas component. Two general algorithms are presented for estimating concentration value(s), or upper or lower concentration bounds on such values, from measured differences of response values.

Li, Jing↗

NASA NTRS2011

Coated or doped carbon nanotube network sensors as affected by environmental parameters

Li, Jing↗

NASA NTRS2012

Bound-free Spectra for Diatomic Molecules

It is now recognized that prediction of radiative heating of entering space craft requires explicit treatment of the radiation field from the infrared (IR) to the vacuum ultra violet (VUV). While at low temperatures and longer wavelengths, molecular radiation is well described by bound-bound transitions, in the short wavelength, high temperature regime, bound-free transitions can play an important role. In this work we describe first principles calculations we have carried out for bound-bound and bound-free transitions in N2, O2, C2, CO, CN, NO, and N2+. Compared to bound ]bound transitions, bound-free transitions have several particularities that make them different to deal with. These include more complicated line shapes and a dependence of emission intensity on both bound state diatomic and atomic concentrations. These will be discussed in detail below. The general procedure we used was the same for all species. The first step is to generate potential energy curves, transition moments, and coupling matrix elements by carrying out ab initio electronic structure calculations. These calculations are expensive, and thus approximations need to be made in order to make the calculations tractable. The only practical method we have to carry out these calculations is the internally contracted multi-reference configuration interaction (icMRCI) method as implemented in the program suite Molpro. This is a widely used method for these kinds of calculations, and is capable of generating very accurate results. With this method, we must first of choose which electrons to correlate, the one-electron basis to use, and then how to generate the molecular orbitals.

Schwenke, David W.↗

NASA NTRS1985

Monopole, astrophysics and cosmic ray observatory at Gran Sasso

A new large area detector, MACRO was approved for installation at the Gran Sasso Laboratory in Italy. The detector will be dedicated to the study of naturally penetrating radiation deep underground. It is designed with the general philosophy of covering the largest possible area with a detector having both sufficient built-in redundancy and use of complementary techniques to study very rare phenomena. The detector capabilities will include monopole investigations significantly below the Parker bound; astrophysics studies of very high energy gamma ray and neutrino point sources; cosmic ray measurements of single and multimuons; and the general observation of rare new forms of matter in the cosmic rays.

Demarzo, C.↗

DOE OSTI2026

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

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]↗

NASA NTRS2000

Predictive and Neural Predictive Control of Uncertain Systems

Accomplishments and future work are:(1) Stability analysis: the work completed includes characterization of stability of receding horizon-based MPC in the setting of LQ paradigm. The current work-in-progress includes analyzing local as well as global stability of the closed-loop system under various nonlinearities; for example, actuator nonlinearities; sensor nonlinearities, and other plant nonlinearities. Actuator nonlinearities include three major types of nonlineaxities: saturation, dead-zone, and (0, 00) sector. (2) Robustness analysis: It is shown that receding horizon parameters such as input and output horizon lengths have direct effect on the robustness of the system. (3) Code development: A matlab code has been developed which can simulate various MPC formulations. The current effort is to generalize the code to include ability to handle all plant types and all MPC types. (4) Improved predictor: It is shown that MPC design using better predictors that can minimize prediction errors. It is shown analytically and numerically that Smith predictor can provide closed-loop stability under GPC operation for plants with dead times where standard optimal predictor fails. (5) Neural network predictors: When neural network is used as predictor it can be shown that neural network predicts the plant output within some finite error bound under certain conditions. Our preliminary study shows that with proper choice of update laws and network architectures such bound can be obtained. However, much work needs to be done to obtain a similar result in general case.

Kelkar, Atul G.↗

NASA NTRS2000

Any Two Learning Algorithms Are (Almost) Exactly Identical

This paper shows that if one is provided with a loss function, it can be used in a natural way to specify a distance measure quantifying the similarity of any two supervised learning algorithms, even non-parametric algorithms. Intuitively, this measure gives the fraction of targets and training sets for which the expected performance of the two algorithms differs significantly. Bounds on the value of this distance are calculated for the case of binary outputs and 0-1 loss, indicating that any two learning algorithms are almost exactly identical for such scenarios. As an example, for any two algorithms A and B, even for small input spaces and training sets, for less than 2e(-50) of all targets will the difference between A's and B's generalization performance of exceed 1%. In particular, this is true if B is bagging applied to A, or boosting applied to A. These bounds can be viewed alternatively as telling us, for example, that the simple English phrase 'I expect that algorithm A will generalize from the training set with an accuracy of at least 75% on the rest of the target' conveys 20,000 bytes of information concerning the target. The paper ends by discussing some of the subtleties of extending the distance measure to give a full (non-parametric) differential geometry of the manifold of learning algorithms.

Wolpert, David H.↗