Search NASA⌕ Search

SEARCH · Search NASA

Results for “learning dynamics”

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 37 records · Page 2

Dynamic Modeling of Learning in Emerging Energy Industries: The Example of Advanced Biofuels in the United States: Preprint

This paper (and its supplemental model) presents novel approaches to modeling interactions and related policies among investment, production, and learning in an emerging competitive industry. New biomass-to-biofuels pathways are being developed and commercialized to support goals for U.S. advanced biofuel use, such as those in the Energy Independence and Security Act of 2007. We explore the impact of learning rates and techno-economics in a learning model excerpted from the Biomass Scenario Model (BSM), developed by the U.S. Department of Energy and the National Renewable Energy Laboratory to explore the impact of biofuel policy on the evolution of the biofuels industry. The BSM integrates investment, production, and learning among competing biofuel conversion options that are at different stages of industrial development. We explain the novel methods used to simulate the impact of differing assumptions about mature industry techno-economics and about learning rates while accounting for the different maturity levels of various conversion pathways. A sensitivity study shows that the parameters studied (fixed capital investment, process yield, progress ratios, and pre-commercial investment) exhibit highly interactive effects, and the system, as modeled, tends toward market dominance of a single pathway due to competition and learning dynamics.

09 BIOMASS FUELS↗

Deep Learning-Based Dynamic Modeling of Three-Phase Voltage Source Inverters

Inverter-based resource (IBR) models are necessary to analyze modern power system stability and create effective control strategies. Modeling IBRs in converter-rich power systems is crucial, yet challenging due to the lack of commercial information on converter topologies and control parameters. This paper proposes novel convolutional neural network (CNN)–based data-driven techniques for modeling IBRs, addressing adaptability and proprietary concerns without requiring internal system physics knowledge. The proposed method is tested using real grid-tied commercial IBR transient data and demonstrates effectiveness and accuracy. Furthermore, the developed modeling approach is integrated and implemented in the open-source power distribution simulation and analysis tool, GridLAB-D, to illustrate the potentiality of dynamic analysis of large-scale power systems with high IBRs.

deep learning, artificial intelligence↗

Dynamic mitigation of EDFA power excursions with machine learning

Dynamic optical networking has promising potential to support the rapidly changing traffic demands in metro and long-haul networks. However, the improvement in dynamicity is hindered by wavelength-dependent power excursions in gain-controlled erbium doped fiber amplifiers (EDFA) when channels change rapidly. We introduce a general approach that leverages machine learning (ML) to characterize and mitigate the power excursions of EDFA systems with different equipment and scales. An ML engine is developed and experimentally validated to show accurate predictions of the power dynamics in cascaded EDFAs. Recommended channel provisioning based on the ML predictions achieves within 1% error of the lowest possible power excursion over 94% of the time. In conclusion, we also showcase significant mitigation of EDFA power excursions in super-channel provisioning when compared to the first-fit wavelength assignment algorithm.

97 MATHEMATICS AND COMPUTING↗

Learning stochastic dynamics and predicting emergent behavior using transformers

We show that a neural network originally designed for language processing can learn the dynamical rules of a stochastic system by observation of a single dynamical trajectory of the system, and can accurately predict its emergent behavior under conditions not observed during training. We consider a lattice model of active matter undergoing continuous-time Monte Carlo dynamics, simulated at a density at which its steady state comprises small, dispersed clusters. We train a neural network called a transformer on a single trajectory of the model. The transformer, which we show has the capacity to represent dynamical rules that are numerous and nonlocal, learns that the dynamics of this model consists of a small number of processes. Forward-propagated trajectories of the trained transformer, at densities not encountered during training, exhibit motility-induced phase separation and so predict the existence of a nonequilibrium phase transition. Transformers have the flexibility to learn dynamical rules from observation without explicit enumeration of rates or coarse-graining of configuration space, and so the procedure used here can be applied to a wide range of physical systems, including those with large and complex dynamical generators.

97 MATHEMATICS AND COMPUTING↗

Robust Learning of Dynamic Interactions for Enhancing Power System Resilience (Final Scientific Report)

The overall goal of the project is to leverage robust graphical learning and phase measurement unit (PMU) data to learn the dynamic interactions of electrical grid components in order to improve the power system resilience. Specifically, the learned dynamic interaction graphs are utilized to detect known and unknown anomalous patterns in power systems, identify high-risk operational conditions, and enable risk-based cascading mitigation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗

Deep learning of dynamically responsive chemical Hamiltonians with semiempirical quantum mechanics

