Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generative learning”

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 19 records

Learning generative neural networks with physics knowledge

Deep generative neural networks have enabled modeling complex distributions, but incorporating physics knowledge into the neural networks is still challenging and is at the core of current physics-based machine learning research. To this end, we propose a physics generative neural network (PhysGNN), a new class of generative neural networks for learning unknown distributions in a physical system described by partial differential equations (PDE). PhysGNN couples PDE systems with generative neural networks. It is a fully differentiable model that allows back-propagation of gradients through both numerical PDE solvers and generative neural networks, and is trained by minimizing the discrete Wasserstein distance between generated and observed probability distributions of the PDE outputs using the stochastic gradient descent method. Moreover, PhysGNN does not require adversarial training like standard generative neural networks, which offers better stability than adversarial training. We show that PhysGNN can learn complex distributions in stochastic inverse problems, where conventional methods such as maximum likelihood estimation and momentum matching methods may be inapplicable when little knowledge is known about the form of unknown distributions or the physical model is too complex. Furthermore, our method allows physics-based generative neural network training for learning complex distributions in the context of differential equations.

97 MATHEMATICS AND COMPUTING↗

Inferring the Isotropic-Nematic Phase Transition with Generative Machine Learning

Generative machine learning models are capable of learning the phase behavior in condensed matter systems such as the Ising model. We utilize a score-based modeling procedure called thermodynamic maps to describe the isotropic-nematic phase transition in a melt of Gay-Berne ellipsoids. When trained on samples from a single temperature on either side of the phase transition, this generative machine learning approach infers effectively the nematic order parameter at intermediate temperatures. Furthermore, these results demonstrate score-based models’ ability to learn the physics of a nontrivial liquid crystal phase transition.

Critical exponents↗

Deep generative learning of magnetic frustration in artificial spin ice from magnetic force microscopy images

Increasingly large datasets of microscopic images with nanoscale resolution facilitate the development of machine learning methods to identify and analyze subtle physical phenomena embedded within the images. In this work, microscopic images of honeycomb lattice spin-ice samples serve as datasets from which we automate the calculation of net magnetic moments and directional orientations of spin-ice configurations. In the first stage of our workflow, machine learning models are trained to accurately predict magnetic moments and directions within spin-ice structures. Variational Autoencoders (VAEs), an emergent unsupervised deep learning technique, are employed to generate high-quality synthetic magnetic force microscopy (MFM) images and extract latent feature representations, thereby reducing experimental and segmentation errors. The second stage of proposed methodology enables precise identification and prediction of frustrated vertices and nanomagnetic segments, effectively correlating structural and functional aspects of microscopic images. This facilitates the design of optimized spin-ice configurations with controlled frustration patterns, enabling potential on-demand synthesis.

36 MATERIALS SCIENCE↗

Exascale granular microstructure reconstruction in 3D volumes of arbitrary geometries with generative learning

Reconstructing 3D granular microstructures within volumes of arbitrary geometries from limited 2D image data is crucial for predicting the material properties, as well as performances of structural components accounting for material microstructural effects. We present a novel generative learning framework that enables exascale reconstruction of granular microstructures within complex 3D geometric volumes. Building upon existing transfer learning techniques using pre-trained convolutional neural networks (CNN), we introduce several key innovations to overcome the difficulties inherent in arbitrary geometries. Our framework incorporates periodic boundary conditions using circular padding techniques, ensuring continuity and representativeness of the reconstructed microstructures. We also introduce a novel seamless transition reconstruction (STR) method that creates statistically equivalent transition zones to integrate multiple pre-existing 3D microstructure volumes. Based on STR, we propose a cost-effective strategy for reconstructing microstructures within complex geometric volumes, minimizing computational waste. Validation through numerical experiments using kinetic Monte Carlo simulations demonstrates accurate reproduction of grain statistics, including grain size distributions and morphology. A case study involving the reconstruction of a 4-blade propeller microstructure illustrates the method’s capability to efficiently handle complex geometries. In conclusion, the proposed framework significantly reduces computational demands while maintaining high reconstruction quality, paving the way for scalable microstructure reconstruction in materials design and analysis.

