Search NASA⌕ Search

SEARCH · Search NASA

Results for “differentiable machine 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 541 records · Page 30

Inferring fracture dilation and shear slip from surface deformation utilising trained surrogate models

An important task in energy and CO 2 storage (sequestration) in the subsurface is to verify that the surrounding fractures and faults are not activated, acting as leakage pathways. This is achievable through effective and efficient Measurement, Monitoring and Verification (MMV) plans. In this work, two surrogate models are trained to captures dilation (opening) and shear deformation of fractures, and the associated surface deformation. The trained surrogate model, based on conditional Generative-Adversarial Networks (cGAN) receives fracture apertures from dilational fractures together with fracture slips from shear fractures and predicts the combined surface deformation. An inversion algorithm based on Bayesian framework is proposed to identify the geometry of both types of fractures, as well as volume of dilational fractures and deformation moment induced by shear fractures, all from the measured surface deformation data. The inversion algorithm utilises the Differential Evolution (DE) optimisation technique that has the superior performance in finding the global minimum of cost function. The proposed surrogate-assisted inversion successfully inferred the unknown dip, dip direction and the volume of the dilational fractures as well as the induced deformation moment in shear fractures. The model was further tested for the inversion of a field hydraulic fracturing tilt dataset applying different scenarios with varying unknowns to show the model's performance, as well as incorporating shear deformation for better match with the observed data.

Dilation and shear↗

Highly accurate and constrained density functional obtained with differentiable programming

Using an end-to-end differentiable implementation of the Kohn-Sham self-consistent field equations, we obtain a highly accurate neural network–based exchange and correlation (XC) functional of the electronic density. The functional is optimized using information on both energy and density while exact constraints are enforced through an appropriate neural network architecture. Here we evaluate our model against different families of XC approximations and show that at the meta-GGA level our functional exhibits unprecedented accuracy for both energy and density predictions. For nonempirical functionals, there is a strong linear correlation between energy and density errors. We use this correlation to define an XC functional quality metric that includes both energy and density errors, leading to an improved way to rank different approximations.

36 MATERIALS SCIENCE↗

Learning non-Higgsable gauge groups in 4D F-theory

We apply machine learning techniques to solve a specific classification problem in 4D F-theory. For a divisor D on a given complex threefold base, we want to read out the non-Higgsable gauge group on it using local geometric information near D. The input features are the triple intersection numbers among divisors near D and the output label is the non-Higgsable gauge group. We use decision tree to solve this problem and achieved 85%-98% out-of-sample accuracies for different classes of divisors, where the data sets are generated from toric threefold bases without (4,6) curves. We have explicitly generated a large number of analytic rules directly from the decision tree and proved a small number of them. As a crosscheck, we applied these decision trees on bases with (4,6) curves as well and achieved high accuracies. Additionally, we have trained a decision tree to distinguish toric (4,6) curves as well. Finally, we present an application of these analytic rules to construct local base configurations with interesting gauge groups such as SU(3).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Remote sensing of planetary boundary layer from ground and space: Structure, thermodynamics, and boundary layer clouds

The planetary boundary layer (PBL) is a critical interface between Earth's surface and atmosphere, influencing atmospheric convection, weather patterns, and air quality. Recognized by the 2017 National Academies of Sciences, Engineering, and Medicine Earth Science Decadal Survey as an Incubation Targeted Observable, high-quality and effective observation of the PBL has become a priority. This paper reviews surface-based and satellite remote sensing techniques for characterizing PBL features, including PBL height (PBLH), boundary layer thermodynamics, turbulence, and boundary layer clouds (BLCs). These elements are treated as interconnected aspects of the PBL system, while recognizing that different instruments retrieve different physical manifestations of the PBL. The review summarizes recent advances and limitations in Micro-Pulse Lidar (MPL), Doppler lidar, Raman lidar, Differential Absorption Lidar (DIAL), ceilometers, wind profilers, GNSS Radio Occultation, radar, and hyperspectral sounders. These observations help trace dynamic processes within the PBL and link PBL structure to broader weather and climate processes. The review also highlights persistent observational gaps over oceans, remote land, and polar regions, where continuous surface-based profiling is sparse. By comparing instrument capabilities, practical limitations, and interpretation issues, this review emphasizes the need for integrated remote sensing approaches and careful definition of the retrieved PBL quantities.

