Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Hamiltonian neural networks”

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

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗

Machine-learning Kohn–Sham potential from dynamics in time-dependent Kohn–Sham systems

Abstract The construction of a better exchange-correlation potential in time-dependent density functional theory (TDDFT) can improve the accuracy of TDDFT calculations and provide more accurate predictions of the properties of many-electron systems. Here, we propose a machine learning method to develop the energy functional and the Kohn–Sham potential of a time-dependent Kohn–Sham (TDKS) system is proposed. The method is based on the dynamics of the Kohn–Sham system and does not require any data on the exact Kohn–Sham potential for training the model. We demonstrate the results of our method with a 1D harmonic oscillator example and a 1D two-electron example. We show that the machine-learned Kohn–Sham potential matches the exact Kohn–Sham potential in the absence of memory effect. Our method can still capture the dynamics of the Kohn–Sham system in the presence of memory effects. The machine learning method developed in this article provides insight into making better approximations of the energy functional and the Kohn–Sham potential in the TDKS system.

97 MATHEMATICS AND COMPUTING↗

Identification and assignment of rotational spectra using artificial neural networks

A method of identifying molecular parameters may include receiving observed transition frequencies, generating transition frequency sets and a spectral parameter sets, training one or more artificial neural networks by analyzing the transition frequency sets and the spectral parameter sets, analyzing the observed transition frequencies using the one or more trained artificial neural networks to predict estimated spectral parameters, and identifying molecular parameters by analyzing the estimated spectral parameters. A molecular parameter identification system may include a rotational spectrometer, a user interface, and a spectrum analysis application that may retrieve observed transition frequencies, identify a Hamiltonian type by a neural network analyzing the observed transition frequencies, select a second trained artificial neural network based on the identified Hamiltonian type, analyze observed transition frequencies using the second artificial neural network to identify estimated spectral parameters, and identify molecular parameters.

Prozuments, Kirills↗

Lie–Poisson Neural Networks (LPNets): Data-based computing of Hamiltonian systems with symmetries

An accurate data-based prediction of the long-term evolution of Hamiltonian systems requires a network that preserves the appropriate structure under each time step. Every Hamiltonian system contains two essential ingredients: the Poisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose paradigm examples are the Lie–Poisson systems, have been shown to describe a broad category of physical phenomena, from satellite motion to underwater vehicles, fluids, geophysical applications, complex fluids, and plasma physics. The Poisson bracket in these systems comes from the symmetries, while the Hamiltonian comes from the underlying physics. We view the symmetry of the system as primary, hence the Lie–Poisson bracket is known exactly, whereas the Hamiltonian is regarded as coming from physics and is considered not known, or known approximately. Using this approach, we develop a network based on transformations that exactly preserve the Poisson bracket and the special functions of the Lie–Poisson systems (Casimirs) to machine precision. We present two flavors of such systems: one, where the parameters of transformations are computed from data using a dense neural network (LPNets), and another, where the composition of transformations is used as building blocks (G-LPNets). We also show how to adapt these methods to a larger class of Poisson brackets. We apply the resulting methods to several examples, such as rigid body (satellite) motion, underwater vehicles, a particle in a magnetic field, and others. The methods developed in this paper are important for the construction of accurate data-based methods for simulating the long-term dynamics of physical systems.

Data-based modeling↗

Fast neural Poincare maps for toroidal magnetic fields

We demonstrate how to build symplectic neural networks to approximate Hamiltonian and Poincare maps in this notebook. Two examples are given: a simple pendulum and a pertubed pendulum.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Component-Level Inverse Design of Transmon Qubits Using Neural Networks

Designing a superconducting qubit to realize specific Hamiltonian parameters typically requires iterating through a time and compute-intensive forward loop in which the designer chooses a layout geometry, simulates it, extracts circuit parameters such as capacitances, and refines the geometry. We study the inverse version of this task using a neural-network workflow that maps target Hamiltonian parameters directly to component-level layout parameters, which we subsequently demonstrate on a planar transmon layout. During training, we pair the inverse model with a frozen forward surrogate model and evaluate the loss in Hamiltonian space rather than in layout-parameter space. In validation against a conventional EM solver, 97% of generated designs produce usable geometries, and the inverse-plus-surrogate pipeline reaches mean percent errors of 0.73% for qubit frequency and 1.58% for anharmonicity, comparable to or below the fabrication and simulation-to-measurement uncertainty expected for academic-process transmon devices of this type. A single pipeline query takes ~60 ms on CPU, versus ~2 min for a conventional EM capacitance extraction on the same hardware, a speedup of approximately 2,000x. Batching minimizes the AI model inference overhead, reducing the runtime to 3.1 microseconds per sample on CPU and 2.6 microseconds per sample on GPU at a batch size of 2048, resulting in speedups of 3.9 x 10^7 and 4.6 x 10^7, respectively, relative to a single conventional CPU EM extraction. Our results indicate that component-level inverse design usefully extends and complements conventional EM simulation, including for small datasets on the order of 1,000 samples.

