Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse selection”

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

A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

A Bayesian framework for adsorption energy prediction on bimetallic alloy catalysts

Abstract For high-throughput screening of materials for heterogeneous catalysis, scaling relations provides an efficient scheme to estimate the chemisorption energies of hydrogenated species. However, conditioning on a single descriptor ignores the model uncertainty and leads to suboptimal prediction of the chemisorption energy. In this article, we extend the single descriptor linear scaling relation to a multi-descriptor linear regression models to leverage the correlation between adsorption energy of any two pair of adsorbates. With a large dataset, we use Bayesian Information Criteria (BIC) as the model evidence to select the best linear regression model. Furthermore, Gaussian Process Regression (GPR) based on the meaningful convolution of physical properties of the metal-adsorbate complex can be used to predict the baseline residual of the selected model. This integrated Bayesian model selection and Gaussian process regression, dubbed as residual learning, can achieve performance comparable to standard DFT error (0.1 eV) for most adsorbate system. For sparse and small datasets, we propose an ad hoc Bayesian Model Averaging (BMA) approach to make a robust prediction. With this Bayesian framework, we significantly reduce the model uncertainty and improve the prediction accuracy. The possibilities of the framework for high-throughput catalytic materials exploration in a realistic setting is illustrated using large and small sets of both dense and sparse simulated dataset generated from a public database of bimetallic alloys available in Catalysis-Hub.org.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

WFC3 GRISM CONFIRMATION OF THE DISTANT CLUSTER Cl J1449+0856 AT (z) = 2.00: QUIESCENT AND STAR-FORMING GALAXY POPULATIONS

We present deep Hubble Space Telescope Wide Field Camera 3 (HST/WFC3) slitless spectroscopic observations of the distant cluster Cl J1449+0856. These cover a single pointing with 18 orbits of G141 spectroscopy and F140W imaging, allowing us to derive secure redshifts down to M{sub 140} ∼ 25.5 AB and 3σ line fluxes of ∼5 × 10{sup –18} erg s{sup –1} cm{sup –2}. In particular, we were able to spectroscopically confirm 12 early-type galaxies (ETGs) in the field up to z ∼ 3, 6 of which are in the cluster core, which represents the first direct spectroscopic confirmation of quiescent galaxies in a z = 2 cluster environment. With 140 redshifts in a ∼6 arcmin{sup 2} field, we can trace the spatial and redshift galaxy distribution in the cluster core and background field. We find two strong peaks at z = 2.00 and z = 2.07, where only one was seen in our previously published ground-based data. Due to the spectroscopic confirmation of the cluster ETGs, we can now reevaluate the redshift of Cl J1449+0856 at z = 2.00, rather than z = 2.07, with the background overdensity being revealed to be sparse and {sup s}heet{sup -}like. This presents an interesting case of chance alignment of two close yet unrelated structures, each one preferentially selected by different observing strategies. With 6 quiescent or early-type spectroscopic members and 20 star-forming ones, Cl J1449+0856 is now reliably confirmed to be at z = 2.00. The identified members can now allow for a detailed study of galaxy properties in the densest environment at z = 2.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimizing the Performance of Sparse-Matrix Vector Products on Next-Generation Processors

Matrix-vector products are ubiquitous in high-performance scientific applications and have a growing set of occurrences in advanced data analysis activities. Achieving high performance for these kernels is therefore paramount, in part, because these operations can consume vast amounts of application execution time. In this report we document the development of several sparse-matrix vector product kernel implementations using a variety of programming models and approaches. Each kernel is run on a broad set of matrices selected to demonstrate the wide variety of matrix structure and sparsity that is possible with a single, generic kernel. For benchmarking and performance analysis, we utilize leading computing architectures for the NNSA/ASC program including Intel's Knights Landing processor and IBM's POWER8.

97 MATHEMATICS AND COMPUTING↗

Conditional Karhunen-Loève expansion for uncertainty quantification and active learning in partial differential equation models

