Abstract
A method for machine learning and serving of discrete field theories in physics is developed. The learning algorithm trains a discrete field theory from a set of observational data on a spacetime lattice, and the serving algorithm uses the learned discrete field theory to predict new observations of the field for new boundary and initial conditions. The approach of learning discrete field theories overcomes the difficulties associated with learning continuous theories by artificial intelligence. The serving algorithm of discrete field theories belongs to the family of structurepreserving geometric algorithms, which have been proven to be superior to the conventional algorithms based on discretization of differential equations. The effectiveness of the method and algorithms developed is demonstrated using the examples of nonlinear oscillations and the Kepler problem. In particular, the learning algorithm learns a discrete field theory from a set of data of planetary orbits similar to what Kepler inherited from Tycho Brahe in 1601, and the serving algorithm correctly predicts other planetary orbits, including parabolic and hyperbolic escaping orbits, of the solar system without learning or knowing Newton’s laws of motion and universal gravitation. The proposed algorithms are expected to be applicable when the effects of special relativity and general relativity are important.
Introduction and statement of the problem
Datadriven methodology has attracted much attention recently in the physics community. This is not surprising since one of the fundamental objectives of physics is to deduce or discover the laws of physics from observational data. The rapid development of artificial intelligence technology begs the question of whether such deductions or discoveries can be carried out algorithmically by computers.
In this paper, I propose a method for machine learning of discrete field theories in physics from observational data. The method also includes an effective algorithm to serve the discrete field theories learned, in terms of predicting new observations.
Machine learning is not exactly a new concept in physics. In particular, the connection between artificial neural networks and dynamical systems has been noticed for decades^{1,2,3,4,5,6,7,8}. What is the new contribution brought by the present study? Most current applications of machine learning techniques in physics roughly fall into the following categories. (i) Using neural networks to model complex physical processes, such as plasma disruptions in magnetic fusion devices^{9,10,11,12}, effective Reynolds stress due to turbulence^{13}, coarsegrained nonlinear effects^{14}, and proper moment closure schemes for fluid systems^{15}. (ii) Solving differential equations in mathematical physics by approximating solutions with neural networks^{16,17,18,19,20,21}. In particular, significant progress has been made in solving Schrödinger’s equation for manybody systems^{22,23}. (iii) Discovering unknown functions or undetermined parameters in governing differential equations^{24,25,26,27,28,29,30,31,32,33}. As a specific example, methods of learning the Hamiltonian function of a canonical symplectic Hamiltonian system were proposed very recently^{34,35,36,37,38,39,40,41}. (iv) Using neural networks to generate sampling data in statistical ensembles for calculating equilibrium properties of physical systems^{42,43,44,45}.
The problem addressed in this paper belongs to a new category. The method proposed learns a field theory from a given set of training data consisting of observed values of a physical field at discrete spacetime locations. The laws of physics are fundamentally expressed in the form of field theories instead of differential equations. It is thus more important to learn the underpinning field theories when possible. Since field theories are in general simpler than the corresponding differential equations, learning field theories is easier, which is true for both human intelligence and artificial intelligence. Except for the fundamental assumption that the observational data are governed by field theories, the learning and serving algorithms proposed do not assume any knowledge of the laws of physics, such as Newton’s law of motion and Schrödinger’s equation. This is different from most existing methodologies of machine learning in physics.
Without loss of generality, let’s briefly review the basics of field theories using the example of firstorder field theory in the space of \( {\text {R}}^{n}\) for a scalar field \(\psi\). A field theory is specified by a Lagrangian density \(L(\psi ,\partial \psi /\partial x^{\alpha }),\) where \(x^{\alpha }\) \((\alpha =1,...,n)\) are the coordinates for \(\mathrm {R}^{n}\). The theory requires that with the value of \(\psi\) fixed at the boundary, \(\psi (x)\) varies with respect to x in such a way that the action of the system
is minimized. Such a requirement of minimization is equivalent to the condition that the following EulerLagrange (EL) equation is satisfied everywhere in \(\mathrm {R}^{n},\),
The problem of machine learning of field theories can be stated as follows:
Problem Statement 1. For a given set of observed values of \(\psi\) on a set of discrete points in \(\mathrm {R}^{n},\) find the Lagrangian density \(L(\psi ,\partial \psi /\partial x^{\alpha })\) as a function of \(\psi\) and \(\partial \psi /\partial x^{\alpha }\), and design an algorithm to predict new observations of \(\psi\) from L.
Now it is clear that learning the Lagrangian density \(L(\psi ,\partial \psi /\partial x^{\alpha })\) is easier than learning the EL equation (2), which depends on \(\psi\) in a more complicated manner than L does. For example, the EL equation depends on secondorder derivatives \(\partial ^{2}\psi /\partial x^{\alpha }\partial x^{\beta }\) and L does not. However, learning L from a given set of observed values of \(\psi\) is not an easy task either for two reasons. Suppose that L is modeled by a neural network. We need to train L using the EL equation, which requires the knowledge of \(\partial ^{2}\psi /\partial x^{\alpha }\partial x^{\beta }.\) For this purpose, we can set up another neural network for \(\psi (x)\), which needs to be trained simultaneously with L. This is obviously a complicated situation. Alternatively, one may wish to calculate \(\partial ^{2}\psi /\partial x^{\alpha }\partial x^{\beta }\) from the training data. But it may not be possible to calculate them with desired accuracy, depending on the nature of the training data. Secondly, even if the optimized neural network for L is known, serving the learned field theory by solving the EL equation with a new set of boundary conditions presents a new challenge. The firstorder derivatives \(\partial \psi /\partial x^{\alpha }\) and secondorder derivatives \(\partial ^{2}\psi /\partial x^{\alpha }\partial x^{\beta }\) are hidden inside the neural network for L, which is nonlinear and possibly deep. Solving differential equations defined by neural networks ventures into uncharted territory.
As will be shown in “Machine learning and serving of discrete field theories” section, reformulating the problem in terms of discrete field theory overcomes both difficulties. Problem Statement 1 will be replaced by Problem Statement 2 in “Machine learning and serving of discrete field theories” section. To learn a discrete field theory, it suffices to learn a discrete Lagrangian density \(L_{d}\), a function with \(n+1\) inputs, which are the values of \(\psi\) at \(n+1\) adjacent spacetime locations. The training of \(L_{d}\) is straightforward. Learning serves the purpose of serving, and the most effective way to serve a field theory with long term accuracy and fidelity is by offering the discrete version of the theory, as has been proven by the recent advances in structurepreserving geometric algorithms^{46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75}. Therefore, learning a discrete field theory directly from the training data and then serving it constitute an attractive approach for discovering physical models by artificial intelligence.
It has long been theorized since Euclid’s study on mirrors and optics that as the most fundamental law of physics, all nature does is to minimize certain actions^{76,77}. But how does nature do that? The machine learning and serving algorithms of discrete field theories proposed might provide a clue, when incorporating the basic concept of the simulation hypothesis by Bostrom^{78}. The simulation hypothesis states that the physical universe is a computer simulation, and it is being carefully examined by physicists as a possible reality^{79,80,81}. If the hypothesis is true, then the spacetime is necessarily discrete. So are the field theories in physics. It is then reasonable, at least from a theoretical point of view, to suggest that some machine learning and serving algorithms of discrete field theories are what the discrete universe, i.e., the computer simulation, runs to minimize the actions.
In “Machine learning and serving of discrete field theories” section, the learning and serving algorithms of discrete field theories are developed. Two examples of learning and predicting nonlinear oscillations in 1D are given in “Examples of learning and predicting nonlinear oscillations” section to demonstrate the method and algorithms. In “Kepler problem” section, I apply the methodology to the Kepler problem. The learning algorithm learns a discrete field theory from a set of observational data for orbits of the Mercury, Venus, Earth, Mars, Ceres, and Jupiter, and the serving algorithm correctly predicts other planetary orbits, including the parabolic and hyperbolic escaping orbits, of the solar system. It is worthwhile to emphasize that the serving and learning algorithms do not know, learn, or use Newton’s laws of motion and universal gravitation. The discrete field theory directly connect the observational data and new predictions. Newton’s laws are not needed.
Machine learning and serving of discrete field theories
In this section, I describe first the formalism of discrete field theory on a spacetime lattice, and then the algorithm for learning discrete field theories from training data and the serving algorithm to predict new observations using the learned discrete field theories. The connection between the serving algorithm and structurepreserving geometric integration methods is highlighted.
To simplify the presentation and without losing generality, the theory and algorithms are given for the example of a firstorder scalar field theory in \(\mathrm {R}^{2}\). One of the dimension will be referred to as time with coordinate t, and the other dimension space with coordinate x. Generalizations to highorder theories and to tensor fields or spinor fields are straightforward.
For a discrete field theory in \(\mathrm {R}^{2}\), the field \(\psi _{i,j}\) is defined on a spacetime lattice labeled by two integer indices (i, j). For simplicity, let’s adopt a rectangular lattice shown in Fig. 1. The first index i identifies temporal grid points, and the second index j spacial grid points. The discrete action \({{\mathcal {A}}}_{d}\) of the system is the summation of discrete Lagrangian densities over all grid cells,
where \(\Delta t\) and \(\Delta x\) are the grid sizes in time and space respectively, and \(L_{d}(\psi _{i,j},\psi _{i+1,j},\psi _{i,j+1})\) is the discrete Lagrangian density of the grid cell whose lower left vertex is at the grid point (i, j). I have chosen \(L_{d}\) to be a function of \(\psi _{i,j}\), \(\psi _{i+1,j}\), and \(\psi _{i,j+1}\) only, which is suitable for firstorder field theories. For instance, in the continuous theory for wave dynamics, the Lagrangian density is
Its counterpart in the discrete theory can be written as
The discrete Lagrangian density \(L_{d}\) defined in Eq. (5) can be viewed as an approximation of the continuous Lagrangian density L in Eq. (4). But I prefer to take \(L_{d}\) as an independent object that defines a discrete field theory.
For the discrete field theory, the condition of minimizing the discrete action \({{\mathcal {A}}}_{d}\) with respect to each \(\psi _{i,j}\) demands
Equation (6) is called Discrete EulerLagrange (DEL) equation for the obvious reason that its continuous counterpart is the EL equation (2) with \(x^{1}=t\) and \(x^{2}=x\). Following the notation of the continuous theory, I also denote the lefthandside of the last equal sign in Eq. (6) by an operator \(EL_{i,j}(\psi ),\) which maps the discrete field \(\psi _{i,j}\) into another discrete field. The DEL equation is employed to solve for the discrete field \(\psi\) on the spacetime lattice when a discrete Lagrangian density \(L_{d}\) is prescribed. This has been the only usage of the DEL equation in the literature that I am aware of so far^{48,49,51,52,53,55,57,58,61,64,68,70,71,72,73,74,75}. I will come back to this shortly.
For the problem posed in the present study, the discrete Lagrangian density \(L_{d}\) is unknown. It needs to be learned from the training data. Specifically, in terms of the discrete field theory, the learning problem discussed in “Introduction and statement of the problem” section becomes:
Problem Statement 2. For a given set of observed data \({\overline{\psi }}_{i,j}\) on a spacetime lattice, find the discrete Lagrangian density \(L_{d}(\psi _{i,j},\psi _{i+1,j},\psi _{i,j+1})\) as a function of \(\psi _{i,j}\), \(\psi _{i+1,j}\), and \(\psi _{i,j+1}\), and design an algorithm to predict new observations of \(\psi _{i,j}\) from \(L_{d}\).
Unlike the difficult situation described in “Introduction and statement of the problem” section for learning a continuous field theory, learning a discrete field theory is straightforward. The algorithm is obvious once the problem is declared as in Problem Statement 2. We set up a function approximation for \(L_{d}\) with three inputs and one output using a neural network or any other approximation scheme adequate for the problem under investigation. The approximation is optimized by adjusting its free parameters to minimize the loss function
on the training data \({\bar{\psi }}\), where I and J are the total number of grid points in time and space respectively. In Problem Statement 2 and the definition of loss function (7), it is implicitly assumed that the training data are available over the entire spacetime lattice. Notice that according to Eqs. (6) and (7), firstorder derivatives of \(L_{d}\) with respect to all three arguments are required to evaluate \(F({\overline{\psi }})\). Automatic differential algorithms^{29}, which have been widely adopted in artificial neural networks, can be applied. To train the neural network or other approximation for \(L_{d},\) established methods, including Newton’s root searching algorithm and the Adam optimizer^{82}, are available.
Once the discrete Lagrangian density \(L_{d}\) is trained, the learned discrete field theory is ready to be served to predict new observations. After boundary conditions are specified, the DEL equation (6) is solved for the discrete field \(\psi _{i,j}\). A firstorder field theory requires two boundary conditions in each dimension. As an illustrative example, let’s assume that \(\psi _{0,j}\) and \(\psi _{1,j}\) are specified for all js, corresponding to two initial conditions at \(t=0,\) and \(\psi _{i,0}\) and \(\psi _{i,1}\) are specified for all is, corresponding to two boundary conditions at \(x=0.\) Under these boundary and initial conditions, the DEL equation (6) can be solved for field \(\psi _{i,j}\) for all is and js as follows.
 Step 1::