Seidel, Olivia [Fermilab; Texas U., Arlington]↗

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE↗

TensorBNN: Bayesian inference for neural networks using TensorFlow

We report that TensorBNN is a new package based on TensorFlow that implements Bayesian inference for modern neural network models. The posterior density of neural network model parameters is represented as a point cloud sampled using Hamiltonian Monte Carlo. The TensorBNN package leverages TensorFlow's architecture and its ability to use modern graphics processing units in both the training and prediction stages.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distilling the Essential Elements of Nuclear Binding via Neural-Network Quantum States

To distill the essential elements of nuclear binding, we seek the simplest Hamiltonian capable of modeling atomic nuclei with percent-level accuracy. A critical aspect of this endeavor consists of accurately solving the quantum many-body problem without incurring an exponential computing cost with the number of nucleons. Furthermore, we address this challenge by leveraging a variational Monte Carlo method based on a highly expressive neural-network quantum state ansatz. In addition to computing binding energies and charge radii of nuclei with up to 𝐴 = 20 nucleons, by evaluating their magnetic moments, we demonstrate that neural-network quantum states are able to correctly capture the self-emerging nuclear shell structure. To this end, we introduce a novel computational protocol based on adding an external magnetic field to the nuclear Hamiltonian, which allows the neural network to learn the preferred polarization of the nucleus within the given magnetic field.

Binding energy & masses↗

B-PINNs: Bayesian Physics-informal Neural Networks for Forward and Inverse PDE Problems with Noisy Data

We propose a Bayesian physics-informed neural network (B-PINN) to solve both forward and inverse nonlinear problems described by partial differential equations (PDEs) and noisy data. In this Bayesian framework, the Bayesian neural network (BNN) combined with a PINN for PDEs serves as the prior while the Hamiltonian Monte Carlo (HMC) or the variational inference (VI) could serve as an estimator of the posterior. B-PINNs make use of both physical laws and scattered noisy measurements to provide predictions and quantify the aleatoric uncertainty arising from the noisy data in the Bayesian framework. Compared with PINNs, in addition to uncertainty quantification, B-PINNs obtain more accurate predictions in scenarios with large noise due to their capability of avoiding overfitting. We conduct a systematic comparison between the two different approaches for the B-PINNs posterior estimation (i.e., HMC or VI), along with dropout used for quantifying uncertainty in deep neural networks. Our experiments show that HMC is more suitable than VI with mean field Gaussian approximation for the B-PINNs posterior estimation, while dropout employed in PINNs can hardly provide accurate predictions with reasonable uncertainty. Finally, we replace the BNN in the prior with a truncated Karhunen-Loève (KL) expansion combined with HMC or a deep normalizing flow (DNF) model as posterior estimators. The KL is as accurate as BNN and much faster but this framework cannot be easily extended to high-dimensional problems unlike the BNN based framework.

Non linear PDEs, Noisy data, Bysian physics inform↗

Nuclei with Up to $$\varvec{A=6}$$ Nucleons with Artificial Neural Network Wave Functions

The ground-breaking works of Weinberg have opened the way to calculations of atomic nuclei that are based on systematically improvable Hamiltonians. Solving the associated many-body Schrödinger equation involves non-trivial difficulties, due to the non-perturbative nature and strong spin-isospin dependence of nuclear interactions. Artificial neural networks have proven to be able to compactly represent the wave functions of nuclei with up to $A=4$ nucleons. In this work, we extend this approach to $^6$Li and $^6$He nuclei, using as input a leading-order pionless effective field theory Hamiltonian. We successfully benchmark their binding energies, point-nucleon densities, and radii with the highly-accurate hyperspherical harmonics method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimal Control of Families of Quantum Gates

Quantum optimal control (QOC) enables the realization of accurate operations, such as quantum gates, and supports the development of quantum technologies. To date, many QOC frameworks have been developed, but those remain only naturally suited to optimize a single targeted operation at a time. Here, we extend this concept to optimal control with a continuous family of targets, and demonstrate that an optimization based on neural networks can find families of time-dependent Hamiltonians realizing desired classes of quantum gates in minimal time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mixed Precision Fermi-Operator Expansion on Tensor Cores from a Machine Learning Perspective