Boundary layer clouds↗

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗

TorchBraid: High-Performance Layer-Parallel Training of Deep Neural Networks with MPI and GPU Acceleration

TorchBraid is a high-performance implementation of layer-parallel training for deep neural networks (DNNs) supporting MPI-based parallelism and GPU acceleration. Layer-parallel training has been developed to overcome the serialization inherent in forward and backward propagation of DNNs that limits utilization of computational resources in the strong scaling limit. To achieve this, TorchBraid integrates the PyTorch neural network framework with the state-of-the-art XBraid time-parallel library. Furthermore, this article presents the use and performance of TorchBraid, in addition to solutions for overcoming the algorithmic challenges inherent in combining automatic differentiation with layer-parallel. Results are presented with and without GPU acceleration for the Tiny ImageNet and MNIST image classification data sets, as well as recurrent neural networks. Overall, TorchBraid enables fast training of DNNs, both in a strong and weak scaling context. In addition to the TorchBraid software, several new advances in applying layer-parallel algorithms are detailed. Integration of layer-parallel with data-parallel algorithms is presented for the first time, showing the computational advantages of the combination. Standard deep learning techniques, like batch-normalization, are developed for layer-parallel training. Finally, a new approach combining layer-parallel with spatial coarsening in order to accelerate training for 3D image classification shows roughly a 10× speedup over serial execution.

Layer-parallel↗

Improving five-year survival prediction via multitask learning across HPV-related cancers

Oncology is a highly siloed field of research in which sub-disciplinary specialization has limited the amount of information shared between researchers of distinct cancer types. This can be attributed to legitimate differences in the physiology and carcinogenesis of cancers affecting distinct anatomical sites. However, underlying processes that are shared across seemingly disparate cancers probably affect prognosis. The objective of the current study is to investigate whether multitask learning improves 5-year survival cancer patient survival prediction by leveraging information across anatomically distinct HPV related cancers. Furthermore, data were obtained from the Surveillance, Epidemiology, and End Results (SEER) program database. The study cohort consisted of 29,768 primary cancer cases diagnosed in the United States between 2004 and 2015. Ten different cancer diagnoses were selected, all with a known association with HPV risk. In the analysis, the cancer diagnoses were categorized into three distinct topography groups of varying specificity. The most specific topography grouping consisted of 10 original cancer diagnoses differentiated by the first two digits of the ICD-O-3 topography code. The second topography grouping consisted of cancer diagnoses categorized into six distinct organ groups. Finally, the third topography grouping consisted of just two groups, head-neck cancers and ano-genital cancers. The tasks were to predict 5-year survival for patients within the different topography groups using 14 predictive features which were selected among descriptive variables available in the SEER database. The information from the predictive features was shared between tasks in three different ways, resulting in three distinct predictive models: 1) Information was not shared between patients assigned to different tasks (single task learning); 2) Information was shared between all patients, regardless of task (pooled model); 3) Only relevant information was shared between patients grouped to different tasks (multitask learning). Prediction performance was evaluated with Brier scores. All three models were evaluated against one another on each of the three distinct topography-defined tasks. The results showed that multitask classifiers achieved relative improvement for the majority of the scenarios studied compared to single task learning and pooled baseline methods. In this study, we have demonstrated that sharing information among anatomically distinct cancer types can lead to improved predictive survival models.

59 BASIC BIOLOGICAL SCIENCES↗

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗

Crystal generation using the fully differentiable pipeline and latent space optimization

We present a materials generation framework that couples a symmetry-conditioned variational autoencoder with a differentiable SO(3) power spectrum objective to steer candidates toward a specified local environment under the crystallographic constraints. In particular, we implement a fully differentiable pipeline that performs batch-wise optimization on both direct and latent crystallographic representations. Using the GPU acceleration, the implementation achieves about fivefold speed compared to our previous CPU workflow, while yielding comparable outcomes. In addition, we introduce the optimization strategy that alternatively performs optimization on the direct and latent crystal representations. This dual-level relaxation approach can effectively escape local minima defined by different objective gradients, thus increasing the success rate of generating complex structures satisfying the target local environments. This framework can be extended to systems consisting of multi-components and multi-environments, providing a scalable route to generate material structures with the target local environment.

conditional VAE↗