We use a conditional Karhunen-Lo` eve (KL) model to quantify and reduce uncertainty in a stochastic partial differential equation (SPDE) problem with partially-known space-dependent coefficient, Y (x). We assume that a small number of Y (x) measurements are available and model Y (x) with a KL expansion. We achieve reduction in uncertainty by conditioning the KL expansion coefficients on measurements. We consider two approaches for conditioning the KL expansion: In Approach 1, we condition the KL model first and then truncate it. In Approach 2, we first truncate the KL expansion and then condition it. We employ the conditional KL expansion together with Monte Carlo and sparse grid collocation methods to compute the moments of the solution of the SPDE problem. Uncertainty of the problem is further reduced by adaptively selecting additional observation locations using two active learning methods. Method 1 minimizes the variance of the PDE coefficient, while Method 2 minimizes the variance of the solution of the PDE. We demonstrate that conditioning leads to dimension reduction of the KL representation of Y (x). For a linear diffusion SPDE with uncertain log-normal coefficient, we show that Approach 1 provides a more accurate approximation of the conditional log-normal coefficient and solution of the SPDE than Approach 2 for the same number of random dimensions in a conditional KL expansion. Furthermore, Approach 2 provides a good estimate for the number of terms of the truncated KL expansion of the conditional field of Approach 1. Finally, we demonstrate that active learning based on Method 2 is more efficient for uncertainty reduction in the SPDE’s states (i.e., it leads to a larger reduction of the variance) than active learning using Method 2.

Conditioned Karhunen-Lo` eve expanion, machine lea↗

Characterization of the molten salt FMgNaK through ab initio molecular dynamics and experimental density measurements

The selection of a salt species for use in a molten salt reactor MSR is a key part of any MSR design. However, many salts have sparse or no thermophysical property data sets, especially those with higher melting points. One such salt is the eutectic mixture of (NaF)0.345(KF)0.59(MgF 2 )0.065, or FMgNaK, and is explored here through ab initio molecular dynamics (AIMD) simulation (1023-1273K) as well as experimental measurement of the liquid density using the Archimedean method (973-1223K). Predicted densities from AIMD are similar to experimentally-measured densities, though with more noise, suggesting that the small scale necessitated by AIMD simulations may be problematic for simulating FMgNaK in particular. Here the coefficient of thermal expansion is predicted from simulation, and salt structure is characterized. Mg-F-Mg chaining is observed in the salt network, though the low concentration of Mg inhibits chaining on the scale that is observed in (LiF) 0.67 (BeF 2 ) 0.33 , or FLiBe.

36 MATERIALS SCIENCE↗

MO-AB-BRA-10: Cancer Therapy Outcome Prediction Based On Dempster-Shafer Theory and PET Imaging

Purpose: In cancer therapy, utilizing FDG-18 PET image-based features for accurate outcome prediction is challenging because of 1) limited discriminative information within a small number of PET image sets, and 2) fluctuant feature characteristics caused by the inferior spatial resolution and system noise of PET imaging. In this study, we proposed a new Dempster-Shafer theory (DST) based approach, evidential low-dimensional transformation with feature selection (ELT-FS), to accurately predict cancer therapy outcome with both PET imaging features and clinical characteristics. Methods: First, a specific loss function with sparse penalty was developed to learn an adaptive low-rank distance metric for representing the dissimilarity between different patients’ feature vectors. By minimizing this loss function, a linear low-dimensional transformation of input features was achieved. Also, imprecise features were excluded simultaneously by applying a l2,1-norm regularization of the learnt dissimilarity metric in the loss function. Finally, the learnt dissimilarity metric was applied in an evidential K-nearest-neighbor (EK- NN) classifier to predict treatment outcome. Results: Twenty-five patients with stage II–III non-small-cell lung cancer and thirty-six patients with esophageal squamous cell carcinomas treated with chemo-radiotherapy were collected. For the two groups of patients, 52 and 29 features, respectively, were utilized. The leave-one-out cross-validation (LOOCV) protocol was used for evaluation. Compared to three existing linear transformation methods (PCA, LDA, NCA), the proposed ELT-FS leads to higher prediction accuracy for the training and testing sets both for lung-cancer patients (100+/−0.0, 88.0+/−33.17) and for esophageal-cancer patients (97.46+/−1.64, 83.33+/−37.8). The ELT-FS also provides superior class separation in both test data sets. Conclusion: A novel DST- based approach has been proposed to predict cancer treatment outcome using PET image features and clinical characteristics. A specific loss function has been designed for robust accommodation of feature set incertitude and imprecision, facilitating adaptive learning of the dissimilarity metric for the EK-NN classifier.