36 MATERIALS SCIENCE↗

Accelerating kinetic plasma simulations with machine-learning-generated initial conditions

Computational models of plasma technologies often solve for the system operating conditions by time-stepping an initial value problem to a quasi-steady solution. However, the strongly nonlinear and multi-timescale nature of plasma dynamics often necessitate millions, or even hundreds of millions, of steps to reach convergence, reducing the effectiveness of these simulations for computer-aided engineering. We consider acceleration of kinetic plasma simulations via data-driven machine-learning-generated initial conditions, which initialize the simulations close to their final quasi-steady-state, thereby reducing the number of steps to reach convergence. Three machine-learning models are developed to predict the density and ion kinetic profiles of capacitively coupled plasma discharges relevant to the microelectronics industry. The models are trained on kinetic simulations over a range of device operating frequencies and pressures. Best performance was observed when simulations were initialized with ion kinetic profiles generated by a convolutional neural network, reducing the mean number of steps to reach convergence by 17.1× when compared to initialization with a zero-dimensional global model. We also outline a workflow for continuous data-driven model improvement and simulation speedup, with the aim of generating sufficient data for full device digital twins.

Artificial neural networks↗

Generative learning of densities on manifolds

A generative modeling framework is proposed that combines diffusion models and manifold learning to efficiently sample data densities on manifolds. The approach utilizes Diffusion Maps to uncover possible low-dimensional underlying (latent) spaces in the high-dimensional data (ambient) space. Two approaches for sampling from the latent data density are described. The first is a score-based diffusion model, which is trained to map a standard normal distribution to the latent data distribution using a neural network. The second one involves solving an Itô stochastic differential equation in the latent space. Additional realizations of the data are generated by lifting the samples back to the ambient space using Double Diffusion Maps , a recently introduced technique typically employed in studying dynamical system reduction; here the focus lies in sampling densities rather than system dynamics. The proposed approaches enable sampling high dimensional data densities restricted to low-dimensional, a priori unknown manifolds. The efficacy of the proposed framework is demonstrated through a benchmark problem and a material with multiscale structure.

Double diffusion maps↗

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗

Ligand- and Structure-Based Analysis of Deep Learning-Generated Potential α2a Adrenoceptor Agonists

The α2a adrenoceptor is a particularly medically relevant subtype of the G protein-couple receptor family. Unfortunately, high-throughput techniques aimed at producing novel drug leads targeted to this receptor have been largely unsuccessful due to the complex pharmacology of adrenergic receptors. As such, cutting-edge in silico ligand- and structure-based assessment and de novo deep learning methods are well-positioned to provide new insights into protein-ligand interactions and potential active compounds. In this work, we (i) collect a dataset of α2a adrenoceptor agonists and provide it as a resource for the drug design community; (ii) use the dataset as a basis to generate candidate active structures via deep learning; and (iii) apply computational ligand- and structure-based analysis techniques to gain new insight into α2a adrenoceptor agonists and assess the quality of the computer-generated compounds. Additionally, we further describe how such assessment techniques can be applied to putative chemical probes with a case study involved proposed medetomidine-based probes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Searching for Strongly Coupled Dark Sectors with Unsupervised and Generative Learning

Recipient of the URA Early Career Award for groundbreaking searches for dark matter arising from strongly coupled dark sectors with the CMS detector, pioneering work in ML-based model-independent anomaly detection for collider and astrophysics experiments, and leadership in the development of new AI/ML techniques to improve event reconstruction and detector simulation in particle physics, as well as novel strategies to accelerate AI inference and throughput with heterogeneous computing using coprocessors as a service.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient six-dimensional phase space reconstructions from experimental measurements using generative machine learning