Multibody for Everybody (M4E): A Symbolic Dynamics Modeling Tool with Applications in Simulation, Control, and Optimization

Developing the analytical model of a multibody system is often the initial step in control and optimization. The analytical model (equations of motion) describes a system’s time evolution under specified forcing conditions. Although developing these equations is easy for simple systems, this process becomes more complex for systems composed of multiple bodies. Deriving equations of motion for complex multibody systems requires specialized expertise in multibody dynamics, is time-consuming, and is susceptible to error. To address this issue, this paper presents an open-source, easy-to-use, systematic framework to derive symbolic equations of motion in both Python and MATLAB using the joint coordinate formulation. This formulation results in a set of ordinary differential equations that use the minimum set of coordinates needed to model a system. The symbolic representation provides better insight into the influence of design parameters on system performance, facilitates sensitivity analysis and parameter studies, and supports direct implementation of control and optimization routines. The tool enables numerical simulation for specified parameter sets, is modular for straightforward integration with other tools and libraries, and allows incorporation of hydrodynamics, mooring, and other external forces. The result is a reproducible, extensible pipeline for modeling, simulation, and design of complex multibody systems. The proposed tool is versatile and can be applied to domains such as robotics, control, and design. In addition, we integrated external libraries that provide capabilities for modeling offshore systems such as underwater robots and marine energy converters.

16 TIDAL AND WAVE POWER↗

Four-dimensional phase-space reconstruction of flat and magnetized beams using neural networks and differentiable simulations

Beams with cross-plane coupling or extreme asymmetries between the two transverse phase spaces are often encountered in particle accelerators. Flat beams with large transverse-emittance ratios are critical for future linear colliders. Similarly, magnetized beams with significant cross-plane coupling are expected to enhance the performance of electron cooling in hadron beams. Preparing these beams requires precise control and characterization of the four-dimensional transverse phase space. In this study, we employ generative phase-space reconstruction techniques to rapidly characterize magnetized and flat-beam phase-space distributions using a conventional quadrupole-scan method. The reconstruction technique is experimentally demonstrated on an electron beam produced at the Argonne Wakefield Accelerator and successfully benchmarked against conventional diagnostics techniques. Specifically, we show that predicted beam parameters from the reconstructed phase-space distributions (e.g., as magnetization and flat-beam emittances) are in excellent agreement with those measured from the conventional diagnostic methods. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Comparative performance and technoeconomic analyses of two microalgae harvesting systems evaluated at a commercially relevant scale

Using a commercially scalable system designed for processing thousands of liters a day, here we evaluated the factors that affected the performance, energy consumption and capital/operating costs of both flocculation-based and filtration-based algal harvesting systems over a 16 month period. Coagulation efficiency was the primary driver of harvest efficiency in the flocculation-based method, while cell lysis was important for the filtration-based method. Culture (algae) age differentially influenced harvest efficiency through changes in cell fragility and stickiness. The average energy consumption of the flocculation-based method was 0.389 kWh/m 3 , while that for the filtration-based method was 4.343 kWh/m 3 . The average harvesting cost of the filtration-based method was 5.35 $\$$/m 3 , while for flocculation-based method it was 4.52 $\$$/m 3 . The concentration factor of filtration-based and flocculation-based method were 770–1086 and 407–448, respectively. For both harvesting methods, labor costs dominated and ranged from 55.84%–67.94% of total cost. Further system automation is a potential method to lower the harvesting cost. The filtration-based harvesting method could produce a better quality of algal biomass with higher concentration factors and less ash content, but needed more energy input, as compared with a flocculation-based method. This study highlights the importance of algal culture status to successful harvesting, and it also provides insight into developing more efficient harvesting technology with lower energy and capital cost.

59 BASIC BIOLOGICAL SCIENCES↗

Frequency Emitter Geolocation Using Signal Strength Fingerprinting Informed By 3D Propagation Modeling