60 APPLIED LIFE SCIENCES↗

ANALYSIS OF VARIANCE-BASED MIXED MULTISCALE FINITE ELEMENT METHOD AND APPLICATIONS IN STOCHASTIC TWO-PHASE FLOWS

The stochastic partial differential systems have been widely used to model physical processes, where the inputs involve large uncertainties. Flows in random and heterogeneous porous media is one of the cases where the random inputs (e.g., permeability) are often modeled as a stochastic field with high-dimensional random parameters. To treat the high dimensionality and heterogeneity efficiently, model reduction is employed in both stochastic space and physical space. An analysis of variance (ANOVA)-based mixed multiscale finite element method MsFEM) is developed to decompose the high-dimensional stochastic problem into a set of lower-dimensional stochastic subproblems, which require much less computational complexity and significantly reduce the computational cost in stochastic space, and the mixed MsFEM can capture the heterogeneities on a coarse grid to greatly reduce the computational cost in the spatial domain. In addition, to enhance the efficiency of the traditional ANOVA method, an adaptive ANOVA method based on a new adaptive criterion is developed, where the most active dimensions can be selected to greatly reduce the computational cost before conducting ANOVA decomposition. This novel adaptive criterion is based on variance-decomposition method coupled with sparse-grid probabilistic collocation method or multilevel Monte Carlo method. The advantage of this adaptive criterion lies in its much lower computational overhead for identifying the active dimensions and interactions. A number of numerical examples in two-phase stochastic flows are presented and demonstrate the accuracy and performance of the adaptive ANOVA-based mixed Ms-FEM.

Wei, Jia↗

A Comparative Study of Multi-material Data Structures for Computational Physics Applications

The data structures used to represent the multi-material state of a computational physics application can have a drastic impact on the performance of the application. We look at efficient data structures for sparse applications where there may be many materials, but only one or few in most computational cells. We develop simple performance models for use in selecting possible data structures and programming patterns. We verify the analytic models of performance through a small test program of the representative cases.

97 MATHEMATICS AND COMPUTING↗

Multiprocessor sparse L/U decomposition with controlled fill-in

Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed.

Alaghband, G.↗

Spray: Sparse Reductions of Arrays in OPEN MP

We present SPRAY, an open-source header-only C++ library for sparse reductions of arrays. SPRAY is meant for applications in which a large array is collaboratively updated by multiple threads using an associative and commutative operation such as +=. Especially when each thread accesses only parts of the array, SPRAY can perform significantly better than OPENMP's built-in reduction clause or atomic updates, while also using less memory than the former. SPRAY provides both an easy-to-use interface that can serve as a drop-in replacement for OPENMP reductions and a selection of reducer objects that accumulate the final result in different thread-safe ways. We demonstrate SPRAY through multiple test cases including the LULESH shock hydrodynamics code and a transpose-matrix-vector multiplication for sparse matrices stored in CSR format. SPRAY reductions outperform built-in OPENMP reductions consistently, in some cases improving run time and memory overhead by 20X, and even beating domain-specific approaches such as Intel MKI, by over 2X in some cases. Furthermore, SPRAY reductions have a minimal impact on the code base, requiring only a few lines of source code changes. Once in place, SPRAY reduction schemes can be switched easily, allowing performance portability and tuning opportunities by separating performance-critical implementation details from application code.

OpenMP↗

Nonlinear sparse Bayesian learning for physics-based models