Next-generation accelerator concepts, which hinge on the precise shaping of beam distributions, demand equally precise diagnostic methods capable of reconstructing beam distributions within six-dimensional position-momentum spaces. However, the characterization of intricate features within six-dimensional beam distributions using current diagnostic techniques necessitates a substantial number of measurements, using many hours of valuable beam time. Novel phase space reconstruction techniques are needed to reduce the number of measurements required to reconstruct detailed, high-dimensional beam features in order to resolve complex beam phenomena and as a feedback in precision beam shaping applications. In this study, we present a novel approach to reconstructing detailed six-dimensional phase space distributions from experimental measurements using generative machine learning and differentiable beam dynamics simulations. We demonstrate that this approach can be used to resolve six-dimensional phase space distributions from scratch, using basic beam manipulations and as few as 20 two-dimensional measurements of the beam profile. We also demonstrate an application of the reconstruction method in an experimental setting at the Argonne Wakefield Accelerator, where it is able to reconstruct the beam distribution and accurately predict previously unseen measurements 75× faster than previous methods.

43 PARTICLE ACCELERATORS↗

High-Resolution Meteorology with Climate Change Impacts from Global Climate Model Data Using Generative Machine Learning

As renewable energy generation increases, the impacts of weather and climate on energy generation and demand become critical to the reliability of the energy system. However, these impacts are often overlooked. Global climate models (GCMs) can be used to understand possible changes to our climate, but their coarse resolution makes them difficult to use in energy system modelling. Here we present open-source generative machine learning methods that produce meteorological data at a nominal spatial resolution of 4 km at an hourly frequency based on inputs from 100 km daily-average GCM data. These methods run 40 times faster than traditional downscaling methods and produce data that have high-resolution spatial and temporal attributes similar to historical datasets. We demonstrate that these methods can be used to downscale projected changes in wind, solar and temperature variables across multiple GCMs including projections for more frequent low-wind and high-temperature events in the Eastern United States.

climate change↗

Second-generation downscaled earth system model data using generative machine learning

The second-generation Sup3rCC dataset provides high-resolution meteorological data generated through the downscaling of multiple earth system models (ESMs) from the Coupled Model Intercomparison Project Phase 6 (CMIP6). This downscaling is performed through application of a generative machine learning approach called Super-Resolution for Renewable Resource Data (sup3r). This dataset builds on the first-generation Sup3rCC data by applying improved bias correction methods and adding downscaled precipitation to the output variables. As with the first Sup3rCC version, the data still include temperature, wind speed and direction at multiple heights, pressure, three components of downwelling solar radiation, and relative humidity—all at 4-kilometer (km) hourly resolution over the contiguous United States. This is a 25x spatial enhancement and 24x temporal enhancement of the source 100-km daily-average ESM data. This extension of the Sup3rCC dataset includes data from six ESMs from two shared socioeconomic pathways (SSPs) totaling 400 years of data with multiple future projections of changing meteorological conditions. The scenario selection was based on a structured evaluation of historical ESM skill and comprehensive representation of possible trajectories of future climate change in temperature, humidity, precipitation, solar irradiance, and near-surface wind speeds. The inclusion of multiple future projections is intended to enable users to assess key drivers of un 36 certainty and variability. All data are double-bias corrected, resulting in a product that can be used out-of-the-box for energy system analysis with minimal historical bias. The potential applications of Sup3rCC data extend to various topics in renewable energy resource assessment, energy systems modeling, and grid resilience studies. High-resolution future meteorological projections are critical for evaluating the effects of changing meteorological conditions on renewable energy generation, energy demand, and for optimizing energy storage and grid infrastructure. The 4-km hourly resolution of the downscaled data enables understanding of spatial and temporal variability at the scales necessary for energy system operational planning. In addition, the dataset can support risk assessments by providing detailed information on possible future extreme weather events and long-term meteorological variability at scales relevant to energy infrastructure. By offering an enhanced representation of possible future meteorological conditions, the second-generation Sup3rCC dataset enables more precise modeling of energy resilience and adaptation strategies in response to changing meteorological conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Generation of random geological models using multi-randomization for machine learning