Here we present a second-order recursive Fermi-operator expansion scheme using mixed precision floating point operations to perform electronic structure calculations using tensor core units. A performance of over 100 teraFLOPs is achieved for half-precision floating point operations on Nvidia’s A100 tensor core units. The second-order recursive Fermi-operator scheme is formulated in terms of a generalized, differentiable deep neural network structure, which solves the quantum mechanical electronic structure problem. We demonstrate how this network can be accelerated by optimizing the weight and bias values to substantially reduce the number of layers required for convergence. We also show how this machine learning approach can be used to optimize the coefficients of the recursive Fermi-operator expansion to accurately represent the fractional occupation numbers of the electronic states at finite temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗

Symplectic neural network and its application to charged particle dynamics in electromagnetic fields

Recently, machine learning models have shown many successes in various applications in science and technology. In this work, we focus on the charged particle dynamics, with the development of a class of symplectic neural networks, including a linear version, SympMat, and a nonlinear version, HénonNet. Both are designed to preserve the structure of Hamiltonian systems. We show that they can be used to model relevant Hamiltonian systems of interest in plasma physics and astrophysics, for linear and nonlinear charged particle dynamics, with the potential to bridge multi-scale simulations. These symplectic neural networks are adapted to the applications in plasma simulations and particle-wave interaction with parametric dependence and periodicity, where we have investigated their performance and accuracy. In particular, SympMat is shown to outperform the traditional Boris particle pusher down to the sub-gyroperiod scale in the case of charged particles in uniform magnetic fields. HénonNet successfully predicts the hot electron distribution, which is validated against theoretical results. These results highlight the potential of symplectic neural networks as a trajectory integrator for particle-in-cell simulations or a fast surrogate to replace conventional numerical schemes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Enabling complete multichannel nonadiabatic dynamics: A global representation of the two-channel coupled, 1,2 1 A and 1 3 A states of NH 3 using neural networks

Global coupled three-state two-channel potential energy and property/interaction (dipole and spin–orbit coupling) surfaces for the dissociation of NH 3 (Ã) into NH + H 2 and NH 2 + H are reported. The permutational invariant polynomial-neural network approach is used to simultaneously fit and diabatize the electronic Hamiltonian by fitting the energies, energy gradients, and derivative couplings of the two coupled lowest-lying singlet states as well as fitting the energy and energy gradients of the lowest-lying triplet state. The key issue in fitting property matrix elements in the diabatic basis is that the diabatic surfaces must be smooth, that is, the diabatization must remove spikes in the original adiabatic property surfaces attributable to the switch of electronic wavefunctions at the conical intersection seam. Here, we employ the fit potential energy matrix to transform properties in the adiabatic representation to a quasi-diabatic representation and remove the discontinuity near the conical intersection seam. The property matrix elements can then be fit with smooth neural network functions. The coupled potential energy surfaces along with the dipole and spin–orbit coupling surfaces will enable more accurate and complete treatment of optical transitions, as well as nonadiabatic internal conversion and intersystem crossing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Permutation invariant polynomial neural network based diabatic ansatz for the ( E + A ) × ( e + a ) Jahn–Teller and Pseudo-Jahn–Teller systems

In this work, the permutation invariant polynomial neural network (PIP-NN) approach is employed to construct a quasi-diabatic Hamiltonian for system with non-Abelian symmetries. It provides a flexible and compact NN-based diabatic ansatz from the related approach of Williams, Eisfeld, and co-workers. The example of $H^3_+$ is studied, which is an (E + A) × (e + a) Jahn–Teller and Pseudo-Jahn–Teller system. The PIP-NN diabatic ansatz is based on the symmetric polynomial expansion of Viel and Eisfeld, the coefficients of which are expressed with neural network functions that take permutation-invariant polynomials as input. This PIP-NN-based diabatic ansatz not only preserves the correct symmetry but also provides functional flexibility to accurately reproduce ab initio electronic structure data, thus resulting in excellent fits. Further, the adiabatic energies, energy gradients, and derivative couplings are well reproduced. A good description of the local topology of the conical intersection seam is also achieved. Therefore, this diabatic ansatz completes the PIP-NN based representation of DPEM with correct symmetries and will enable us to diabatize even more complicated systems with complex symmetries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Variational neural network approach to QFT in the field basis

We present a variational neural network approach for solving quantum field theories in the field basis, focusing on the free Klein-Gordon model formulated in momentum space. While recent studies have explored neural-network-based variational methods for scalar field theory in position space, a systematic benchmark of the analytically solvable Klein-Gordon ground state—particularly in the momentum-space field basis—has been lacking. In this work, we represent the ground-state wavefunctional as a neural network defined on a discretized set of field configurations and train it by minimizing the Hamiltonian expectation value. This framework enables direct comparison to exact analytic results for a range of key observables, including the ground-state energy, two-point correlators, expectation value of the field, and the structure of the learned wavefunctional itself. Our results provide quantitative diagnostics of accuracy and establish a validated foundation for extending neural-network wavefunctional methods to interacting field theories and position-space formulations.

Klein-Gordon model↗