Conventional machine-learning (ML) models in computational chemistry learn to directly predict molecular properties using quantum chemistry only for reference data. While these heuristic ML methods show quantum-level accuracy with speeds several orders of magnitude faster than traditional quantum chemistry methods, they suffer from poor extensibility and transferability; i.e., their accuracy degrades on large or new chemical systems. Incorporating quantum chemistry frameworks into the ML models directly solves this problem. Here we take the structure of semiempirical quantum mechanics (SEQM) methods to construct dynamically responsive Hamiltonians. SEQM methods use empirical parameters fitted to experimental properties to construct reduced-order Hamiltonians, facilitating much faster calculations than ab initio methods but with compromised accuracy. By replacing these static parameters with machine-learned dynamic values inferred from the local environment, we greatly improve the accuracy of the SEQM methods. Trained on molecular energies and atomic forces, these dynamically generated Hamiltonian parameters show a strong correlation with atomic hybridization and bonding. Trained with only about 60,000 small organic molecular conformers, the resulting model retains interpretability, extensibility, and transferability when testing on much larger chemical systems and predicting various molecular properties. Overall, this work demonstrates the virtues of incorporating physics-based descriptions with ML to develop models that are simultaneously accurate, transferable, and interpretable.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learning stochastic dynamics with statistics-informed neural network

We introduce a machine-learning framework named statistics-informed neural network (SINN) for learning stochastic dynamics from data. This new architecture was theoretically inspired by a universal approximation theorem for stochastic systems, which we introduce in this paper, and the projection-operator formalism for stochastic modeling. Here, we devise mechanisms for training the neural network model to reproduce the correct statistical behavior of a target stochastic process. Numerical simulation results demonstrate that a well-trained SINN can reliably approximate both Markovian and non-Markovian stochastic dynamics. We demonstrate the applicability of SINN to coarse-graining problems and the modeling of transition dynamics. Furthermore, we show that the obtained reduced-order model can be trained on temporally coarse-grained data and hence is well suited for rare-event simulations.

97 MATHEMATICS AND COMPUTING↗

Interatomic Potential Model Development: Finite-Temperature Dynamics Machine Learning

Developing an accurate interatomic potential model is a prerequisite for achieving reliable results from classical molecular dynamics (CMD) simulations; however, most of the potentials are biased as specific simulation purposes or conditions are considered in the parameterization. Here, for developing an unbiased potential, a finite-temperature dynamics machine learning (FTD-ML) approach is proposed, and its processes and feasibility are demonstrated using the Buckingham potential model and aluminum (Al) as an example. Compared with conventional machine learning approaches, FTD-ML exhibits three distinguished features: 1) FTD-ML intrinsically incorporates more extensive configurational and conditional space for enhancing the transferability of developed potentials; 2) FTD-ML employs various properties calculated directly from CMD, for ML model training and prediction validation against experimental data instead of first-principles data; 3) FTD-ML is much more computationally cost effective than first-principles simulations, especially when the system size increases over 10 3 atoms as employed in this research for ensuring reliable training data. The Al Buckingham potential developed by the FTD-ML approach exhibits good performance for general simulation purposes. Thus, the FTD-ML approach is expected to contribute to a fast development of interatomic potential model suitable for various simulation purposes and conditions, without limitation of model type, while maintaining experimental-level accuracy.

42 ENGINEERING↗

Learning from Dynamic User Interaction Graphs to Forecast Diverse Social Behavior

Most of the existing graph analytics for understanding social be- havior focuses on learning from static rather than dynamic graphs using hand-crafted network features or recently emerged graph embeddings learned independently from a downstream predictive task, and solving predictive (e.g., link prediction) rather than fore- casting tasks directly. To address these limitations, we propose (1) a novel task – forecasting user interactions over dynamic social graphs, and (2) a novel deep learning, multi-task, node-aware at- tention model that focuses on forecasting social interactions, going beyond recently emerged approaches for learning dynamic graph embeddings. Our model relies on graph convolutions and recurrent layers to forecast future social behavior and interaction patterns in dynamic social graphs. We evaluate our model on the ability to forecast the number of retweets and mentions of a specific news source on Twitter (focusing on deceptive and credible news sources) with R2 of 0.79 for retweets and 0.81 for mentions. An additional evaluation includes model forecasts of user-repository interactions on GitHub and comments to a specific video on YouTube with a mean absolute error close to 2% and R2 exceeding 0.69. Our results demonstrate that learning from connectivity information over time in combination with node embeddings yields better forecasting results than when we incorporate the state-of-the-art graph em- beddings e.g., Node2Vec and DeepWalk into our model. Finally, we perform in-depth analyses to examine factors that influence model performance across tasks and different graph types e.g., the influence of training and forecasting windows as well as graph topological properties.

Shrestha, Prasha↗