Generating high-fidelity geological models is essential for advancing machine learning (ML) methods in automated seismic interpretation. For instance, seismic images paired with corresponding fault labels are foundational for ML-based fault detection from seismic migration sections. While several open-access datasets of random geological models exist, open-source tools specifically designed to produce large volumes of such models for ML applications remain scarce. To address this gap, we present RGM (Random Geological Model), an open-source software package for efficiently generating 2D and 3D synthetic geological models tailored for ML workflows. RGM supports the creation of diverse model components, including medium property distributions (P-/S-wave velocities and density), seismic reflectivity images (i.e., synthetic migration sections), relative geological time, and discrete fault attributes such as probability, dip, strike, rake, and displacement. It also accommodates the creation of complex geological features such as salt bodies and unconformities. The model generation algorithm employs a multi-randomization strategy, yielding an effectively infinite-dimensional model space that encompasses a wide range of geological scenarios and associated seismic features. Furthermore, RGM incorporates a method to generate synthetic elastic migration images using analytical elastic reflection coefficients combined with frequency-dependent scaling. This functionality enables the creation of training datasets for ML models that leverage elastic seismic images. RGM is implemented in modern object-oriented Fortran, allowing users to flexibly control statistical parameters governing model variability. We demonstrate the capability, performance, and geological realism of the package through comprehensive 2D and 3D examples.

58 GEOSCIENCES↗

Calibrating Bayesian generative machine learning for Bayesiamplification

Recently, combinations of generative and Bayesian deep learning have been introduced in particle physics for both fast detector simulation and inference tasks. These neural networks aim to quantify the uncertainty on the generated distribution originating from limited training statistics. The interpretation of a distribution-wide uncertainty however remains ill-defined. We show a clear scheme for quantifying the calibration of Bayesian generative machine learning models. For a Continuous Normalizing Flow applied to a low-dimensional toy example, we evaluate the calibration of Bayesian uncertainties from either a mean-field Gaussian weight posterior, or Monte Carlo sampling network weights, to gauge their behaviour on unsteady distribution edges. Well calibrated uncertainties can then be used to roughly estimate the number of uncorrelated truth samples that are equivalent to the generated sample and clearly indicate data amplification for smooth features of the distribution.

97 MATHEMATICS AND COMPUTING↗

Diffusion-Model-Assisted Supervised Learning of Generative Models for Density Estimation

Here, we present a supervised learning framework of training generative models for density estimation. Generative models, including generative adversarial networks (GANs), normalizing flows, and variational auto-encoders (VAEs), are usually considered as unsupervised learning models, because labeled data are usually unavailable for training. Despite the success of the generative models, there are several issues with the unsupervised training, e.g., requirement of reversible architectures, vanishing gradients, and training instability. To enable supervised learning in generative models, we utilize the score-based diffusion model to generate labeled data. Unlike existing diffusion models that train neural networks to learn the score function, we develop a training-free score estimation method. This approach uses mini-batch-based Monte Carlo estimators to directly approximate the score function at any spatial-temporal location in solving an ordinary differential equation (ODE), corresponding to the reverse-time stochastic differential equation (SDE). This approach can offer both high accuracy and substantial time savings in neural network training. Once the labeled data are generated, we can train a simple, fully connected neural network to learn the generative model in the supervised manner. Compared with existing normalizing flow models, our method does not require the use of reversible neural networks and avoids the computation of the Jacobian matrix. Compared with existing diffusion models, our method does not need to solve the reverse-time SDE to generate new samples. As a result, the sampling efficiency is significantly improved. We demonstrate the performance of our method by applying it to a set of 2D datasets as well as real data from the University of California Irvine (UCI) repository.

97 MATHEMATICS AND COMPUTING↗