This paper addresses the issue of overfitting while calibrating unknown parameters of over-parameterized physics-based models with noisy and incomplete observations. Here, a semi-analytical Bayesian framework of nonlinear sparse Bayesian learning (NSBL) is proposed to identify sparsity among model parameters during Bayesian inversion. NSBL offers significant advantages over machine learning algorithm of sparse Bayesian learning (SBL) for physics-based models, such as 1) the likelihood function or the posterior parameter distribution is not required to be Gaussian, and 2) prior parameter knowledge is incorporated into sparse learning (i.e. not all parameters are treated as questionable). NSBL employs the concept of automatic relevance determination (ARD) to facilitate sparsity among questionable parameters through parameterized prior distributions. The analytical tractability of NSBL is enabled by employing Gaussian ARD priors and by building a Gaussian mixture-model approximation of the posterior parameter distribution that excludes the contribution of ARD priors. Subsequently, type-II maximum likelihood is executed using Newton's method whereby the evidence and its gradient and Hessian information are computed in a semi-analytical fashion. We show numerically and analytically that SBL is a special case of NSBL for linear regression models. Subsequently, a linear regression example involving multimodality in both parameter posterior pdf and model evidence is considered to demonstrate the performance of NSBL in cases where SBL is inapplicable. Next, NSBL is applied to identify sparsity among the damping coefficients of a mass-spring-damper model of a shear building frame. These numerical studies demonstrate the robustness and efficiency of NSBL in alleviating overfitting during Bayesian inversion of nonlinear physics-based models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗

Interior soft x-ray tomography with sparse global sampling

To investigate the feasibility of interior imaging reconstruction in soft X-ray tomography for higher-resolution cellular imaging, including whole-cell imaging, we develop an alignment and reconstruction algorithm that combines a small number of sparse whole-cell images with a high-resolution local interior scan. Based on numerical simulations, we demonstrate that combined reconstructions mitigate the depth-of-field limitation in high-resolution scans, enable radiation dose optimization, and yield quantitative X-ray absorption values with sparse sampling. We further validate our numerical approach using experimental data from two different cell types and show that the combined reconstruction reliably provides high spatial resolution within an interior region of interest of a whole cell. The resulting sparse reconstruction framework offers robust, faithful visualization of cellular organelles in soft X-ray tomography. This mesoscale imaging strategy allows one to ‘scout’ and zoom into selected subcellular volumes of interest, enabling increased spatial resolution without sacrificing larger-volume imaging and providing information on the relative positions of all organelles within a cell.

3D imaging↗

An Edge Alignment-Based Orientation Selection Method for Neutron Tomography

Neutron computed tomography (nCT) is a 3D char-acterization technique used to image the internal morphology or chemical composition of samples in biology and materials sciences. A typical workflow involves placing the sample in the path of a neutron beam, acquiring projection data at a predefined set of orientations, and processing the resulting data using an analytic reconstruction algorithm. Typical nCT scans require hours to days to complete and are then processed using conventional filtered back-projection (FBP), which performs poorly with sparse views or noisy data. Hence, the main methods in order to reduce overall acquisition time are the use of an improved sampling strategy combined with the use of advanced reconstruction methods such as model-based iterative reconstruction (MBIR). In this paper, we propose an adaptive orientation selection method in which an MBIR reconstruction on previously-acquired measurements is used to define an objective function on orientations that balances a data-fitting term promoting edge alignment and a regularization term promoting orientation diversity. Using simulated and experimental data, we demonstrate that our method produces high-quality reconstructions using significantly fewer total measurements than the conventional approach.

Yang, Diyu↗

Lyman continuum leaker candidates among highly ionised, low-redshift dwarf galaxies selected from He II

