Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gaussian Approximation”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Improving the electrostatic design of the Jefferson Lab 300 kV DC photogun

The 300 kV DC high voltage photogun at Jefferson Lab was redesigned to deliver electron beams with a much higher bunch charge and improved beam properties. The original design provided only a modest longitudinal electric field ( E z ) at the photocathode, which limited the achievable extracted bunch charge. To reach the bunch charge goal of approximately few nC with 75 ps full-width at half-maximum Gaussian laser pulse width, the existing DC high voltage photogun electrodes and anode–cathode gap were modified to increase E z at the photocathode. In addition, the anode aperture was spatially shifted with respect to the beamline longitudinal axis to minimize the beam deflection introduced by the non-symmetric nature of the inverted insulator photogun design. We present the electrostatic design of the original photogun and the modified photogun and beam dynamics simulations that predict vastly improved performance. We also quantify the impact of the photocathode recess on beam quality, where recess describes the actual location of the photocathode inside the photogun cathode electrode relative to the intended location. A photocathode unintentionally recessed/misplaced by sub-millimeter distance can significantly impact the downstream beam size.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Impact of beam–beam effects on absolute luminosity calibrations at the CERN Large Hadron Collider

At the Large Hadron Collider (LHC), absolute luminosity calibrations obtained by the van der Meer (vdM) method are affected by the mutual electromagnetic interaction of the two beams. The colliding bunches experience relative orbit shifts, as well as optical distortions akin to the dynamic-β effect, that both depend on the transverse beam separation and must therefore be corrected for when deriving the absolute luminosity scale. In the vdM regime, the beam–beam parameter is small enough that the orbit shift can be calculated analytically. The dynamic-β corrections to the luminometer calibrations, however, had until the end of Run 2 been estimated in the linear approximation only. In this report, the influence of beam–beam effects on the vdM-based luminosity scale is quantified, together with the associated systematic uncertainties, by means of simulations that fully take into account the non-linearity of the beam–beam force, as well as the resulting non-Gaussian distortions of the transverse beam distributions. Two independent multiparticle simulations, one limited to the weak-strong approximation and one that models strong-strong effects in a self-consistent manner, are found in excellent agreement; both predict a percent-level shift of the absolute pp-luminosity values with respect to those assumed until recently in the physics publications of the LHC experiments. These results also provide guidance regarding further studies aimed at reducing the beam–beam-related systematic uncertainty on beam–beam corrections to absolute luminosity calibrations by the van der Meer method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Non-Gaussianity in the weak lensing correlation function likelihood – implications for cosmological parameter biases

ABSTRACT We study the significance of non-Gaussianity in the likelihood of weak lensing shear two-point correlation functions, detecting significantly non-zero skewness and kurtosis in 1D marginal distributions of shear two-point correlation functions in simulated weak lensing data. We examine the implications in the context of future surveys, in particular LSST, with derivations of how the non-Gaussianity scales with survey area. We show that there is no significant bias in 1D posteriors of Ωm and σ8 due to the non-Gaussian likelihood distributions of shear correlations functions using the mock data (100 deg2). We also present a systematic approach to constructing approximate multivariate likelihoods with 1D parametric functions by assuming independence or more flexible non-parametric multivariate methods after decorrelating the data points using principal component analysis (PCA). While the use of PCA does not modify the non-Gaussianity of the multivariate likelihood, we find empirically that the 1D marginal sampling distributions of the PCA components exhibit less skewness and kurtosis than the original shear correlation functions. Modelling the likelihood with marginal parametric functions based on the assumption of independence between PCA components thus gives a lower limit for the biases. We further demonstrate that the difference in cosmological parameter constraints between the multivariate Gaussian likelihood model and more complex non-Gaussian likelihood models would be even smaller for an LSST-like survey. In addition, the PCA approach automatically serves as a data compression method, enabling the retention of the majority of the cosmological information while reducing the dimensionality of the data vector by a factor of ∼5.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An accurate, non-empirical method for incorporating decoherence into Ehrenfest dynamics

In mixed quantum-classical nonadiabatic molecular dynamics methods, the anchoring of the electronic wave function to a single nuclear geometry results in both quantitative and qualitative errors in the dynamics. In the context of both Ehrenfest and trajectory surface hopping methods, methods for incorporating decoherence are widely used to eliminate these errors. However, the accuracy of these methods often depends strongly on the parameterization of the decoherence time and/or other related quantities. Here, we present a refinement of the recently introduced collapse to a block (TAB) scheme for incorporating decoherence into Ehrenfest dynamics. The proposed approach incorporates an approximation to the history of the population dynamics and treats the coherence decay as Gaussian, rather than exponential. This method uses parameters that can be obtained from first principles, rather than empirical fitting. Application to one-dimensional models indicates excellent agreement with numerically exact simulations. We also introduce a second refinement to the TAB method: a robust linear least-squares algorithm for determining collapse probabilities.

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

Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Matérn-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Furthermore, our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.

