Error estimation in high dimensional space for stochastic collocation methods on arbitrary sparse samples
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Abstract Not Provided
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Denoising is often addressed via sparse coding with respect to an overcomplete dictionary. There are two main approaches when the dictionary is composed of translates of an orthonormal basis. The first, traditionally employed by techniques such as wavelet cycle spinning, separately seeks sparsity w.r.t. each translate of the orthonormal basis, solving multiple partial optimizations and obtaining a collection of sparse approximations of the noise-free image, which are aggregated together to obtain a final estimate. The second approach, recently employed by convolutional sparse representations, instead seeks sparsity over the entire dictionary via a global optimization. It is tempting to view the former approach as providing a suboptimal solution of the latter. In this letter, we analyze whether global sparsity is a desirable property, and under what conditions the global optimization provides a better solution to the denoising problem. In particular, our experimental analysis shows that the two approaches attain comparable performance in case of natural images and global optimization outperforms the simpler aggregation of partial estimates only when the image admits an extremely sparse representation. Here, we explain this phenomenon by separately studying the bias and variance of these solutions, and by noting that the variance of the global solution increases very rapidly as the original signal becomes less and less sparse.
Several sparse-sample uncertainty quantification (UQ) methods are compared for conservative but not overly conservative estimation of small tail probabilities involving responses that lay beyond specified thresholds in the tails of probability distributions. Sixteen very differently shaped distributions (or probability density functions, PDFs) and tail probability magnitudes ranging from 10 -5 to 10 -1 are considered in order for the study to be relevant to a wide range of risk analysis and quantification of margins and uncertainty (QMU) problems. The emphasis of the study is on limited data regimes ranging from N = 2 to 20 samples, reflective of most experimental and some expensive computational situations. Relatively simple sparse-sample UQ methods tested for this regime involve statistical tolerance interval "Equivalent Normal and related "Ensemble of Normals" and "Superdistribution (SD) approaches. (The independently derived SD is effectively equivalent to the Bayesian posterior predictive distribution given the assumptions of the derivation.) The performance of the methods was generally improved for N ≥ 5 samples with a generalized Jackknife resampling technique, which determines a tail probability estimate by averaging estimates from smaller sub-samples. Several quantitative metrics for method conservatism and accuracy of tail probability estimation are used to assess and rank the methods' performance over many random trials for each test PDF and probability magnitude. A variant of Bootstrap resampling was also tried, but did not significantly improve tail probability estimates in most cases. Detailed results are presented from over 100-million tests over the above factors that provide useful granular information on which methods or combination of methods perform best in various areas of the factor space.
This paper extends our prior work on contextdependent piano transcription to estimate the length of the notes in addition to their pitch and onset. This approach employs convolutional sparse coding along with lateral inhibition constraints to approximate a musical signal as the sum of piano note waveforms (dictionary elements) convolved with their temporal activations. The waveforms are pre-recorded for the specific piano to be transcribed in the specific environment. A dictionary containing multiple waveforms per pitch is generated by truncating a long waveform for each pitch to different lengths. During transcription, the dictionary elements are fixed and their temporal activations are estimated and post-processed to obtain the pitch, onset and note length estimation. A sparsity penalty promotes globally sparse activations of the dictionary elements, and a lateral inhibition term penalizes concurrent activations of different waveforms corresponding to the same pitch within a temporal neighborhood, to achieve note length estimation. Experiments on the MAPS dataset show that the proposed approach significantly outperforms a state-of-the-art music transcription method trained in the same context-dependent setting in transcription accuracy.
Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.
Not Available
Climate-driven woody vegetation mortality is a defining feature of semiarid biomes that drives fundamental changes in ecosystem structure. However, the observed impacts of woody mortality on ecosystem-scale energy and water budgets and the responses of surviving vegetation are highly variable among studies in water-limited environments. A previous girdling manipulation experiment in a piñon-juniper woodland suggested that although ecosystem-scale evapotranspiration was not altered by large-scale piñon mortality, soil water content decreased and the surviving juniper experienced greater water stress than juniper in an undisturbed woodland. Here we experimentally explored to what extent mortality-induced changes in energy balance components can explain these results. We compared energy fluxes measured above two adjacent piñon-juniper woodlands where piñon girdling was implemented at one site and the other subsequently experienced large-scale natural piñon mortality. We found that the mortality-induced decrease in canopy area was not sufficient to alter surface reflectance, roughness, and partitioning between energy budget components at both sites. A radiative transfer model estimated that because of the sparse premortality canopy, surface reflectance is more sensitive to a large increase in understory leaf area than further loss of crown area. Increased water stress in the remaining juniper following both mortality events can be explained by an increase in radiation on the ground that promoted higher soil temperature and evaporation. We found similar responses of ecosystem and tree-level functions to both girdling and natural mortality. This suggests that girdling is an appropriate approach to explore the impact of tree mortality on ecosystem structure, function, and energy balance.
In this study, a new efficient uncertainty quantification technique, probabilistic collocation method (PCM) on sparse grid points is employed to enable the evaluation of uncertainty in state estimation. The PCM allows us to use just a small number of ensembles to quantify the uncertainty in estimating the state variables of power systems. By sparse grid points, the PCM approach can handle large number of uncertain parameters in power systems with relatively lower computational cost, when comparing with classic Monte Carlo (MC) simulations. The algorithm and procedure is outlined and we demonstrate the capability and illustrate the application of PCM on sparse grid points approach on uncertainty quantification in state estimation of the IEEE 14 bus model as an example. MC simulations have also been conducted to verify accuracy of the PCM approach. By comparing the results obtained from MC simulations with PCM results for mean and standard deviation of uncertain parameters, it is evident that the PCM approach is computationally more efficient than MC simulations.
This paper investigates covariance operator estimation via thresholding. For Gaussian random fields with approximately sparse covariance operators, we establish non-asymptotic bounds on the estimation error in terms of the sparsity level of the covariance and the expected supremum of the field. We prove that thresholded estimators enjoy an exponential improvement in sample complexity compared with the standard sample covariance estimator if the field has a small correlation lengthscale. As an application of the theory, we study thresholded estimation of covariance operators within ensemble Kalman filters.
Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements
The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. Here we present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore chooses shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation, and that these shifts can be used for multiple configurations within the same ensemble with no penalty to performance.
Statistical analysis of steady-state catalytic kinetic data is often limited by data sparsity due to the slow pace at which the data is collected. Data sparsity and limitations in statistical analysis make it difficult to differentiate between mechanistic models and catalytic sites. A Bayesian inference tool is reported for catalysis researchers to estimate error in the determination of reaction orders from steady state microreactor data. The benefits of a Bayesian inference approach are discussed, as an alternative to the more common frequentist approach. The approach incorporates prior knowledge of the system and the data collected to form an error estimate on reaction orders. We investigated the effects of three distinct data treatments—individual fitting of trials, pooled analysis, and constrained regression methods—on the precision and uncertainty of reaction order determinations. To assess the robustness of our findings, we conducted sensitivity analyses to evaluate the influence of Bayesian parameters on uncertainty estimation. Additionally, we utilized synthetic data to illustrate how data quality impacts the precision of uncertainty assessments. We show Bayesian analysis can obtain a more precise estimation of error with a sparse data set than a frequentist analysis. Finally, this work provides strong evidence that the adoption of Bayesian analysis of kinetic data may help researchers make more precise arguments as to the strength of their evidence for a particular mechanistic hypothesis, or in comparing across different catalysts.
A new method for measuring the large-scale structure of the Galactic magnetic field is presented. The Galactic magnetic field has been probed through the Galactic disk with near-infrared starlight polarimetry; however, the distance to each background star is unknown. Using red clump stars as near-infrared standard candles, this work presents the first attempt to decompose the line-of-sight structure of the sky-projected Galactic magnetic field. Two example lines of sight are decomposed: toward a field with many red clump stars and toward a field with few red clump stars. A continuous estimate of magnetic field orientation over several kiloparsecs of distance is possible in the field with many red clump stars, while only discrete estimates are possible in the sparse example. Toward the outer Galaxy, there is a continuous field orientation with distance that shows evidence of perturbation by the Galactic warp. Toward the inner Galaxy, evidence for a large-scale change in the magnetic field geometry is consistent with models of magnetic field reversals, independently derived from Faraday rotation studies. A photo-polarimetric method for identifying candidate intrinsically polarized stars is also presented. The future application of this method to large regions of the sky will begin the process of mapping the Galactic magnetic field in a way never before possible.
We present trigonometric parallax and proper motion measurements for two T-type brown dwarfs. We derive our measurements from infrared laser guide star adaptive optics observations spanning five years from the ShaneAO/SHARCS and NIRC2/medium-cam instruments on the Shane and Keck telescopes, respectively. To improve our astrometric precision, we measure and apply a distortion correction to our fields for both instruments. We also transform the Keck and ShaneAO astrometric reference frames onto the ICRS using five-parameter parallax and proper motion solutions for background reference stars from Gaia DR2. Fitting for parallax and proper motion, we measure parallaxes of 73.5 ± 9.2 mas and 70.1 ± 6.7 mas for WISEJ19010703+47181688 (WISE1901) and WISEJ21543294+59421370 (WISE2154), respectively. We utilize Monte Carlo methods to estimate the error in our sparse field methods, taking into account overfitting and differential atmospheric refraction. Comparing to previous measurements in the literature, all of our parallax and proper motion values fall within 2σ of the published measurements, and 4 of 6 measurements are within 1σ. These data are among the first parallax measurements of these T dwarfs and serve as precise measurements for calibrating stellar formation models. These two objects are the first results of an ongoing survey of T dwarfs with Keck/NIRC2 and the Shane Adaptive Optics system at Lick Observatory.