Out-of-distribution generalization for learning quantum dynamics

Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Out-of-distribution generalization for learning quantum dynamics

Abstract Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mechanisms and stability of Li dynamics in amorphous Li-Ti-P-S-based mixed ionic–electronic conductors: A machine learning molecular dynamics study

Mixed ionic–electronic conductors (MIECs) exhibit both high ionic and electronic conductivity to improve the battery performance. In this work, we investigate the mechanism and stability of transport channels in our recently developed MIEC material, amorphous Ti-doped lithium phosphorus sulfide (LPS), using molecular dynamics (MD) simulations with a 99% accurate machine-learning force field (MLFF) trained on ab initio MD data. The achieved MLFF helps efficient large-scale MD simulations on LPS with three Ti concentrations (10%, 20%, and 30%) and six temperatures (25°C to 225°C) to calculate ionic conductivity, activation energy, Li-ion transport mechanism, and configurational entropy. Results show that ionic conductivities and activation energies are consistent with our recent experimental values. Moreover, Li-ion transport occurs via free-volume diffusion facilitated by the formation of disordered Li-S polyhedra. The enhanced stability of transport channels at 10% and 20% Ti doping, compared to 0% and 30%, is observed by analyzing the vibrational and configurational entropy of these disordered Li-S polyhedra. Overall, this study highlights the utility of MLFF-based large-scale MD simulations in explaining the transport mechanism and the stability of Li-ion in Ti-doped LPS electrolyte with significant computational efficiency.

And configuration entropy↗

Safe Physics-Informed Machine Learning for Dynamics and Control

This tutorial paper focuses on safe physics-informed machine learning in the context of dynamics and control, providing a comprehensive overview of how to integrate physical models and safety guarantees. As machine learning techniques enhance the modeling and control of complex dynamical systems, ensuring safety and stability remains a critical challenge, especially in safety-critical applications like autonomous vehicles, robotics, medical decision-making, and energy systems. We explore various approaches for embedding and ensuring safety constraints, including structural priors, Lyapunov and Control Barrier Functions, predictive control, projections, and robust optimization techniques. Additionally, we delve into methods for uncertainty quantification and safety verification, including reachability analysis and neural network verification tools, which help validate that control policies remain within safe operating bounds even in uncertain environments. The paper includes illustrative examples demonstrating the implementation aspects of safe learning frameworks that combine the strengths of data-driven approaches with the rigor of physical principles, offering a path toward the safe control of complex dynamical systems.

Drgona, Jan↗

Learning plasma dynamics and robust rampdown trajectories with predict-first experiments at TCV

The rampdown phase of a tokamak pulse is difficult to simulate and often exacerbates multiple plasma instabilities. To reduce the risk of disrupting operations, we leverage advances in Scientific Machine Learning (SciML) to combine physics with data-driven models, developing a neural state-space model (NSSM) that predicts plasma dynamics during Tokamak à Configuration Variable (TCV) rampdowns. The NSSM efficiently learns dynamics from a modest dataset of 311 pulses with only five pulses in a reactor-relevant high-performance regime. The NSSM is parallelized across uncertainties, and reinforcement learning (RL) is applied to design trajectories that avoid instability limits. High-performance experiments at TCV show statistically significant improvements in relevant metrics. A predict-first experiment, increasing plasma current by 20% from baseline, demonstrates the NSSM’s ability to make small extrapolations. The developed approach paves the way for designing tokamak controls with robustness to considerable uncertainty and demonstrates the relevance of SciML for fusion experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dyn$\mathrm{AMO}$: Multi-agent reinforcement learning for dynamic anticipatory mesh optimization with applications to hyperbolic conservation laws

Here we introduce DynAMO, a reinforcement learning paradigm for Dynamic Anticipatory Mesh Optimization. Adaptive mesh refinement is an effective tool for optimizing computational cost and solution accuracy in numerical methods for partial differential equations. However, traditional adaptive mesh refinement approaches for time-dependent problems typically rely only on instantaneous error indicators to guide adaptivity. As a result, standard strategies often require frequent remeshing to maintain accuracy. In the DynAMO approach, multi-agent reinforcement learning is used to discover new local refinement policies that can anticipate and respond to future solution states by producing meshes that deliver more accurate solutions for longer time intervals. By applying DynAMO to discontinuous Galerkin methods for the linear advection and compressible Euler equations in two dimensions, we demonstrate that this new mesh refinement paradigm can outperform conventional threshold-based strategies while also generalizing to different mesh sizes, remeshing and simulation times, and initial conditions.

97 MATHEMATICS AND COMPUTING↗

Evolutionary reinforcement learning of dynamical large deviations

In this work, we show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