Start from the DEL equation at \((i,j)=(1,2),\) i.e., \(EL_{1,2}(\psi )=0,\) which is an algebraic equation containing only one unknown \(\psi _{2,2}.\) Solve \(EL_{1,2}(\psi )=0\) for \(\psi _{2,2}\) using a root searching algorithm, e.g., Newton’s algorithm.
 Step 2::

Move to grid point \((i,j)=(1,3).\) Solve the DEL equation \(EL_{1,3}(\psi )=0\) for the only unknown \(\psi _{2,3}.\)
 Step 3::

Repeat Step 2) with increasing value of j to generate solution \(\psi _{2,j}\) for all js.
 Step 4::

Increase index i to 2. Apply the same procedure in Step 3) for generating \(\psi _{2,j}\) to generate \(\psi _{3,j}\) for all js.
 Step 5::

Repeat Step 4) for \(i=3,4,...,I\) to solve for all \(\psi _{i,j}\).
In a nutshell, the DEL equation at the grid cell labeled by (i, j) (see Fig. 1) is solved as an algebraic equation for \(\psi _{i+1,j}\). This serving algorithm propagates the solution from the initial and boundary conditions to the entire spacetime lattice. It is exactly how the physical field propagates physically. According to the simulation hypothesis, the algorithmic propagation and the physical propagation are actually the same thing. When different types of boundary and initial conditions are imposed, the algorithm needs to be modified accordingly. But the basic strategy remains the same. Specific cases will be addressed in future study.
The above algorithms in \(\mathrm {R}^{2}\) can be straightforwardly generalized to \(\mathrm {R}^{n},\) where the discrete Lagrangian density \(L_{d}\) will be a function of \(n+1\) variables, i.e, \(\psi _{i_{1},i_{2},...,i_{n}}\), \(\psi _{i_{1}+1,i_{2},...,i_{n}}\), \(\psi _{i_{1},i_{2}+1,...,i_{n}}\),......, \(\psi _{i_{1},i_{2},...,i_{n}+1}\). And in a similar way as in \(\mathrm {R}^{2}\), the serving algorithm solves for \(\psi _{i_{1},i_{2},...,i_{n}}\)by propagating its values at the boundaries to the entire lattice. It can also be easily generalized to vector fields or spinor fields, as exemplified in “Kepler problem” section.
It turns out this algorithm to serve the learned discrete field theory is a variational integrator. The principle of variational integrators is to discretize the action and Lagrangian density instead of the associated EL equations. Methods and techniques of variational integrators have been systematically developed in the past decade^{46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75}. The advantages of variational integrators over standard integration schemes based on discretization of differential equations have been demonstrated. For example, variational integrators in general are symplectic or multisymplectic^{48,49,51,52,53,55,57,58,61,64,68,70,71,72,73,74,75}, and as such are able to bound globally errors on energy and other invariants of the system for all simulation timesteps. More sophisticated discrete field theories have been designed to preserve other geometric structures of physical systems, such as the gauge symmetry^{52,75} and Poincaré symmetry^{72,80,81,83}. What proposed in this paper is to learn the discrete field theory directly from observational data and then serve the learned discrete field theory to predict new observations.
Examples of learning and predicting nonlinear oscillations
In this section, I use two examples of learning and predicting nonlinear oscillations in 1D to demonstrate the effectiveness of the learning and serving algorithms. In 1D, the discrete action reduces to the summation of the discrete Lagrangian density \(L_{d}\) over the time grids,
Here, \(L_{d}(\psi _{i},\psi _{i+1})\) is a function of the field at two adjacent time grid points. The DEL equation is simplified to
The training data \({\bar{\psi }}_{i}\) \((i=0,...,I)\) form a time sequence, and the loss function on a data set \(\psi\) is
After learning \(L_{d}\), the serving algorithm will predict a new time sequence for every two initial conditions \(\psi _{0}\) and \(\psi _{1}\). Note that Eq. (9) is an algebraic equation for \(\psi _{i+1}\) when \(\psi _{i1}\) and \(\psi _{i}\) are known. It is an implicit twostep algorithm from the viewpoint of numerical methods for ordinary differential equations. It can be proven^{49,51} that the algorithm exactly preserves a symplectic structure defined by
The algorithm is thus a symplectic integrator, which is able to bound globally the numerical error on energy for all simulation timesteps. Compared with standard integrators which do not possess structurepreserving properties, such as the RungeKutta method, variational integrators deliver much improved longterm accuracy and fidelity.
For each of the two examples, the training data taken by the learning algorithm are a discrete time sequence generated by solving the EL equation of an exact continuous Lagrangian. In 1D, the EL equation is an Ordinary Differential Equation (ODE) in time. Only the training sequence is visible to the learning and serving algorithms, and the EL equation and the continuous Lagrangian are not. After learning the discrete Lagrangian from the training data, the algorithm serves it by predicting new dynamic sequences \(\psi _{i}\) for different initial conditions. The predictions are compared with accurate numerical solutions of the EL equation.
Before presenting the numerical results, I briefly describe how the algorithms are implemented. To learn \(L_{d}(\psi _{i},\psi _{i+1})\), a neural network can be set up. Since it has only two inputs and one output, a deep network may not be necessary. For these two specific examples, the functional approximation for \(L_{d}(\psi _{i},\psi _{i+1})\) is implemented using polynomials in terms of \(s\equiv \psi _{i}+\psi _{i+1}\) and \(d\equiv \psi _{i+1}\psi _{i}\), i.e.,
where \(a_{pq}\) are trainable parameters. For these two examples, I choose \((P,Q)=(4,8)\), and the total number of trainable parameters are 45. For highdimensional or vector discrete field theories, such as the Kepler problem in “Kepler problem” section, deep neural networks are probably more effective.
Example 1
The training data are plotted in Fig. 2 using empty square markers. It is a time sequence \({\bar{\psi }}_{i}\) \((i=0,...,50)\) generated by the nonlinear ODE
with initial conditions \(\psi (t=0)=1.2\) and \(\psi ^{\prime }(t=0)=0.\) Here \(\psi ^{\prime }\) denote \(d\psi /dt\). The Lagrangian density for the system is
The optimizer for training the discrete Lagrangian density \(L_{d}\) is Newton’s algorithm with steplengths reduced according to the amplitude of loss function. The discrete Lagrangian density \(L_{d}\) is trained until the loss function on \({\bar{\psi }}\) is less than \(10^{7}\), then it is served. Plotted in Fig. 2 using solid circle markers are the predicted time sequence \(\psi _{i}\) using the initial conditions of the training data, i.e., \(\psi _{0}={\bar{\psi }}_{0}\) and \(\psi _{1}={\bar{\psi }}_{1}.\) The predicted sequence \(\psi _{i}\) and the training sequence \({\bar{\psi }}_{i}\) are barely distinguishable in the figure.
The learned discrete field theory is then served with two sets of new initial conditions, and the predicted time sequences are plotted using solid circle markers in Figs. 3 and 4 against the time sequences solved for from the nonlinear ODE (13). The predicted sequence in Fig. 3 starts at \(\psi _{0}=0.6\), and its dynamic characteristics is significantly different from that of the sequence in Fig. 2. The predicted sequence in Fig. 4 starts at a much smaller amplitude, i.e., \(\psi _{0}=0.1\), and shows the behavior of linear oscillation, in contrast with the strong nonlinearity of the sequence in Fig. 2 and the mild nonlinearity of the sequence in Fig. 3. The agreement between the predictions of the learned discrete field theory and the accurate solutions of the nonlinear ODE (13) is satisfactory. These numerical results demonstrate that the proposed algorithms for machine learning and serving of discrete field theories are effective in terms of capturing the structure and predicting the dynamical behavior of the physical system.
Example 2
The training data are plotted in Fig. 5 using empty square markers. It is a time sequence \({\bar{\psi }}_{i}\) \((i=0,...,50)\) generated by the nonlinear ODE
with initial conditions \(\psi (t=0)=1.7\) and \(\psi ^{\prime }(t=0)=0.\) The Lagrangian for the system is
where \(V(\psi )\) is a nonlinear potential plotted in Fig. 6. The training sequence represents a nonlinear oscillation in the potential well between \(\psi =\pm 1.6\). The trained discrete Lagrangian density \(L_{d}\) is accepted when the loss function \(F({\overline{\psi }})\) on the training sequence is less than \(10^{7}\). The predicted sequence \(\psi _{i}\) (solid circles in Fig. 5) by the serving algorithm from the learned discrete field theory agrees very well with the training sequence \({\bar{\psi }}_{i}\).
The learned discrete field theory predicts two very different types of dynamical sequences shown in Figs. 7 and 8. The predicted sequences are plotted using solid circle markers and the sequences accurately solved for from the nonlinear ODE (15) are plotted using empty square markers. The sequence predicted in Fig. 7 is a nonlinear oscillation in the small potential well between \(\psi =0.1\) and \(\psi =1.5\) on the right of Fig. 6, and the sequence predicted in Fig. 8 is a nonlinear oscillation in the small potential well between \(\psi =1.3\) and \(\psi =0.1\) on the left. For both cases, the predictions of the learned discrete field theory agree with the accurate solutions. Observe that in Fig. 6 the two small potential wells are secondary to the large potential wall between \(\psi =\pm 1.6\). In Fig. 5 the smallscale fluctuations in the training sequence, which is a nonlinear oscillation in the large potential well, encode the structures of the small potential wells. The training algorithm is able to diagnose and record these fine structures in the learned discrete Lagrangian density, and the serving algorithm correctly predicts the secondary dynamics due to them.
Kepler problem
In this section, to further demonstrate the effectiveness of the method developed, I apply it to the Kepler problem, which is concerned with dynamics of planetary orbits in the solar system. Let's turn the clock back to 1601, when Kepler inherited the observational data of planetary orbits meticulously collected by his mentor Tycho Brahe. It took Kepler 5 years to discover his first and second laws of planetary motion, and another 78 years before Newton solved the Kepler problem using his laws of motion and universal gravitation^{84}. Assume that we have a set of data similar to that of Kepler, as displayed in Fig. 9. For simplicity, the data are the orbits of the Mercury, Venus, Earth, Mars, Ceres and Jupiter generated by solving Newton’s equation of motion for a planet in the gravity field of the Sun according to Newton’s law of universal gravitation. The spatial and temporal normalization scalelengths are 1 a.u. and 58.14 days, respectively, and the timesteps of the orbital data is 0.05.
My goal here is not to rediscover Kepler’s laws of planetary motion or Newton’s laws of motion and universal gravitation by machine learning. Instead, I train a discrete field theory from the orbits displayed in Fig. 9 and then serve it to predict new planetary orbits. For this case, the discrete field theory is about a 2D vector field defined on the time grid. Denote the field as \(\psi _{i}=(x_{i},y_{i})\), where i is the index for the time grid, and \(x_{i}\) and \(y_{i}\) are the 2D coordinates of a planet in the solar system. In terms of the discrete field, the discrete Lagrangian density \(L_{d}\) is a function on \(\mathrm {R}^{4},\)
and the DEL is a vector equation with two components,
The loss function on a data set \(\psi =(x,y)\) is
Akin to the situation in “Examples of learning and predicting nonlinear oscillations” section, the serving algorithms preserves exactly an discrete symplectic form defined by
To model the discrete Lagrangian density \(L_{d}(x_{i},y_{i},x_{i+1},y_{i+1})\), I use a fully connected neural network with two hidden layers, each of which has 40 neurons with the sigmoid activation function. The network is randomly initialized with a normal distribution, and then trained by the Adam optimizer^{82} until the averaged loss on a single time gridpoint is reduced by a factor of \(10^{5}\) relative to its initial value. Starting from the same initial conditions as the training orbits, the serving algorithm of the trained discrete field theory predicts the orbits plotted using red markers in Fig. 10 against the training orbits indicated by green markers. The agreement between the predicted and training orbits shown in the figure validates the discrete field theory learned. To serve it for the purpose of predicting new orbits, let’s consider the scenario of launching a device at the Perihelion of the Earth orbit with an orbital velocity \(v_{p}\) larger than that of the Earth. Four such orbits, labeled by e1, e2, h, and p with \(v_{p}=1.13,\) 1.26, 1.40, and 1.50, are plotted in Fig. 11 along with the orbit of the Earth, which is the inner most ellipse labeled by e0 with \(v_{p}=0.98\). Orbits plotted using red markers are predictions of the trained discrete field theory, and orbits plotted using blue markers are solutions according to Newton’s laws of motion and gravitation. The agreement is satisfactory. Orbits e1 and e2 are elliptical, and Orbit p is the parabolic escaping orbit and Orbit h is the hyperbolic escaping orbit.
Similar study is carried out for the orbits initiated from the Perihelion of the Mercury orbit with an orbital velocities \(v_{p}\) larger than that of the Mercury. Four such orbits are shown in Fig. 12 using the same plotting markers and labels as in Fig. 11. The inner most elliptical orbit is that of the Mercury with \(v_{p}=1.30\). The orbit velocities at the Perihelion of the other four orbits are \(v_{p}=1.56,\) 1.80, 2.07, 2.20. Again, the the predictions of the trained discrete field theory agree well with those of Newton’s laws.
It is noteworthy that the trained discrete field theory correctly predicts the parabolic and hyperbolic escaping orbits, even though the training orbits are all elliptical, see Figs. 9 and 10. Historically, Kepler argued that escaping orbits and elliptical orbits are governed by different laws. It was Newton who discovered or “learned” the 1/r dependency of the gravitational field from Kepler’s laws of planetary motion and Tycho Brahe’s data, and unified the elliptical orbits and escaping orbits under the same law of physics. Newton’s methodology has a deep and longlasting influence on physicists after him. The results displayed in Figs. 11 and 12 show that the machine learning and serving algorithms solve the Kepler problem in terms of correctly prediction planetary orbits without knowing or learning Newton’s laws of motion and universal gravitation.
The algorithms developed are robust against variations of the governing laws of physics, because the method does not require any knowledge of the laws of physics other than the fundamental assumption that the governing laws are field theories. When the effects of special relativity or general relativity are important, the algorithms are expected to be valid as well.
Nevertheless, a few footnotes are in order. (i) There exist small discrepancies between the predictions from the learned discrete field theory and Newton’s laws in Figs. 11 and 12 when \(r=\sqrt{x^{2}+y^{2}}\gtrsim 7\). This is because no training orbit in this domain is provided to the learning algorithm. The orbits predicted there are thus less accurate. To further understand the effect of reduced training data, I remove the orbit of the Ceres from the training data set and then apply the trained discrete Lagrangian to predict orbits initiated from the Perihelion of the Earth orbit as in Fig. 11. The result is displayed in Fig. 13, which shows a larger deviation from the prediction of Newton’s laws compared with Fig. 11. The increased discrepancies are understandable because, without the orbital data of the Ceres, there is no training data covering the space of \(1.8\lesssim r\lesssim 4.5\). This indicates that trained discrete Lagrangian cannot accurately interpolate the gravitational field to regions without training data. On the other hand, without any additional physical assumption, there is no unique way to determine the gravitational field in a region without observational data. For example, this region could be vacuum or other small celestial bodies may exist and modify the gravitational field there. The neural network model of the discrete Lagrangian has the flexibility to learn the gravitational field in the region, whatever it might be, once training data in the region is available. But without the training data, the gravitational field in the region is underdetermined in the neural network model. The calculation based on Newton’s laws implicitly assumes that the region is vacuum. Hence the larger discrepancies. (ii) The study presented above is meant to be a proof of principle. Practical factors, such as the noise of the training data and the threebody effects, are not included. Here, I would like to present a preliminary study on the effect of noise. In the orbital training data displayed in Fig. 9, I now add in a Gaussian noise with zero mean and \(10^{3}\) standard deviation. To denoise, the algorithm first feeds the data through a simple lowpass filter before training the discrete Lagrangian. The parameters of the filter are varied to minimize the loss function. The predictions of the trained discrete Lagrangian for the orbits initiated from the Perihelion of the Earth orbit are shown in Fig. 14. Comparing Figs. 11 and 14, we observe that the Gaussian noise at this level does not alter the predicted orbits substantially. However, the resulting error is not negligible and it is desirable to improve the robustness of the machine learning model against noise. We plan to carry out a systematic study on this topic. Several techniques are being considered. For instance, a noisecanceling signal can be searched to minimize the loss function during the training of the discrete Lagrangian. Generative machine learning models, which have found many applications in physics recently^{23,41,43,85,86}, can be applied for the purpose of denoising as well^{85,87}.
Conclusions and discussion
In this paper, a method for machine learning and serving of discrete field theories in physics is developed. The learning algorithm trains a discrete field theory from a set of observational data of the field on a spacetime lattice, and the serving algorithm employs the learned discrete field theory to predict new observations of the field for given new boundary and initial conditions.
The algorithm does not attempt to capture statistical properties of the training data, nor does it try to discover differential equations that govern the training data. Instead, it learns a discrete field theory that underpins the observed field. Because the learned field theory is discrete, it overcomes the difficulties associated with the learning of continuous theories. Compared with continuous field theories, discrete field theories can be served more easily and with improved longterm accuracy and fidelity. The serving algorithm of discrete field theories belongs to the family of structurepreserving geometric algorithms^{46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75}, which have been proven to be superior to the conventional algorithms based on discretization of differential equations. The demonstrated advantages of discrete field theories relative to continuous theories in terms of machine learning compatibility are consistent with Bostrom’s simulation hypothesis^{78}.
I should point out that in general, a specific machine learning algorithm is often more effective for certain types of data. The data relevant to the present study are assumed to be observations of physical fields in spacetime governed by field theories, even though laws of physics in specific forms, such as Newton’s laws of motion and gravity, are not needed for the algorithms developed in the present study to be effective in terms of correctly predicting observations. Admittedly, the assumption of the existence of an underpinning field theory puts a strong constraint on the applicability of the method. Many physics and engineering problems do not have field theoretical formulations. Most nonconservative systems fall into this category. The algorithms developed in the present study certainly do not apply in these situations. Further investigation is needed to incorporate nonconservative effects.
In addition, the machine learning community has developed large amounts of innovative methods and techniques, many of which can be explored to facilitate the machine learning of discrete field theories. For instance, if a data set is generated by systems governed by different Lagrangians, we can include both the observations and the corresponding discrete Lagrangians as the training data for a generative model^{23,41,43,85,86} using the method of variational autoencoder^{88}. After training, the encoder establishes a map between observations and discrete Lagrangians. And the space of discrete Lagrangian can be continuously sampled to generate new Lagrangians and predict new observations. The generative model can also be utilized to remove noise in the training data, as discussed in “Kepler problem” section.
We plan to pursue these topics in the followup study.
References
Narendra, K. S. & Parthasarathy, K. Identification and control of dynamical systems using neural networks. IEEE Trans. Neural Netw. 1, 4–27 (1990).
Narendra, K. S. & Parthasarathy, K. Neural networks and dynamical systems. Int. J. Approx. Reason. 6, 109–131 (1992).
Ramacher, U. Hamiltonian dynamics of neural networks. Neural Netw. 6, 547–557 (1993).
Howse, J. W., Abdallah, C. T. & Heileman, G. L. Gradient and Hamiltonian dynamics applied to learning in neural networks. Adv. Neural Inf. Process. Syst. 8, 274–280 (1995).
Wilde, P. D. Class of Hamiltonian neural networks. Phys. Rev. E 47, 1392–1396 (1993).
Weinan, E. A proposal on machine learning via dynamical systems. Commun. Math. Stat. 5, 1–11 (2017).
Chen, T. Q., Rubanova, Y., Bettencourt, J. & Duvenaud, D. Neural ordinary differential equations. Adv. Neural Inf. Process. Syst. 31, 6572–6583 (2018).
Haber, E. & Ruthotto, L. Stable architectures for deep neural networks. Inverse Probl. 34, 014004 (2018).
Wroblewski, D., Jahns, G. & Leuer, J. Tokamak disruption alarm based on a neural network model of the highbeta limit. Nucl. Fusion 37, 725–741 (1997).
Vannucci, A., Oliveira, K. & Tajima, T. Forecast of TEXT plasma disruptions using soft x rays as input signal in a neural network. Nucl. Fusion 39, 255–262 (1999).
Yoshino, R. Neuralnet disruption predictor in JT60u. Nucl. Fusion 43, 1771–1786 (2003).
KatesHarbeck, J., Svyatkovskiy, A. & Tang, W. Predicting disruptive instabilities in controlled fusion plasmas through deep learning. Nature 568, 526 (2019).
Wu, J.L., Xiao, H. & Paterson, E. Physicsinformed machine learning approach for augmenting turbulence models: A comprehensive framework. Phys. Rev. Fluids 3, 074602 (2018).
BarSinai, Y., Hoyer, S., Hickey, J. & Brenner, M. P. Learning datadriven discretizations for partial differential equations. Proc. Natl. Acad. Sci. 116, 15344–15349 (2019).
Han, J., Ma, C., Ma, Z. & Weinan, E. Uniformly accurate machine learningbased hydrodynamic models for kinetic equations. Proc. Natl. Acad. Sci. 116, 21983–21991 (2019).
Dissanayake, M. W. M. G. & PhanThien, N. Neuralnetworkbased approximations for solving partial differential equations. Commun. Numer. Methods Eng. 10, 195–201 (1994).
Meade, A. J. Jr. & Fernández, A. A. The numerical solution of linear ordinary differential equations by feedforward neural networks. Math. Comput. Model. 19, 1–25 (1994).
Meade, A. J. Jr. & Fernández, A. A. Solution of nonlinear ordinary differential equations by feedforward neural networks. Math. Comput. Model. 20, 19–44 (1994).
Lagaris, I. E., Likas, A. & Fotiadis, D. I. Artificial neural networks for solving ordinary and partial differential equations. IEEE Trans. Neural Netw. 9, 987–1000 (1998).
BailerJones, C. A. L., MacKay, D. J. C. & Withers, P. J. A recurrent neural network for modelling dynamical systems. Netw. Comput. Neural Syst. 9, 531–547 (1998).
Long, Z., Lu, Y. & Dong, B. PDEnet 2.0: Learning PDEs from data with a numericsymbolic hybrid deep network. J. Comput. Phys. 399, 108925 (2019).
Carleo, G. & Troyer, M. Solving the quantum manybody problem with artificial neural networks. Science 355, 602–606 (2017).
Nomura, Y., Darmawan, A. S., Yamaji, Y. & Imada, M. Restricted boltzmann machine learning for solving strongly correlated quantum systems. Phys. Rev. B 96, 205152 (2017).
Bongard, J. & Lipson, H. Automated reverse engineering of nonlinear dynamical systems. Proc. Natl. Acad. Sci. 104, 9943–9948 (2007).
Schmidt, M. & Lipson, H. Distilling freeform natural laws from experimental data. Science 324, 81–85 (2009).
Brunton, S. L., Proctor, J. L. & Kutz, J. N. Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proc. Natl. Acad. Sci. 113, 3932–3937 (2016).
Rudy, S. H., Brunton, S. L., Proctor, J. L. & Kutz, J. N. Datadriven discovery of partial differential equations. Sci. Adv. 3, e1602614 (2017).
Schaeffer, H. Learning partial differential equations via data discovery and sparse optimization. Proc. R. Soc. A Math. Phys. Eng. Sci. 473, 20160446 (2017).
Baydin, A. G., Pearlmutter, B. A., Radul, A. A. & Siskind, J. M. Automatic differentiation in machine learning: A survey. J. Mach. Learn. Res. 18, 153:1–153:43 (2017).
Raissi, M. Deep hidden physics models: Deep learning of nonlinear partial differential equations. J. Mach. Learn. Res. 19, 1–24 (2018).
Cranmer, M. D., Xu, R., Battaglia, P. & Ho, S. Learning symbolic physics with graph networks. Preprint at arXiv:1909.05862v2 (2019).
Gelß, P., Klus, S., Eisert, J. & Schßtte, C. Multidimensional approximation of nonlinear dynamical systems. J. Comput. Nonlinear Dyn. 14, 061006 (2019).
Raissi, M., Perdikaris, P. & Karniadakis, G. Physicsinformed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J. Comput. Phys. 378, 686–707 (2019).
Wu, K., Qin, T. & Xiu, D. Structurepreserving method for reconstructing unknown Hamiltonian systems from trajectory data. Preprint at arXiv:1905.10396v1 (2019).
Lutter, M., Ritter, C. & Peters, J. Deep Lagrangian networks: Using physics as model prior for deep learning. Preprint at arXiv:1907.04490v1 (2019).
Bertalan, T., Dietrich, F., Mezić, I. & Kevrekidis, I. G. On learning Hamiltonian systems from data. Preprint at arXiv:1907.12715v2 (2019).
Greydanus, S., Dzamba, M. & Yosinski, J. Hamiltonian neural networks. Preprint at arXiv:1906.01563v3 (2019).
Zhong, Y. D., Dey, B. & Chakraborty, A. Symplectic ODEnet: Learning Hamiltonian dynamics with control. Preprint at arXiv:1909.12077v1 (2019).
SanchezGonzalez, A., Bapst, V., Cranmer, K. & Battaglia, P. Hamiltonian graph networks with ODE integrators. Preprint at arXiv:1909.12790v1 (2019).
Chen, Z., Zhang, J., Arjovsky, M. & Bottou, L. Symplectic recurrent neural networks. Preprint at arXiv:1909.13334v1 (2019).
Toth, P. et al. Hamiltonian generative networks. Preprint at arXiv:1909.13789v1 (2019).
Shanahan, P. E., Trewartha, D. & Detmold, W. Machine learning action parameters in lattice quantum chromodynamics. Phys. Rev. D 97, 094506 (2018).
Noé, F., Olsson, S., Köhler, J. & Wu, H. Boltzmann generators: Sampling equilibrium states of manybody systems with deep learning. Science 365, eaaw1147 (2019).
Halverson, J., Nelson, B. & Ruehle, F. Branes with brains: Exploring string vacua with deep reinforcement learning. J. High Energy Phys. 2019, 3 (2019).
Cranmer, K., Golkar, S. & Pappadopulo, D. Inferring the quantum density matrix with machine learning. Preprint at arXiv:1904.05903v1 (2019).
Feng, K. On difference schemes and sympletic geometry. In The Proceedings of 1984 Beijing Symposium on Differential Geometry and Differential Equations (ed. Feng, K.), 42–58 (Science Press, 1985).
SanzSerna, J. M. & Calvo, M. P. Numerical Hamiltonian Problems (Chapman and Hall, London, 1994).
Marsden, J. E., Patrick, G. W. & Shkoller, S. Multisymplectic geometry, variational integrators, and nonlinear pdes. Commun. Math. Phys. 199, 351–395 (1998).
Marsden, J. E. & West, M. Discrete mechanics and variational integrators. Acta Numerica 10, 357–514 (2001).
Hairer, E., Lubich, C. & Wanner, G. Geometric Numerical Integration: Structurepreserving Algorithms for Ordinary Differential Equations Vol. 31 (Springer, Berlin, 2006).
Qin, H. & Guan, X. Variational symplectic integrator for longtime simulations of the guidingcenter motion of charged particles in general magnetic fields. Phys. Rev. Lett. 100, 035006 (2008).
Squire, J., Qin, H. & Tang, W. M. Geometric integration of the VlasovMaxwell system with a variational particleincell scheme. Phys. Plasmas 19, 084501 (2012).
Xiao, J., Liu, J., Qin, H. & Yu, Z. A variational multisymplectic particleincell algorithm with smoothing functions for the VlasovMaxwell system. Phys. Plasmas 20, 102517 (2013).
Zhang, R. et al. Canonicalization and symplectic simulation of the gyrocenter dynamics in timeindependent magnetic fields. Phys. Plasmas 21, 032504 (2014).
Zhou, Y., Qin, H., Burby, J. W. & Bhattacharjee, A. Variational integration for ideal magnetohydrodynamics with builtin advection equations. Phys. Plasmas 21, 102109 (2014).
He, Y. et al. Hamiltonian time integrators for VlasovMaxwell equations. Phys. Plasmas 22, 124503 (2015).
Xiao, J., Liu, J., Qin, H., Yu, Z. & Xiang, N. Variational symplectic particleincell simulation of nonlinear mode conversion from extraordinary waves to Bernstein waves. Phys. Plasmas 22, 092305 (2015).
Ellison, C. L., Finn, J. M., Qin, H. & Tang, W. M. Development of variational guiding center algorithms for parallel calculations in experimental magnetic equilibria. Plasma Phys. Control. Fusion 57, 054007 (2015).
Qin, H. et al. Canonical symplectic particleincell method for longterm largescale simulations of the VlasovMaxwell equations. Nucl. Fusion 56, 014001 (2016).
He, Y., Sun, Y., Qin, H. & Liu, J. Hamiltonian particleincell methods for VlasovMaxwell equations. Phys. Plasmas 23, 092108 (2016).
Xiao, J. et al. Explicit highorder noncanonical symplectic algorithms for ideal twofluid systems. Phys. Plasmas 23, 112107 (2016).
Zhang, R. et al. Explicit symplectic algorithms based on generating functions for charged particle dynamics. Phys. Rev. E 94, 013205 (2016).
Wang, Y., Liu, J. & Qin, H. Lorentz covariant canonical symplectic algorithms for dynamics of charged particles. Phys. Plasmas 23, 122513 (2016).
Xiao, J., Qin, H., Liu, J. & Zhang, R. Local energy conservation law for a spatiallydiscretized Hamiltonian VlasovMaxwell system. Phys. Plasmas 24, 062112 (2017).
Burby, J. W. Finitedimensional collisionless kinetic theory. Phys. Plasmas 24, 032101 (2017).
Chen, Q. et al. Canonical symplectic structure and structurepreserving geometric algorithms for SchrödingerMaxwell systems. J. Comput. Phys. 349, 441–452 (2017).
He, Y., Zhou, Z., Sun, Y., Liu, J. & Qin, H. Explicit k symplectic algorithms for charged particle dynamics. Phys. Lett. A 381, 568–573 (2017).
Burby, J. W. & Ellison, C. L. Toroidal regularization of the guiding center Lagrangian. Phys. Plasmas 24, 110703 (2017).
Kraus, M., Kormann, K., Morrison, P. J. & Sonnendrücker, E. GEMPIC: geometric electromagnetic particleincell methods. J. Plasma Phys. 83, 905830401 (2017).
Xiao, J., Qin, H. & Liu, J. Structurepreserving geometric particleincell methods for VlasovMaxwell systems. Plasma Sci. Technol. 20, 110501 (2018).
Ellison, C. L. et al. Degenerate variational integrators for magnetic field line flow and guiding center trajectories. Phys. Plasmas 25, 052502 (2018).
Xiao, J., Qin, H., Shi, Y., Liu, J. & Zhang, R. A lattice Maxwell system with discrete space–time symmetry and local energy–momentum conservation. Phys. Lett. A 383, 808–812 (2019).
Xiao, J. & Qin, H. Field theory and a structurepreserving geometric particleincell algorithm for drift wave instability and turbulence. Nucl. Fusion 59, 106044 (2019).
Xiao, J. & Qin, H. Explicit highorder gaugeindependent symplectic algorithms for relativistic charged particle dynamics. Comput. Phys. Commun. 241, 19–27 (2019).
Glasser, A. S. & Qin, H. The geometric theory of charge conservation in particleincell simulations. J. Plasma Phys. 86, 835860303 (2020).
de Maupertuis, P. Accord de différentes lois de la nature qui avaient jusqu’ici paru incompatibles. Mém. As. Sc. Paris 417 (1744).
de Maupertuis, P. Le lois de mouvement et du repos, déduites d’un principe de métaphysique. Mém. Ac. Berlin 267 (1746).
Bostrom, N. Are we living in a computer simulation?. Philos. Quart. 53, 243–255 (2003).
Beane, S. R., Davoudi, Z. & Savage, M. J. Constraints on the universe as a numerical simulation. Eur. Phys. J. A 50, 148 (2014).
Glasser, A. S. & Qin, H. Lifting spacetime’s Poincaré symmetries. Preprint at arXiv:1902.04395v1 (2019).
Glasser, A. S. & Qin, H. Restoring Poincaré symmetry to the lattice. Preprint at arXiv:1902.04396v1 (2019).
Kingma, D. P. & Ba, J. Adam: A method for stochastic optimization. Preprint at arXiv:1412.6980v9 (2014).
Davoudi, Z. & Savage, M. J. Restoration of rotational symmetry in the continuum limit of lattice field theories. Phys. Rev. D 86, 054505 (2012).
Newton, I. The Mathematical Papers of Isaac Newton, Volume IV, 1684–1691 (Cambridge University Press, Cambridge, 2008).
Schawinski, K., Zhang, C., Zhang, H., Fowler, L. & Santhanam, G. K. Generative adversarial networks recover features in astrophysical images of galaxies beyond the deconvolution limit. Monthly Notices of the Royal Astronomical Society: Letters slx008 (2017).
Cerri, O., Nguyen, T. Q., Pierini, M., Spiropulu, M. & Vlimant, J.R. Variational autoencoders for new physics mining at the large hadron collider. J. High Energy Phys. 2019, 36 (2019).
Yang, Q. et al. Lowdose CT image denoising using a generative adversarial network with Wasserstein distance and perceptual loss. IEEE Trans. Med. Imaging 37, 1348–1357 (2018).
Doersch, C. Tutorial on variational autoencoders. Preprint at arXiv:1606.05908v2 (2016).
Acknowledgements
This research was supported by the U.S. Department of Energy (DEAC0209CH11466). I thank Alexander S. Glasser, Yichen Fu, Michael Churchill, George Wilkie, and Nick McGreivy for fruitful discussions.
Author information
Authors and Affiliations
Contributions
H.Q. as a single author carried out all the work.
Corresponding author
Ethics declarations
Competing interests
The author declares no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Qin, H. Machine learning and serving of discrete field theories. Sci Rep 10, 19329 (2020). https://doi.org/10.1038/s41598020763010
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598020763010
This article is cited by

Approximation of nearlyperiodic symplectic maps via structurepreserving neural networks
Scientific Reports (2023)

Evolutionary Symbolic Regression from a Probabilistic Perspective
SN Computer Science (2022)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.