This work focuses on the problem of RF geolocation in complex multipath environments. Using 3D electromagnetic propagation modeling to characterize environments of interest will enable more accurate RF geolocation. Specifically, a path-loss radio map can be generated in simulation for use in received signal strength indicators (RSSI) fingerprinting, or pattern matching. RSSI fingerprinting is an example of data-based method that takes site specific information into account which should allow for better performance than other model-based methods that use a generalized model of electromagnetic propagation. This modeling capability will also be used to evaluate the relative performance of RSSI fingerprinting, pathloss model based RSSI methods such as differential received signal strength circles (DRSS), RSSI joint gaussian estimation, and time-difference of arrival (TDOA). New methods using this simulation derived electromagnetic characterization could improve the efficacy of currently deployed and future RF spectral monitoring solutions. Wireless InSite developed by Remcom is used as the simulation tool of choice in this work. An indoor location is simulated with a grid of fixed receivers and a grid of transmit locations. Using the output of the Wireless InSite simulation the response from a given transmit location to a given receive location can be generated. During the first year of the project various geolocation methods evaluated on purely synthetic, but realistic, data. The second year focused on testing and validating the efficacy of simulation informed RF geolocation using two physical testbeds. This work has shown that data-based approaches are more accurate than model-based ones at the expensive of requiring measured or simulated site-specific training data.

47 OTHER INSTRUMENTATION↗

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↗

SwinCell: a 3D transformer and flow-based framework for improved cell segmentation

Segmentation of three-dimensional (3D) cellular images is fundamental for studying and understanding cell structure and function. However, 3D cellular segmentation is challenging, particularly for dense cells and tissues. This challenge arises mainly from the complex contextual information within 3D images, anisotropic properties, and the sensitivity to internal cellular structures, which often lead to incorrect segmentation. In this work, we introduce SwinCell, a 3D transformer-based framework that leverages Swin-transformer to predict flow and differentiate individual cell instances. We demonstrate SwinCell’s utility in the segmentation of nuclei, colon tissue cells, and densely cultured cells. SwinCell strikes a balance between maintaining detailed local feature recognition and understanding broader contextual information. Through extensive testing with both public and in-house 3D cell imaging datasets, SwinCell shows utility in segmenting dense cells, making it a valuable tool for 3D segmentation in cellular analysis that could expedite research in cell biology and tissue engineering.

59 BASIC BIOLOGICAL SCIENCES↗

ECLEIRS: Exact conservation law embedded identification of reduced states for parameterized nonlinear conservation laws from sparse and noisy data

Multi-query applications such as parameter estimation, uncertainty quantification and design optimization for parameterized partial differential equation (PDE) systems are expensive. While reduced/latent state dynamics approaches for parameterized PDEs offer a viable alternative, these approaches rely on high-quality data and struggle with highly sparse spatiotemporal noisy measurements typically obtained from experiments. Furthermore, there is no guarantee that these models satisfy governing physical conservation laws. In this article, we propose a reduced state dynamics approach, referred to as ECLEIRS, that embeds exact conservation in the solution and flux representation by utilizing a space-time divergence-free neural network formulation. We compare ECLEIRS with other reduced state dynamics approaches, those that do not enforce any physical constraints and those with physics-informed loss functions, for three shock-propagation problems: 1-D advection, 1-D Burgers and 2-D Euler equations. In conclusion, the numerical experiments conducted in this study demonstrate that ECLEIRS provides the most accurate prediction of dynamics for unseen parameters even in the presence of highly sparse and noisy data.

97 MATHEMATICS AND COMPUTING↗

E-PINNs: Epistemic Physics-Informed Neural Networks

Physics-informed neural networks (PINNs) have demonstrated promise as a framework for solving forward and inverse problems involving partial differential equations. Despite recent progress in the field, it remains challenging to quantify uncertainty in these networks. While techniques such as Bayesian PINNs (B-PINNs) provide a principled approach to capturing epistemic uncertainty through Bayesian inference, they can be computationally expensive for large-scale applications. In this work, we propose Epistemic Physics-Informed Neural Networks (E-PINNs), a framework that uses a small network, the epinet, to efficiently quantify epistemic uncertainty in PINNs. The proposed approach works as an add-on to existing, pre-trained PINNs with a small computational overhead. We demonstrate the applicability of the proposed framework in various test cases and compare the results with B-PINNs using Hamiltonian Monte Carlo (HMC) posterior estimation and dropout-equipped PINNs (Dropout-PINNs). In our experiments, E-PINNs achieve calibrated coverage with competitive sharpness at substantially lower cost. We demonstrate that when B-PINNs produce narrower bands, they under-cover in our tests. E-PINNs also show better calibration than Dropout-PINNs in these examples, indicating a favorable accuracy-efficiency trade-off.

AI for Science↗