Contemporary research suggests that the reionisation of the intergalactic medium (IGM) in the early Universe was predominantly realised by star-forming (proto-)galaxies (SFGs). Due to observational constraints, our knowledge on the origins of sufficient amounts of ionising Lyman continuum (LyC) photons and the mechanisms facilitating their transport into the IGM remains sparse. Recent efforts have thus focussed on the study of local analogues to these high-redshift objects. We aim to acquire a set of very low-redshift SFGs that exhibit signs of a hard radiation field being present. A subsequent analysis of their emission line properties is intended to shed light on how the conditions prevalent in these objects compare to those predicted to be present in early SFGs that are thought to be LyC emitters (LCEs). We used archival spectroscopic SDSS DR12 data to select a sample of low-redshift He II 4686 emitters and restricted it to a set of SFGs with an emission line diagnostic sensitive to the presence of an active galactic nucleus, which serves as our only selection criterion. We performed a population spectral synthesis with FADO to reconstruct these galaxies’ star-formation histories (SFHs). Utilising the spectroscopic information at hand, we constrained the predominant ionisation mechanisms in these galaxies and inferred information on interstellar medium (ISM) conditions relevant for the escape of LyC radiation. Our final sample consists of eighteen ionised, metal-poor galaxies (IMPs). These low-mass (6.2 ≤ log(M * /M ⊙ ) ≤ 8.8), low-metallicity (7.54 ≤log(O/H) + 12 ≤ 8.13) dwarf galaxies appear to be predominantly ionised by stellar sources. We find large [OIII] 5007/[OII] 3727 ratios and [SII] 6717,6731/Hα deficiencies, which provide strong indications for these galaxies to be LCEs. At least 40% of these objects are candidates for featuring cosmologically significant LyC escape fractions ≳10%. The IMPs’ SFHs exhibit strong similarities and almost all galaxies appear to contain an old (> 1 Gyr) stellar component, while also harbouring a young, two-stage (~10 Myr and < 1 Myr) starburst, which we speculate might be related to LyC escape. The properties of the compact emission line galaxies presented here align well with those observed in many local LCEs. In fact, our sample may prove as an extension to the rather small catalogue of local LCEs, as the extreme ISM conditions we find are assumed to facilitate LyC leakage. Notably, all of our eighteen candidates are significantly closer (z < 0.1) than most established LCEs. If the inferred LyC photon loss is genuine, this demonstrates that selecting SFGs from He II 4686 is a powerful selection criterion in the search for LCEs.

79 ASTRONOMY AND ASTROPHYSICS↗

Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor

It is shown that in sparse matrices arising from electronic circuits, it is possible to do computations on many diagonal elements simultaneously. A technique for obtaining an ordered compatible set directly from the ordered incompatible table is given. The ordering is based on the Markowitz number of the pivot candidates. This technique generates a set of compatible pivots with the property of generating few fills. A novel heuristic algorithm is presented that combines the idea of an order-compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. An elimination set for reducing the matrix is generated and selected on the basis of a minimum Markowitz sum number. The parallel pivoting technique presented is a stepwise algorithm and can be applied to any submatrix of the original matrix. Thus, it is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices using the HEP multiprocessor (Kowalik, 1985) are presented and analyzed.

Alaghband, Gita↗

Selective Dynamical Imaging of Interferometric Data

Recent developments in very long baseline interferometry (VLBI) have made it possible for the Event Horizon Telescope (EHT) to resolve the innermost accretion flows of the largest supermassive black holes on the sky. The sparse nature of the EHT’s (u, v)-coverage presents a challenge when attempting to resolve highly time-variable sources. We demonstrate that the changing (u, v)-coverage of the EHT can contain regions of time over the course of a single observation that facilitate dynamical imaging. These optimal time regions typically have projected baseline distributions that are approximately angularly isotropic and radially homogeneous. We derive a metric of coverage quality based on baseline isotropy and density that is capable of ranking array configurations by their ability to produce accurate dynamical reconstructions. We compare this metric to existing metrics in the literature and investigate their utility by performing dynamical reconstructions on synthetic data from simulated EHT observations of sources with simple orbital variability. We then use these results to make recommendations for imaging the 2017 EHT Sgr A* data set.

79 ASTRONOMY AND ASTROPHYSICS↗