Search NASA⌕ Search

SEARCH · Search NASA

Results for “variance estimation”

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

Neural Network Prediction of Strong Lensing Systems with Domain Adaptation and Uncertainty Quantification

Modeling strong gravitational lenses is computationally expensive for the complex data from modern and next-generation cosmic surveys. Deep learning has emerged as a promising approach for finding lenses and predicting lensing parameters, such as the Einstein radius. Mean-variance Estimators (MVEs) are a common approach for obtaining aleatoric (data) uncertainties from a neural network prediction. However, neural networks have not been demonstrated to perform well on out-of-domain target data successfully - e.g., when trained on simulated data and applied to real, observational data. In this work, we perform the first study of the efficacy of MVEs in combination with unsupervised domain adaptation (UDA) on strong lensing data. The source domain data is noiseless, and the target domain data has noise mimicking modern cosmology surveys. We find that adding UDA to MVE increases the accuracy on the target data by a factor of about two over an MVE model without UDA. Including UDA also permits much more well-calibrated aleatoric uncertainty predictions. Advancements in this approach may enable future applications of MVE models to real observational data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Finding Real Uncertainties From Physical Simulations

Modeling strong gravitational lenses is computationally expensive for the complex data from modern and next-generation cosmic surveys. Deep learning has emerged as a promising approach for finding lenses and predicting lensing parameters, such as the Einstein radius. Mean-variance Estimators (MVEs) are a common approach for obtaining aleatoric (data) uncertainties from a neural network prediction. However, neural networks have not been demonstrated to perform well on out-of-domain target data successfully - e.g., when trained on simulated data and applied to real, observational data. In this work, we perform the first study of the efficacy of MVEs in combination with unsupervised domain adaptation (UDA) on strong lensing data. The source domain data is noiseless, and the target domain data has noise mimicking modern cosmology surveys. We find that adding UDA to MVE increases the accuracy on the target data by a factor of about two over an MVE model without UDA. Including UDA also permits much more well-calibrated aleatoric uncertainty predictions. Advancements in this approach may enable future applications of MVE models to real observational data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1966

The variance of spectral estimates

Step function with more than two values for computing variance of energy distribution for flat and nonflat spectra

SPECTRAL ENERGY DISTRIBUTION↗
NASA NTRS1972

Evaluation of errors in prior mean and variance in the estimation of integrated circuit failure rates using Bayesian methods

The critical point of any Bayesian analysis concerns the choice and quantification of the prior information. The effects of prior data on a Bayesian analysis are studied. Comparisons of the maximum likelihood estimator, the Bayesian estimator, and the known failure rate are presented. The results of the many simulated trails are then analyzed to show the region of criticality for prior information being supplied to the Bayesian estimator. In particular, effects of prior mean and variance are determined as a function of the amount of test data available.

Fletcher, B. C.↗
NASA NTRS1978

On-line parameter estimation using a high sensitivity estimator

An on-line parameter identification method is presented. The method is based on a recursive formulation of the maximum likelihood method, with a significant modification on the gains of the state estimator. In the conventional maximum likelihood method, the Kalman gains are used in the state estimator. This produces unbiased, minimum variance parameter estimates in the presence of process noise and measurement noise, but it also slows the convergence rate when the identification is done on-line. Here we suggest choosing the gains to maximize a measure of the sensitivities of the state estimates to parameter variations. One such criterion is to minimize the trace of the inverse information matrix. This increases the convergence rate significantly. After one or two time constants, the gains are switched to the Kalman values to assure unbiased, minimum-variance estimates. The state estimate will initially be nonoptimal, and may not be adequate for control purposes. In this case, a parallel Kalman filter which uses the identifier's parameter estimates can be used. This method is applied here for the identification of a simple first-order system, and for the identification of short-period stability derivatives of an F-8 aircraft from simulated data.

Mishne, D.↗
DOE OSTI2026

A Proof of the Asymptotic Variance of Path Length Estimators for Single-Collision Monte Carlo Source Iteration in the Thick Diffusion Limit

Here, we prove a theorem relating the variance of path length estimators for single-collision Monte Carlo source iteration to a parameter that becomes infinitesimally small in an important physical regime arising in radiative transfer. In our usage, “single-collision Monte Carlo source iteration” refers to Monte Carlo Boltzmann transport methods in which each Monte Carlo particle history includes no more than a single collision, and the physics of multiple scattering is modeled by lagging the scattering source term and iterating until this term converges. Our theorem can be used to construct variance reduction techniques which improve the order of the estimator variance. This enables calculations that would otherwise require impractically large sample sizes to achieve practical estimator uncertainties. We believe this is the first postulation of a theorem relating estimator variance to a limiting case parameter for single-collision Monte Carlo source iteration, and the first proof of such a theorem. We illustrate the theorem’s value with an example in which the authors of a transport method used the theorem to design a variance reduction technique that improved the uncertainty of their solution by a factor of about 500 for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material.