Bayesian inverse problem↗
DOE OSTI2022

Scaled Vecchia Approximation for Fast Computer-Model Emulation

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia’s ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction, and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

TURBOMOLE: Modular program suite for ab initio quantum-chemical and condensed-matter simulations

TURBOMOLE is a collaborative, multi-national software development project aiming to provide highly efficient and stable computational tools for quantum chemical simulations of molecules, clusters, periodic systems, and solutions. The TURBOMOLE software suite is optimized for widely available, inexpensive, and resource-efficient hardware such as multi-core workstations and small computer clusters. TURBOMOLE specializes in electronic structure methods with outstanding accuracy–cost ratio, such as density functional theory including local hybrids and the random phase approximation (RPA), GW-Bethe–Salpeter methods, second-order Møller–Plesset theory, and explicitly correlated coupled-cluster methods. TURBOMOLE is based on Gaussian basis sets and has been pivotal for the development of many fast and low-scaling algorithms in the past three decades, such as integral-direct methods, fast multipole methods, the resolution-of-the-identity approximation, imaginary frequency integration, Laplace transform, and pair natural orbital methods. This review focuses on recent additions to TURBOMOLE’s functionality, including excited-state methods, RPA and Green’s function methods, relativistic approaches, high-order molecular properties, solvation effects, and periodic systems. A variety of illustrative applications along with accuracy and timing data are discussed. Moreover, available interfaces to users as well as other software are summarized. TURBOMOLE’s current licensing, distribution, and support model are discussed, and an overview of TURBOMOLE’s development workflow is provided. Challenges such as communication and outreach, software infrastructure, and funding are highlighted.

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

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗
DOE OSTI2022

Stochastic and a posteriori optimization to mitigate coil manufacturing errors in stellarator design

Abstract It was recently shown in Wechsung et al (2022 Proc. Natl Acad. Sci. USA 119 e2202084119) that there exist electromagnetic coils that generate magnetic fields, which are excellent approximations to quasi-symmetric fields and have very good particle confinement properties. Using a Gaussian process-based model for coil perturbations, we investigate the impact of manufacturing errors on the performance of these coils. We show that even fairly small errors result in noticeable performance degradation. While stochastic optimization yields minor improvements, it is not possible to mitigate these errors significantly. As an alternative to stochastic optimization, we then formulate a new optimization problem for computing optimal adjustments of the coil positions and currents without changing the shapes of the coil. These a-posteriori adjustments are able to reduce the impact of coil errors by an order of magnitude, providing a new perspective for dealing with manufacturing tolerances in stellarator design.

Physics↗
DOE OSTI2020

LyaCoLoRe : synthetic datasets for current and future Lyman-α forest BAO surveys

The statistical power of Lyman-α forest Baryon Acoustic Oscillation (BAO) measurements is set to increase significantly in the coming years as new instruments such as the Dark Energy Spectroscopic Instrument deliver progressively more constraining data. Generating mock datasets for such measurements will be important for validating analysis pipelines and evaluating the effects of systematics. With such studies in mind, here we present LyaCoLoRe: a package for producing synthetic Lyman-α forest survey datasets for BAO analyses. LyaCoLoRe transforms initial Gaussian random field skewers into skewers of transmitted flux fraction via a number of fast approximations. In this work we explain the methods of producing mock datasets used in LyaCoLoRe, and then measure correlation functions on a suite of realisations of such data. We demonstrate that we are able to recover the correct BAO signal, as well as large-scale bias parameters similar to literature values. Finally, we briefly describe methods to add further astrophysical effects to our skewers — high column density systems and metal absorbers — which act as potential complications for BAO analyses.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Exploring the energy landscape of RBMs: reciprocal space insights into bosons, hierarchical learning and symmetry breaking

