Regression-based projection for learning Mori-Zwanzig operators
Explore the source record for details and available documents.
Computer Science↗
SEARCH · Engineering Papers
Results for “approximate projection method”
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.
Operator inference for non-intrusive model reduction with quadratic manifolds
This paper proposes a novel approach for learning a data-driven quadratic manifold from high-dimensional data, then employing this quadratic manifold to derive efficient physics-based reduced-order models. The key ingredient of the approach is a polynomial mapping between high-dimensional states and a low-dimensional embedding. This mapping consists of two parts: a representation in a linear subspace (computed in this work using the proper orthogonal decomposition) and a quadratic component. The approach can be viewed as a form of data-driven closure modeling, since the quadratic component introduces directions into the approximation that lie in the orthogonal complement of the linear subspace, but without introducing any additional degrees of freedom to the low-dimensional representation. Combining the quadratic manifold approximation with the operator inference method for projection-based model reduction leads to a scalable non-intrusive approach for learning reduced-order models of dynamical systems. Further, applying the new approach to transport-dominated systems of partial differential equations illustrates the gains in efficiency that can be achieved over approximation in a linear subspace.
42 ENGINEERING↗
Two-Stage Reduction Of Dynamical Models
No longer necessary to solve eigenvalue problems of high order. Component-mode projection-and-assembly model-reduction (COMPARE) method provides approximation of dynamics of vibrations of complicated, multiple flexible bodies by use of mathematical models of reduced order. Incorporates component-mode synthesis (CMS) method and enhanced projection-and-assembly (EP&A) method, described in "Enhanced Method of Reduction of Dynamical Models" (NPO-18402), providing for somewhat simplified two-stage process in which order of applicable mathematical models reduced. Reduced-order models used to design algorithms of control systems to suppress vibrations or otherwise control structure.
Lee, Allan Y.↗
Projection pursuit adaptation on polynomial chaos expansions
Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.
97 MATHEMATICS AND COMPUTING↗
Predicting U 3 O 8 powder processing conditions: An AI/ML approach analyzing deep learning embeddings of SEM micrographs
High-resolution SEM images of uranium-oxide powders encode micro- and nanoscale clues to their synthesis route and calcination temperature. We trained a ResNet-50 model on 11 commercial-scale U₃O₈ classes, ammonium diuranate (ADU) or uranyl peroxide (H₂O₂) precursors calcined at temperatures ranging from 400 to 750 °C and added a 256-D projection head before the classifier to analyze the learned representation. The best of eight seeds reached 92.4 % accuracy on reserved testing data, but our focus is the structure of the embedding space rather than the accuracy and labels. We quantify class relatedness in the original 256-D space using centroid similarity and distributional distances, and we use Uniform Manifold Approximation Projection (UMAP) for visualization. ‘Unknown’ images from different preparation methods, SEM operators, and from the literature localized near the expected classes under a nearest-centroid analysis without retraining, as well as clustered in similar UMAP space. In conclusion, this embedding-centered workflow complements black-box classification by providing quantitative, similarity-based comparisons of U₃O₈ morphologies and reduces storage space by up to 98 % for image data used in millisecond vector search comparisons.
36 MATERIALS SCIENCE↗
Probabilistic Reasoning for Plan Robustness
A planning system must reason about the uncertainty of continuous variables in order to accurately project the possible system state over time. A method is devised for directly reasoning about the uncertainty in continuous activity duration and resource usage for planning problems. By representing random variables as parametric distributions, computing projected system state can be simplified in some cases. Common approximation and novel methods are compared for over-constrained and lightly constrained domains. The system compares a few common approximation methods for an iterative repair planner. Results show improvements in robustness over the conventional non-probabilistic representation by reducing the number of constraint violations witnessed by execution. The improvement is more significant for larger problems and problems with higher resource subscription levels but diminishes as the system is allowed to accept higher risk levels.
autonomous planning↗
Sky and Elemental Planetary Mapping Via Gamma Ray Emissions
Low-energy gamma ray emissions ((is) approximately 30keV to (is) approximately 30MeV) are significant to astrophysics because many interesting objects emit their primary energy in this regime. As such, there has been increasing demand for a complete map of the gamma ray sky, but many experiments to do so have encountered obstacles. Using an innovative method of applying the Radon Transform to data from BATSE (the Burst And Transient Source Experiment) on NASA's CGRO (Compton Gamma-Ray Observatory) mission, we have circumvented many of these issues and successfully localized many known sources to 0.5 - 1 deg accuracy. Our method, which is based on a simple 2-dimensional planar back-projection approximation of the inverse Radon transform (familiar from medical CAT-scan technology), can thus be used to image the entire sky and locate new gamma ray sources, specifically in energy bands between 200keV and 2MeV which have not been well surveyed to date. Samples of these results will be presented. This same technique can also be applied to elemental planetary surface mapping via gamma ray spectroscopy. Due to our method's simplicity and power, it could potentially improve a current map's resolution by a significant factor.
BATSE (the Burst and Transient Source Experiment)↗
Detection and avoidance of errors in computer software
The acceptance test errors of a computer software project to determine if the errors could be detected or avoided in earlier phases of development. GROAGSS (Gamma Ray Observatory Attitude Ground Support System) was selected as the software project to be examined. The development of the software followed the standard Flight Dynamics Software Development methods. GROAGSS was developed between August 1985 and April 1989. The project is approximately 250,000 lines of code of which approximately 43,000 lines are reused from previous projects. GROAGSS had a total of 1715 Change Report Forms (CRFs) submitted during the entire development and testing. These changes contained 936 errors. Of these 936 errors, 374 were found during the acceptance testing. These acceptance test errors were first categorized into methods of avoidance including: more clearly written requirements; detail review; code reading; structural unit testing; and functional system integration testing. The errors were later broken down in terms of effort to detect and correct, class of error, and probability that the prescribed detection method would be successful. These determinations were based on Software Engineering Laboratory (SEL) documents and interviews with the project programmers. A summary of the results of the categorizations is presented. The number of programming errors at the beginning of acceptance testing can be significantly reduced. The results of the existing development methodology are examined for ways of improvements. A basis is provided for the definition is a new development/testing paradigm. Monitoring of the new scheme will objectively determine its effectiveness on avoiding and detecting errors.
Kinsler, Les↗
Alternative regularizations for Outer-Approximation algorithms for convex MINLP
In this work, we extend the regularization framework from Kronqvist et al. (Math Program 180(1):285–310, 2020) by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance metrics and Lagrangean approximations, used in the projection problem for finding new integer combinations to be used within the Outer-Approximation (OA) method. The new approach, called Regularized Outer-Approximation (ROA), has been implemented as part of the open-source Mixed-integer nonlinear decomposition toolbox for Pyomo—MindtPy. We compare the OA method with seven regularization function alternatives for ROA. Moreover, we extend the LP/NLP Branch and Bound method proposed by Quesada and Grossmann (Comput Chem Eng 16(10–11):937–947, 1992) to include regularization in an algorithm denoted RLP/NLP. We provide convergence guarantees for both ROA and RLP/NLP. Finally, we perform an extensive computational experiment considering all convex MINLP problems in the benchmark library MINLPLib. The computational results show clear advantages of using regularization combined with the OA method.
Convex Mixed-integer nonlinear programming↗
Nucleon-pair truncation of the shell model for medium-heavy nuclei
Background: Establishing computationally tractable models of atomic nuclei is a long-time goal of nuclear structure physics. A flexible framework which easily includes excited states and many-body correlations is the configuration-interaction shell model (SM), but the exponential growth of the basis means one needs an efficient truncation scheme, ideally one that includes both deformation and pairing correlations. Purpose: Here, we propose an efficient truncation scheme of the SM: starting from a pair condensate variationally defined by Hartree-Fock single-particle states and the particle-number conserved Bardeen-Cooper-Schrieffer (NBCS) approximation, we carry out projection of states with good angular momentum. Methods: After generating Hartree-Fock single-particle states with Kramers degeneracy in a SM space, we optimize the pair amplitudes in the NBCS by minimizing the energy, and then use linear algebra projection (LAP) of states with good angular momentum. Both NBCS and LAP are computationally fast. Results: Our calculations yield good agreement with full configuration-interaction SM calculations for low-lying states of transitional and rotational nuclei with axially symmetric and triaxial deformation in medium- and heavy-mass regions: 44,46,48 Ti, 48,50 Cr, 52 Fe, 60,62,64 Zn, 66,68 Ge, 68 Se, and 108,110 Xe. We predict low-lying states of 112–114 Ba and 116–120 Ce, nuclei difficult to reach by large-scale SM calculations. Conclusions: Both pair correlation and the configuration mixing between different intrinsic states play a key role in reproducing collectivity and shape coexistence, demonstrating the utility of this truncation scheme of the SM to study transitional and deformed nuclei.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking
In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. Finally, more importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.
97 MATHEMATICS AND COMPUTING↗
Investigating Detection Methods for Cross-Agency Code Use
The goal of this project is to approximate how many government-sourced code repositories are being reused by other federal agencies.
Evan Taylor Yates↗
Comparing different generations of idealized solar geoengineering simulations in the Geoengineering Model Intercomparison Project (GeoMIP)
Abstract. Solar geoengineering has been receiving increased attention in recent years as a potential temporary solution to offset global warming. One method of approximating global-scale solar geoengineering in climate models is via solar reduction experiments. Two generations of models in the Geoengineering Model Intercomparison Project (GeoMIP) have now simulated offsetting a quadrupling of the CO2 concentration with solar reduction. This simulation is idealized and designed to elicit large responses in the models. Here, we show that energetics, temperature, and hydrological cycle changes in this experiment are statistically indistinguishable between the two ensembles. Of the variables analyzed here, the only major differences involve highly parameterized and uncertain processes, such as cloud forcing or terrestrial net primary productivity. We conclude that despite numerous structural differences and uncertainties in models over the past two generations of models, including an increase in climate sensitivity in the latest generation of models, the models are consistent in their aggregate climate response to global solar dimming.
54 ENVIRONMENTAL SCIENCES↗
Metals and Quantum Materials with Spin-orbit Interactions by Quantum Monte Carlo methods
The key goals of this project were as follows: 1) Analysis and benchmarks of electron correlation effects recovered in the fixed-node approximation that is inherent to quantum Monte Carlo (QMC) method as applied to metallic states; 2) development of new algorithms for electron spin-degrees of freedom to be treated as explicit quantum variables; 3) designing electronic structure QMC algorithm for efficient evaluation of spin-orbit effects in systems with heavy atoms; 4) adapting the algorithm to complex wave functions and developing corresponding fixed-phase approximation; 5) design and testing of algorithm for valence-only non-local spin-orbit operators; 6) analysis of fixed-node vs fixed-phase errors and their comparisons. The key accomplishments: i) We carried out a systematic study of Li systems by the fixed-node diffusion Monte Carlo method. This involved Li atom, molecule, cluster and solid calculated by the full range of QMC methods including fixed-node QMC.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Rotational excitations in rare-earth nuclei: A comparative study within three cranking models with different mean fields and treatments of pairing correlations
High-spin rotational bands in rare-earth Er (Z = 68), Tm (Z = 69), and Yb (Z = 70) isotopes are investigated by three different nuclear models. These are (i) the cranked relativistic Hartree-Bogoliubov (CRHB) approach with approximate particle number projection by means of the Lipkin-Nogami (LN) method, (ii) the cranking covariant density functional theory (CDFT) with pairing correlations treated by a shell-model-like approach (SLAP) or the so-called particle-number conserving (PNC) method, and (iii) cranked shell model (CSM) based on the Nilsson potential with pairing correlations treated by the PNC method. A detailed comparison between these three models in the description of the ground-state rotational bands of even-even Er and Yb isotopes is performed. The similarities and differences between these models in the description of the moments of inertia, the features of band crossings, and equilibrium deformations and pairing energies of the even-even nuclei under study are discussed. These quantities are considered as a function of rotational frequency and proton and neutron numbers. The changes in the properties of the first band crossings with increasing neutron number in this mass region are investigated. On average, a comparable accuracy of the description of available experimental data is achieved in these models. However, the differences between model predictions become larger above the first band crossings. Because of the time-consuming nature of numerical calculations in the CDFT-based models, a systematic study of the rotational properties of both ground-state and excited-state bands in odd-mass Tm nuclei is carried out only by the PNC-SCM. With few exceptions, the rotational properties of experimental 1-quasiparticle and 3-quasiparticle bands in 165,167,169,171 Tm are reproduced reasonably well. As a result, the appearance of backbendings or upbendings in these nuclei is well understood from the analysis of the variations of the occupation probabilities of the single-particle states and their contributions to total angular momentum alignment with rotational frequency.
150 ≤ A ≤ 189↗
Rate coefficients for the excitation of infrared and ultraviolet lines in C II, N III, and O IV
New and improved collision strengths and Maxwellian-averaged rate coefficients for temperatures between 1000 and 40,000 K are presented for all the prominent transitions in the spectra of C II, N III, and O IV. The collision strengths show extensive autoionization structures that are delineated in detail and which enhance the rate coefficients for several transitions by a considerable amount. Maxwellian-averaged collision strengths are calculated for all possible fine-structure transitions along the states included in the eigenfunction expansion of the target ion. All calculations are carried out in the close-coupling approximation using the R-matrix method as adapted for the Opacity Project.
Blum, Robert D.↗
A machine learning decision criterion for reducing scan time for hyperspectral neutron computed tomography systems
We present the first machine learning-based autonomous hyperspectral neutron computed tomography experiment performed at the Spallation Neutron Source. Hyperspectral neutron computed tomography allows the characterization of samples by enabling the reconstruction of crystallographic information and elemental/isotopic composition of objects relevant to materials science. High quality reconstructions using traditional algorithms such as the filtered back projection require a high signal-to-noise ratio across a wide wavelength range combined with a large number of projections. This results in scan times of several days to acquire hundreds of hyperspectral projections, during which end users have minimal feedback. To address these challenges, a golden ratio scanning protocol combined with model-based image reconstruction algorithms have been proposed. This novel approach enables high quality real-time reconstructions from streaming experimental data, thus providing feedback to users, while requiring fewer yet a fixed number of projections compared to the filtered back projection method. In this paper, we propose a novel machine learning criterion that can terminate a streaming neutron tomography scan once sufficient information is obtained based on the current set of measurements. Our decision criterion uses a quality score which combines a reference-free image quality metric computed using a pre-trained deep neural network with a metric that measures differences between consecutive reconstructions. The results show that our method can reduce the measurement time by approximately a factor of five compared to a baseline method based on filtered back projection for the samples we studied while automatically terminating the scans.
97 MATHEMATICS AND COMPUTING↗
A review on recent machine learning applications for imaging mass spectrometry studies
Imaging mass spectrometry (IMS) is a powerful analytical technique widely used in biology, chemistry, and materials science fields that continue to expand. IMS provides a qualitative compositional analysis and spatial mapping with high chemical specificity. The spatial mapping information can be 2D or 3D depending on the analysis technique employed. Due to the combination of complex mass spectra coupled with spatial information, large high-dimensional datasets (hyperspectral) are often produced. Therefore, the use of automated computational methods for an exploratory analysis is highly beneficial. The fast-paced development of artificial intelligence (AI) and machine learning (ML) tools has received significant attention in recent years. These tools, in principle, can enable the unification of data collection and analysis into a single pipeline to make sampling and analysis decisions on the go. There are various ML approaches that have been applied to IMS data over the last decade. Here, in this review, we discuss recent examples of the common unsupervised (principal component analysis, non-negative matrix factorization, k-means clustering, uniform manifold approximation and projection), supervised (random forest, logistic regression, XGboost, support vector machine), and other methods applied to various IMS datasets in the past five years. The information from this review will be useful for specialists from both IMS and ML fields since it summarizes current and representative studies of computational ML-based exploratory methods for IMS.
47 OTHER INSTRUMENTATION↗