Mathematics and Computing↗
NASA NTRS1981

Spectral variance of aeroacoustic data

An asymptotic technique for estimating the variance of power spectra is applied to aircraft flyover noise data. The results are compared with directly estimated variances and they are in reasonable agreement. The basic time series need not be Gaussian for asymptotic theory to apply. The asymptotic variance formulae can be useful tools both in the design and analysis phase of experiments of this type.

Rao, K. V.↗
DOE OSTI2017

Estimating the mass variance in neutron multiplicity counting $-$ A comparison of approaches

In the standard practice of neutron multiplicity counting, the first three sampled factorial moments of the event triggered neutron count distribution are used to quantify the three main neutron source terms: the spontaneous fissile material effective mass, the relative (α,n) production and the induced fission source responsible for multiplication. This study compares three methods to quantify the statistical uncertainty of the estimated mass: the bootstrap method, propagation of variance through moments, and statistical analysis of cycle data method. Each of the three methods was implemented on a set of four different NMC measurements, held at the JRC-laboratory in Ispra, Italy, sampling four different Pu samples in a standard Plutonium Scrap Multiplicity Counter (PSMC) well counter.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2017

Deflation as a method of variance reduction for estimating the trace of a matrix inverse

Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 150 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Furthermore, using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Subset Regression

Backward elimination procedure minimizes prediction errors of equations fitted to factorial experiments. Problem of minimizing prediction error solved for two-level full- or fractional-factorial experiment with 16 factorial points and 0 to 6 center points. Such experiment provides 16 orthogonal coefficient estimates for empirical polynomial model. Each coefficient estimated with low variance error estimated from 16 observations.

Holms, A. G.↗
NASA NTRS2003

Estimation of Model Error Variances During Data Assimilation

Data assimilation is all about understanding the error characteristics of the data and models that are used in the assimilation process. Reliable error estimates are needed to implement observational quality control, bias correction of observations and model fields, and intelligent data selection. Meaningful covariance specifications are obviously required for the analysis as well, since the impact of any single observation strongly depends on the assumed structure of the background errors. Operational atmospheric data assimilation systems still rely primarily on climatological background error covariances. To obtain error estimates that reflect both the character of the flow and the current state of the observing system, it is necessary to solve three problems: (1) how to account for the short-term evolution of errors in the initial conditions; (2) how to estimate the additional component of error caused by model defects; and (3) how to compute the error reduction in the analysis due to observational information. Various approaches are now available that provide approximate solutions to the first and third of these problems. However, the useful accuracy of these solutions very much depends on the size and character of the model errors and the ability to account for them. Model errors represent the real-world forcing of the error evolution in a data assimilation system. Clearly, meaningful model error estimates and/or statistics must be based on information external to the model itself. The most obvious information source is observational, and since the volume of available geophysical data is growing rapidly, there is some hope that a purely statistical approach to model error estimation can be viable. This requires that the observation errors themselves are well understood and quantifiable. We will discuss some of these challenges and present a new sequential scheme for estimating model error variances from observations in the context of an atmospheric data assimilation system.

Dee, Dick↗
DOE OSTI2021

Quantifying Uncertainty in All-to-All Estimates of Space Object Conjunction Probabilities using U-Statistics

Predicting space object conjunctions is inherently probabilistic due to initial state and orbit model uncertainty. A commonly considered Monte Carlo estimator of the conjunction probability is the ’all-to-all’ estimator. Given independent random samples of the trajectories of both objects, the estimator is the percentage of all pairs of trajectories that result in a conjunction. Intuitively, the all-to-all estimator is the best possible estimator of the conjunction probability since it considers all pairs of Monte Carlo samples. However, its distribution is not available in closed-form, which limits its use in practice and makes this intuition difficult to make rigorous. In this paper, the all-to-all estimator is identified as a U-statistic, which implies that it has several favorable properties. Specifically, the estimator is the minimum variance unbiased estimator of the conjunction probability and is asymptotically Gaussian distributed. An approximate confidence interval for the conjunction probability is obtained from an estimate of the asymptotic Gaussian distribution. We show how to efficiently compute the confidence interval and demonstrate that the interval has the nominal coverage level. The confidence intervals are also seen to be narrower than those based on the commonly-used each-to-each estimator. Furthermore, the all-to-all estimator is shown to allow different Monte Carlo sample sizes, whereas the each-to-each estimator requires equal sample sizes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