Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDeep Hamiltonian networks based on symplectic integrators
91
0
0.0
(
0
)
Added by
Pengzhan Jin
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
HNets is a class of neural networks on grounds of physical prior for learning Hamiltonian systems. This paper explains the influences of different integrators as hyper-parameters on the HNets through error analysis. If we define the network target as the map with zero empirical loss on arbitrary training data, then the non-symplectic integrators cannot guarantee the existence of the network targets of HNets. We introduce the inverse modified equations for HNets and prove that the HNets based on symplectic integrators possess network targets and the differences between the network targets and the original Hamiltonians depend on the accuracy orders of the integrators. Our numerical experiments show that the phase flows of the Hamiltonian systems obtained by symplectic HNets do not exactly preserve the original Hamiltonians, but preserve the network targets calculated; the loss of the network target for the training data and the test data is much less than the loss of the original Hamiltonian; the symplectic HNets have more powerful generalization ability and higher accuracy than the non-symplectic HNets in addressing predicting issues. Thus, the symplectic integrators are of critical importance for HNets.
rate research
Read More
The paper deals with numerical discretizations of separable nonlinear Hamiltonian systems with additive noise. For such problems, the expected value of the total energy, along the exact solution, drifts linearly with time. We present and analyze a time integrator having the same property for all times. Furthermore, strong and weak convergence of the numerical scheme along with efficient multilevel Monte Carlo estimators are studied. Finally, extensive numerical experiments illustrate the performance of the proposed numerical scheme.
Generalized Additive Runge-Kutta schemes have shown to be a suitable tool for solving ordinary differential equations with additively partitioned right-hand sides. This work generalizes these GARK schemes to symplectic GARK schemes for additively partitioned Hamiltonian systems. In a general setting, we derive conditions for symplecticeness, as well as symmetry and time-reversibility. We show how symplectic and symmetric schemes can be constructed based on schemes which are only symplectic. Special attention is given to the special case of partitioned schemes for Hamiltonians split into multiple potential and kinetic energies. Finally we show how symplectic GARK schemes can use efficiently different time scales and evaluation costs for different potentials by using different order for these parts.
We investigate the stochastic modified equation which plays an important role in the stochastic backward error analysis for explaining the mathematical mechanism of a numerical method. The contribution of this paper is threefold. First, we construct a new type of stochastic modified equation, which is a perturbation of the Wong--Zakai approximation of the rough differential equation. For a symplectic method applied to a rough Hamiltonian system, the associated stochastic modified equation is proved to have a Hamiltonian formulation. Second, the pathwise convergence order of the truncated modified equation to the numerical method is obtained by techniques in the rough path theory. Third, if increments of noises are simulated by truncated random variables, we show that the one-step error can be made exponentially small with respect to the time step size. Numerical experiments verify our theoretical results.
It is well-known that a numerical method which is at the same time geometric structure-preserving and physical property-preserving cannot exist in general for Hamiltonian partial differential equations. In this paper, we present a novel class of parametric multi-symplectic Runge-Kutta methods for Hamiltonian wave equations, which can also conserve energy simultaneously in a weaker sense with a suitable parameter. The existence of such a parameter, which enforces the energy-preserving property, is proved under certain assumptions on the fixed step sizes and the fixed initial condition. We compare the proposed method with the classical multi-symplectic Runge-Kutta method in numerical experiments, which shows the remarkable energy-preserving property of the proposed method and illustrate the validity of theoretical results.
We explore the construction of new symplectic numerical integration schemes to be used in Hamiltonian Monte Carlo and study their efficiency. Two integration schemes from Blanes et al. (2014), and a new scheme based on optimal acceptance probability, are considered as candidates to the commonly used leapfrog method. All integration schemes are tested within the framework of the No-U-Turn sampler (NUTS), both for a logistic regression model and a student $t$-model. The results show that the leapfrog method is inferior to all the new methods both in terms of asymptotic expected acceptance probability for a model problem and the and efficient sample size per computing time for the realistic models.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