Deep generative models have become ubiquitous due to their ability to learn and sample from complex distributions. Despite the proliferation of various frameworks, the relationships among these models remain largely unexplored, a gap that hinders the development of a unified theory of AI learning. In this work, we address two central challenges: clarifying the connections between different deep generative models and deepening our understanding of their learning mechanisms. We focus on Restricted Boltzmann Machines (RBMs), a class of generative models known for their universal approximation capabilities for discrete distributions. By introducing a reciprocal space formulation for RBMs, we reveal a connection between these models, diffusion processes, and systems of coupled bosons. Our analysis shows that at initialization, the RBM operates at a saddle point, where the local curvature is determined by the singular values of the weight matrix, whose distribution follows the Marc̆enko-Pastur law and exhibits rotational symmetry. During training, this rotational symmetry is broken due to hierarchical learning, where different degrees of freedom progressively capture features at multiple levels of abstraction. This leads to a symmetry breaking in the energy landscape, reminiscent of Landau’s theory. This symmetry breaking in the energy landscape is characterized by the singular values and the weight matrix eigenvector matrix. We derive the corresponding free energy in a mean-field approximation. We show that in the limit of infinite size RBM, the reciprocal variables are Gaussian distributed. Our findings indicate that in this regime, there will be some modes for which the diffusion process will not converge to the Boltzmann distribution. To illustrate our results, we trained replicas of RBMs with different hidden layer sizes using the MNIST dataset. Our findings not only bridge the gap between disparate generative frameworks but also shed light on the fundamental processes underpinning learning in deep generative models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Cosmological constraints from the Subaru Hyper Suprime-Cam year 1 shear catalogue lensing convergence probability distribution function

Here we utilize the probability distribution function (PDF) of normalized convergence maps reconstructed from the Subaru Hyper Suprime-Cam (HSC) year 1 shear catalogue, in combination with the power spectrum, to measure the matter clustering amplitude S 8 = σ 8 $\sqrt {Ω_{m}/0.3}$. The large-scale structure’s statistical properties are incompletely described by the traditional two-point statistics, motivating our investigation of the PDF—a complementary higher-order statistic. By defining the PDF over the standard-deviation-normalized convergence map, we are able to isolate the non-Gaussian information. We use tailored simulations to compress the data vector and construct a likelihood approximation. We mitigate the impact of survey and astrophysical systematics with cuts on smoothing scales, redshift bins, and data vectors. We find S 8 = $0.860^{+0.066}_{–0.109}$ from the PDF alone and S 8 = 0.798$^{+0.029}_{–0.042}$ from the combination of the PDF and power spectrum (68% confidential level (CL)). The PDF improves the power-spectrum-only constraint by about 10%.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗
DOE OSTI2023

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Constraints on primordial non-Gaussianity from the cross-correlation of DESI luminous red galaxies and Planck CMB lensing

We use the angular cross-correlation between a luminous red galaxy (LRG) sample from the Dark Energy Spectroscopic Instrument (DESI) Legacy Survey data release DR9 and the Planck cosmic microwave background (CMB) lensing maps to constrain the local primordial non-Gaussianity parameter, f NL , using the scale-dependent galaxy bias effect. The galaxy sample covers approximately 40% of the sky, contains galaxies up to redshift z ∼ 1.4, and is calibrated with the LRG spectra that have been observed for DESI Year 1 (Y1). We apply a nonlinear imaging systematics treatment based on neural networks to remove observational effects that could potentially bias the f NL measurement. Our measurement is performed without blinding, but the full analysis pipeline is tested with simulations including systematics. Using the two-point angular cross-correlation between LRG and CMB lensing only, we find f NL = 39 −38 +40 at the 68% confidence level, and our result is robust in terms of systematics and cosmological assumptions. If we combine this information with the autocorrelation of LRG, applying a scale cut to limit the impact of systematics, we find f NL = 24 −21 +20 at the 68% confidence level. Our results motivate the use of CMB lensing cross-correlations to measure f NL with future datasets, given its stability in terms of observational systematics compared to the angular autocorrelation. Furthermore, performing accurate systematics mitigation is crucially important in order to achieve competitive constraints on f NL from CMB lensing cross-correlation in combination with the tracers’ autocorrelation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗
DOE OSTI2024

Uncertainty Quantification via Stable Distribution Propagation

We propose a new approach for propagating stable probability distributions through neural networks. Our method is based on local linearization, which we show to be an optimal approximation in terms of total variation distance for the ReLU non-linearity. This allows propagating Gaussian and Cauchy input uncertainties through neural networks to quantify their output uncertainties. To demonstrate the utility of propagating distributions, we apply the proposed method to predicting calibrated confidence intervals and selective prediction on out-of-distribution data. The results demonstrate a broad applicability of propagating distributions and show the advantages of our method over other approaches such as moment matching.

Artificial Intelligence (cs.AI)↗