NN-Poly: Approximating common neural networks with Taylor polynomials to imbue dynamical system constraints

1 Introduction

Neural networks have emerged as general-purpose regression models and revolutionized fields such as computer vision and machine translation, where occasional errors are less likely to jeopardize human lives. To extend deep neural networks (NNs) to dynamic system applications of high consequence while retaining predictive capabilities, neural networks should be verifiable and conform to physical laws. The original dynamical system adheres to physical laws but the exact form of the dynamical system’s transition model is not known. A neural network excels in learning a representation of the transition model but this representation can disagree with physical laws, even within the bounds of training as the learned features are agnostic/uninformed of the physical laws but particularly outside bounds of training due to lack of generalization. Furthermore, measurement (input) uncertainty or disturbance gives rise to a state prediction that is inaccurate; garbage in—garbage out. For example, if a camera obscurant leads to an incorrect state estimate (not propagating position) while other sensors continue to propagate, a physically uninformed model will incorporate anomalous sensor reading in generating a physically infeasible state prediction. Restructuring a neural network or transforming the NN to a different abstraction could ensure that the model output adheres to physical laws as the original system that generated the data does.

An ideal, interpretable solution leverages the power of neural networks and incorporates physics through 1) trust: safety guarantees in the output prediction and algorithm behavior, 2) causality: deriving relationships between the input and the output, and 3) information: analyzing the abstraction learned from the neural network and inferring system characteristics from the learned parameters and relationships (Lipton, 2018). Trust, or safety, can come in the form of adhering to constraints set by the user to mitigate the impact of a disturbance spike in the input signal on the model prediction. Added domain information in the way of physical laws could counter undesirable behavior. Furthermore, adding constraints has the added benefit that the user imposing some user-defined information into the prediction; that is, there is some component of that system that the user can explain and guarantee in behavior. Causality may be captured by tracing the contribution of an input to output, for which causality in a set of linear equations is very straightforward to correlate contribution from the coefficient matrix in analysis, whereas nesting layers within a neural network is less obvious in drawing input/output casual relationships (saliency maps). Information can include the number of parameters/terms in a model, the familiarity of bases, and the existence of another abstraction: “Computing a tractable function model from the original model can also be viewed as a form of knowledge distillation from the verification perspective, as the function model should be able to produce comparable results or replicate the outputs of the target neural network on specific inputs” (Huang et al., 2019).

This article’s contribution is to solve the system identification or state prediction problem by constructing a mapping from an NN function to a polynomial function from which users can more easily infer behavior (information and causality) and handle changes in constraints (trust). The proposed method approximates a trained NN function of various common architectures (fully connected perceptron, convolution, and recurrent) into a system of linear differential equations in polynomial basis space. As neural networks are universal approximators, the derivation assumes that the general NN structure approximates the system mapping well (Hornik et al., 1989; Pinkus, 1999). The final form of the representation used to approximate the NN is a set of matrix equations with polynomial entries. Constraints or invariant quantities derived from physical laws may then be applied to offer safety and viability to the system dynamics. The polynomial approximation of neural networks is a straightforward mapping, executes in real-time, requires minimal data storage, and limits overfitting by limiting the polynomial expression power. Both the neural network and polynomial abstraction increase the interpretability of the dynamic system that generated the data.

Linear models, the simplest polynomial, are a favored abstraction over neural networks by scientists for their familiarity and analytic traceability. A polynomial basis is capable of expressing nonlinear relationships with a linear model. Polynomials are more computationally tractable, which enables verification (Sidrane et al., 2022). Their analytic traceability enables theoretical guarantees, inference rules (Dutta et al., 2019), and analysis (Lyapunov stability and coefficient stability). In polynomial space, users may apply safety criteria or domain knowledge in the context of constraints, invariant physical quantities, input/output relations, and continuity or bounded sensitivity properties (Narasimhamurthy et al., 2019). The polynomial form appears in many physical contexts (energy, heat transfer, and friction), which may be applied to the approximation as domain knowledge or safety constraints, and could inform scientists of the underlying physical system characteristics.

There is value in obtaining both the universal (NN) approximation and a polynomial representation. Polynomials and NNs with polynomial activation functions are not universal approximators like NNs with sigmoid or tanh activation functions are (Hornik et al., 1989). A generic dataset generated by a dynamic system does not guarantee a sum of squares polynomial solution, which is why a neural network universal approximation is necessary in capturing the transition model from the dynamic data (Ahmadi and Parrilo, 2011). Deep NNs train a non-convex optimization problem, where the constraints do not usually make the solution more tractable as the training protocol typically uses a stochastic gradient search in the first place. Turning the mapping for the dynamics into a polynomial imposes the dynamics as a constraint to be semi-algebraic (i.e., p(x) > = 0 or p(x) = 0, including many other polynomial constraints). Semi-algebraic optimization has new powerful results (e.g., sum-of-squares and moment sequences) that allow the highly non-convex optimization program to be converted to an iterative set of semi-definite programs (SDPs) that converge to the global minima. This article’s optimization solution provides the initial mapping for the dynamics represented as a polynomial constraint. Tools, like semi-definite programs, make such optimization problems tractable.

The proposed method advances upon previous methods (Ferrari et al., 2013; Ferrari and Stengel, 2005) by deriving a polynomial abstraction of a trained neural network that is capable of incorporating knowledge and constraints into state prediction by solving the end-to-end polynomial function and constraints simultaneously. Outputs, like a state prediction, can be constrained to adhere to guarantees if the function is polynomial form, whereas neural networks traditionally lack that ability (Rudy et al., 2017; Lagaris et al., 1998; Psichogios and Ungar, 1992). Recently, a class of neural networks ingrain physics directly into the neural network structure, like PINNs (Raissi et al., 2019; Wang et al., 2022), Lagrangian/Hamiltonian NNs (Cranmer et al., 2020; Greydanus et al., 2019), neural ODEs (Djeumou et al., 2022), and deep Markov models (Liu et al., 2022). A difference in our proposed work lies in when the imposition of physics occurs: physics-guided NNs during training and NN-Poly post-training. Our work also differs from strictly learning a polynomial directly from data as we learn a polynomial from a neural network. Furthermore, the polynomial that results from this approach does not have to adhere to the properties of a Lyapunov function as is the case in learning homogenous polynomial Lyapunov functions, in that V(x) does not need to be strictly positive and $\dot{V}(x)$ does not need to be strictly negative, where V is traditionally a function of energy (Ahmadi and Parrilo, 2011). While for some state definitions and systems, this form may be the most convenient form that is ultimately used, we do not impose that form in our formulation. The constraint equations that are used may not use energy and may use momentum or distance.

The following sections detail the derivation to approximate a neural network model by transforming the trained NN parameters into coefficients of polynomial form. The derivation consists of four general steps detailed in Sections 2–5:

• Section 2 derives a general Taylor series expansion for a vector function in vector domain (i.e., tensor form) from a trained NN model; higher than second-order derivatives are tensor derivatives.

• Section 3 simplifies tensor derivatives and states to matrix and vector form. An important contribution of this article is unfolding the tensor derivatives into a matrix form and the tensor states into a vector form, which results in matrix manipulability and computation savings.

• Section 4 rewrites the general Taylor series expansion, containing tensor derivatives into Taylor series expansion with only matrix and vector form derivatives. The Taylor series expansion with only matrix and vector form derivatives is desirable because modern scientific programming languages are optimized for vectorized computations. The Taylor series expansion can be presented as an expression in a polynomial form, mapping inputs to outputs. Coefficients of each polynomial entry are derived, and the subsequent dynamic system that the NN approximates can be interpreted.

• Section 5 extends the single-layer polynomial approximation to a multi-layer network, resulting in a polynomial that represents an arbitrarily deep network.

The remaining article sections give context as to how to apply this methodology and show results for simulated dynamic systems.

• Section 6 relates physical constraints for Newtonian dynamics to semi-algebraic constraints that can be applied to the output of the polynomial approximated function.

• Section 7 demonstrates how to solve for state prediction simultaneously with the proposed constraints.

• Section 8 analyzes the proposed NN-extracted polynomial method under various cases. Results show high accuracy and efficiency when dealing with test cases; we discuss how to extend NN-Poly to various other cases.

2 Problem formulation: Taylor expansion of a neural network

Representing the NN model as a Taylor polynomial involves two steps. First, a Taylor expansion of vector function f must be derived in state vector domain x. The input to the NN model is the state vector at some time step, x_k. The output of the NN model is either the state vector at the next time step, x_k+1, or the derivative of the state vector, ${\dot{\mathit{x}}}_k$. The expansion includes various dimensions of tensors and redundant multinomial cross terms. Next, the general derivatives of a neural network are derived in tensor form. The two efforts together produce the final polynomial coefficients for the Taylor polynomial. To validate the method and offer context for other methods, the last section offers a comparison of model fidelity and computation to other numerical system identification methods.

Given a vector input x ∈ R^m×1 and output y ∈ R^n×1, a function f maps the input state to the output state f(x): R^m×1 → R^n×1. Assume the function f(⋅) is a smooth, continuous vector function, where all derivatives with respect to x exist and are smooth.

$\mathit{y}=\mathit{f}\left(\mathit{x}\right)(1)$

Given the training pairs (x, y), a neural network predicts ${\widehat{\mathit{y}}}_{NN}$ with a mapping f_NN(W, b, x), given in Eq. 2 where the notation of a hat $\widehat{(\cdot )}$ signifies a prediction of the variable. The learned parameters are W and b in the neural network.

${\widehat{\mathit{y}}}_{NN}={\mathit{f}}_{NN}\left(W,\mathit{b},\mathit{x}\right)(2)$

A polynomial p(x) in the form of a Taylor expansion approximates the neural network for which the order of the polynomial d that approximates the NN is defined by the NN structure (Rolnick and Tegmark, 2017). The polynomial output ${\widehat{\mathit{y}}}_p$ is given in Eq. 3, where the expression consists of polynomial coefficients \{a₀, A¹, …, A^d\}.

${\widehat{\mathit{y}}}_p≔\mathit{p}\left(\mathit{x}\right)=a_0+A^1\odot \mathit{x}+\frac{1}{2!}{A}^2\odot {\mathit{x}}^{2\otimes }+\cdots +\frac{1}{d!}{A}^d\odot {\mathit{x}}^{d\otimes }(3)$

The goal is to find coefficients a of a polynomial expression that minimizes the error relative to the neural network model, defined by the cost function, C, given in Eq. 4 where the coefficients are the set a = {a₀, A¹, …, A^d}.

$C^{\ast }=\underset{a}{\mathrm{argmin}}\Vert {\mathit{f}}_{NN}\left(W,\mathit{b},\mathit{x}\right)-\mathit{p}\left(\mathit{x},a,d\right)\Vert (4)$

The polynomial form is a terminal form of the Taylor expansion, given in Eq. 5, where the kth partial derivative of function f is given by $\frac{{\partial }^k\mathit{f}}{\partial {\mathit{x}}^k}$, analogously the Jacobian term, $J_f^k$. The polynomial terminates at order d, and the remaining higher order terms are captured in R(x).

$\begin{array}{c}\hfill \mathit{f}\left(\mathit{x}\right)=\mathit{f}\left(\mathbf{0}\right)+\frac{\partial \mathit{f}}{\partial \mathit{x}}\odot \mathit{x}+\frac{{\partial }^2\mathit{f}}{\partial {\mathit{x}}^2}\odot {\mathit{x}}^{2\otimes }+\cdots +\mathit{R}\left(\mathit{x}\right)=\mathit{f}\left(\mathbf{0}\right)+J_f^1\left(\mathbf{0}\right)\mathit{x}+\frac{1}{2!}{J}_f^2\left(\mathbf{0}\right)\odot {\mathit{x}}^{2\otimes }+\cdots +\mathit{R}\left(\mathit{x}\right)\end{array}(5)$

The outer product ⊗ is used in this manuscript to exponentiate a vector, for which an exponentiated vector equation example is given in Eq. 6 and the index notation in Eq. 7, adopted from Granados (2015).

${\mathit{x}}^{3\otimes }≔\mathit{x}\otimes \mathit{x}\otimes \mathit{x}(6)$

${\left(\mathit{x}\otimes \mathit{x}\otimes \mathit{x}\right)}_{\mathit{ijk}}=x_i{x}_j{x}_k(7)$

The inner product ⊙ is used in this manuscript to multiply the function derivatives with the exponentiated states, for which index notation is given in Eq. 8, adopted from Granados (2015).

$J_f^2\odot {\mathit{x}}^{2\otimes }=\sum _i\sum _j{J}_{\mathit{ijk}}^2{\mathit{x}}_{ij}^{2\otimes }(8)$

The polynomial expression is a vectorial series defined with Jacobian terms and exponentiated state vector terms in Eq. 9, where the expansion is expressed in a summation over d + 1 Jacobian terms. For simplicity, the expansion is about the zero state, assuming x₀ = 0, which simplifies the lower dimension terms. Note the equivalency of Eqs 3, 9.

$\begin{array}{cc}\hfill \mathit{p}\left(\mathit{x}\right)& =\sum _{k=0}^d\frac{J_f^k\left({\mathit{x}}_0\right)}{k!}\odot {\left(\mathit{x}-{\mathit{x}}_0\right)}^{k\otimes }\hfill \\ \hfill & ≔\sum _{k=0}^d\frac{1}{k!}{A}^k\odot {\left(\mathit{x}-{\mathit{x}}_0\right)}^{k\otimes }\hfill \end{array}(9)$

Although Eq. 5 is elegant and may be able to derive a closed-form expression for the original function, the subsequent derivative terms incrementally increase in dimension, seen in Eq. 10.

$\begin{array}{cc}\hfill \mathit{f}\left(\mathit{x}\right)& =\left[\begin{array}{c}\hfill f_1\left({\mathit{x}}_{\mathbf{0}}\right)\hfill \\ \hfill f_2\left({\mathit{x}}_{\mathbf{0}}\right)\hfill \\ \hfill ⋮\hfill \\ \hfill f_n\left({\mathit{x}}_{\mathbf{0}}\right)\hfill \end{array}\right]+\left[\begin{array}{cccc}\hfill \frac{\partial f_1}{\partial x_1}\hfill & \hfill \frac{\partial f_1}{\partial x_2}\hfill & \hfill \cdots \hfill & \hfill \frac{\partial f_1}{\partial x_m}\hfill \\ \hfill \frac{\partial f_2}{\partial x_1}\hfill & \hfill \frac{\partial f_2}{\partial x_2}\hfill & \hfill \cdots \hfill & \hfill \frac{\partial f_2}{\partial x_m}\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill \frac{\partial f_n}{\partial x_1}\hfill & \hfill \frac{\partial f_n}{\partial x_2}\hfill & \hfill \cdots \hfill & \hfill \frac{\partial f_n}{\partial x_m}\hfill \end{array}\right]\odot \left[\begin{array}{c}\hfill x_1\hfill \\ \hfill x_2\hfill \\ \hfill ⋮\hfill \\ \hfill x_m\hfill \end{array}\right]\hfill \\ \hfill & +\frac{1}{2!}\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill \frac{{\partial }^2{f}_1}{\partial x_1^2}\hfill & \hfill \frac{{\partial }^2{f}_1}{\partial x_2\partial x_1}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_1}{\partial x_m\partial x_1}\hfill \\ \hfill \frac{{\partial }^2{f}_2}{\partial x_1^2}\hfill & \hfill \frac{{\partial }^2{f}_2}{\partial x_2\partial x_1}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_2}{\partial x_m\partial x_1}\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill \frac{{\partial }^2{f}_n}{\partial x_1^2}\hfill & \hfill \frac{{\partial }^2{f}_n}{\partial x_2\partial x_1}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_n}{\partial x_m\partial x_1}\hfill \end{array}\right],\dots ,\left[\begin{array}{cccc}\hfill \frac{{\partial }^2{f}_1}{\partial x_1\partial x_m}\hfill & \hfill \frac{{\partial }^2{f}_1}{\partial x_2\partial x_m}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_1}{\partial x_m^2}\hfill \\ \hfill \frac{{\partial }^2{f}_2}{\partial x_1\partial x_m}\hfill & \hfill \frac{{\partial }^2{f}_2}{\partial x_2\partial x_m}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_2}{\partial x_m^2}\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill \frac{{\partial }^2{f}_n}{\partial x_1\partial x_m}\hfill & \hfill \frac{{\partial }^2{f}_n}{\partial x_2\partial x_m}\hfill & \hfill \cdots \hfill & \hfill \frac{{\partial }^2{f}_n}{\partial x_m^2}\hfill \end{array}\right]\hfill \end{array}\right]\odot \left[\begin{array}{cccc}\hfill x_1^2\hfill & \hfill x_1{x}_2\hfill & \hfill \cdots \hfill & \hfill x_1{x}_m\hfill \\ \hfill x_2{x}_1\hfill & \hfill x_2^2\hfill & \hfill \cdots \hfill & \hfill x_2{x}_m\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill x_m{x}_1\hfill & \hfill x_m{x}_2\hfill & \hfill \cdots \hfill & \hfill x_m^2\hfill \end{array}\right]\hfill \\ \hfill & +\cdots +\mathit{R}\left(\mathit{x}\right)\hfill \end{array}.(10)$

Instead, we would like a set of linear equations that simply solves for the polynomial coefficients with a single matrix operation, given in Eq. 11. To transform the various tensors into a set of linear equations, the derivative tensor terms must be unfolded and compressed into matrices and vectors to achieve the desired form, given in Eq. 11, described in the following sections.

$\mathit{f}\left(\mathit{x}\right)=\left[\begin{array}{ccccccccccc}\hfill f_1\left({\mathit{x}}_{\mathbf{0}}\right)\hfill & \hfill \left(\frac{\partial f_1}{\partial x_1}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{\partial f_1}{\partial x_m}\right)\hfill & \hfill \left(\frac{{\partial }^2{f}_1}{\partial x_1^2}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{{\partial }^2{f}_1}{\partial x_1\partial x_m}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{{\partial }^2{f}_1}{\partial x_m^2}\right)\hfill & \hfill \cdots \hfill & \hfill \left(R_1\left({\mathit{x}}^{k\otimes }\right)\right)\hfill \\ \hfill \hfill & \hfill \hfill & \hfill \hfill & \hfill \hfill & \hfill \hfill & \hfill ⋮\hfill \\ \hfill f_n\left({\mathit{x}}_{\mathbf{0}}\right)\hfill & \hfill \left(\frac{\partial f_n}{\partial x_1}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{\partial f_n}{\partial x_m}\right)\hfill & \hfill \left(\frac{{\partial }^2{f}_n}{\partial x_1^2}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{{\partial }^2{f}_n}{\partial x_1\partial x_m}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\frac{{\partial }^2{f}_n}{\partial x_m^2}\right)\hfill & \hfill \cdots \hfill & \hfill \left(R_n\left({\mathit{x}}^{k\otimes }\right)\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill 1\hfill \\ \hfill x_1\hfill \\ \hfill ⋮\hfill \\ \hfill x_m\hfill \\ \hfill \frac{1}{2!}{x}_1^2\hfill \\ \hfill ⋮\hfill \\ \hfill \frac{2}{2!}{x}_1{x}_m\hfill \\ \hfill ⋮\hfill \\ \hfill \frac{1}{2!}{x}_m^2\hfill \\ \hfill ⋮\hfill \\ \hfill 1\hfill \end{array}\right](11)$

3 Unfolding and compressing tensors into matrices and vectors

The tensor equation that approximates the original function may be collapsed into a set of linear equations, consisting of a coefficient matrix and state vector, a useful form for a linear least square solution or semi-algebraic optimization. Exponentiated states of order higher than two are in the form of tensors and contain redundant multinomial terms as they are symmetric. By analogy, the upper triangular part of a symmetric matrix contains all of its unique values. To unfold and reshape the high dimensional tensors to matrices and vectors, the tensor indices of each higher dimension has a relationship to a single index in the vector and the matrix. The derivation may be intuited visually. The columns of the upper triangular matrix are sequentially appended to a vector, seen in Figure 1A. This process is extended to symmetric tensors, Figure 1B, to yield the augmented state vector.

FIGURE 1

FIGURE 1. (A) Unfolding an upper triangular matrix into a vector. (B) Unfolding a tensor into a vector. (C) Reduction ratio between number of reductions and number of full terms. The blue and orange arrows represent the movement of the reduction ratio curve at two extremes: blue as the state vector dimension approaches infinity; orange as the state vector dimension approaches one.

By grouping redundant multinomial cross terms together into a coefficient vector, the input vector contains only the unique states. The first step is gathering redundant state terms in the same equation, highlighted (Eq. 12). The desired matrix equation, (Eq. 11), of the tensor equation yields the same set of linear equations, yet reduces the number of total state terms and is in a more useful representation. The augmented state vector in Eq. 11 contains scalar coefficients, which represent the number of redundant terms in the multinomial expansion of the state. These scalar coefficients are separated into a new coefficient vector. Defining this new coefficient vector is necessary to reform the exponentiated states into a state vector of only unique states and in the process reveals the reduction in computation by using only unique states. For intuition, the unique multinomial state vector of third order is ${\tilde{\mathit{x}}}^{\otimes 3}$, given in Eq. 13, where the addition of the tilde annotates that the uniqueness operation has been performed on the original state vector x^⊗3. The corresponding multinomial coefficient vector, a³, contains respective coefficients, representing the combinatorial number of redundant multinomial states, given in Eq. 14.

$\mathit{f}(\mathit{x})=\left[\begin{array}{c}\hfill \begin{array}{c}{f}_1({\mathit{x}}_{\mathbf{0}})+\left(\frac{\partial f_1}{\partial x_1}{x}_1+\frac{\partial f_1}{\partial x_2}{x}_2+\cdots +\frac{\partial f_1}{\partial x_m}{x}_m\right)+\cdots \hfill \\ +\frac{1}{2!}\left[\left(\frac{{\partial }^2{f}_1}{\partial x_1^2}{x}_1^2+\frac{{\partial }^2{f}_1}{\partial x_2\partial x_1}{x}_2{x}_1+\cdots +\frac{{\partial }^2{f}_1}{\partial x_m\partial x_1}{x}_m{x}_1\right)\right.+\cdots \hfill \\ +\left(\frac{{\partial }^2{f}_1}{\partial x_1\partial x_m}{x}_1{x}_m+\frac{{\partial }^2{f}_1}{\partial x_2\partial x_m}{x}_2{x}_m+\cdots +\frac{{\partial }^2{f}_1}{\partial x_m^2}{x}_m^2\right)+\cdots +R_1({\mathit{x}}^{k\otimes })\hfill \\ f_2({\mathit{x}}_{\mathbf{0}})+\left(\frac{\partial f_2}{\partial x_1}\right.x_1+\frac{\partial f_2}{\partial x_2}{x}_2+\cdots +\left(\frac{\partial f_1}{\partial x_m}{x}_m\right)+\cdots \\ +\frac{1}{2!}\left[\left(\frac{{\partial }^2{f}_2}{\partial x_1^2}{x}_1^2+\frac{{\partial }^2{f}_2}{\partial x_2\partial x_1}{x}_2{x}_1+\cdots +\frac{{\partial }^2{f}_2}{\partial x_m\partial x_1}{x}_m{x}_1\right)\right.+\cdots \hfill \\ +\left(\frac{{\partial }^2{f}_2}{\partial x_1\partial x_m}{x}_1{x}_m\right.+\left(\frac{{\partial }^2{f}_2}{\partial x_2\partial x_m}{x}_2{x}_m+\cdots +\frac{{\partial }^2{f}_2}{\partial x_m^2}{x}_m^2\right)+\cdots +R_2({\mathit{x}}^{k\otimes })\hfill \\ \hfill ⋮\hfill \\ f_n({\mathit{x}}_{\mathbf{0}})+\left(\frac{\partial f_n}{\partial x_1}{x}_1+\frac{\partial f_n}{\partial x_2}{x}_2+\cdots +\frac{\partial f_n}{\partial x_m}{x}_m\right)+\cdots \\ +\frac{1}{2!}\left[\left(\frac{{\partial }^2{f}_n}{\partial x_1^2}{x}_1^2+\frac{{\partial }^2{f}_n}{\partial x_2\partial x_1}{x}_2{x}_1+\cdots +\frac{{\partial }^2{f}_n}{\partial x_m\partial x_1}{x}_m{x}_1\right)\right.+\cdots \hfill \\ +\left(\frac{{\partial }^2{f}_n}{\partial x_1\partial x_m}{x}_1{x}_m+\frac{{\partial }^2{f}_n}{\partial x_2\partial x_m}{x}_2{x}_m+\cdots +\frac{{\partial }^2{f}_n}{\partial x_m^2}{x}_m^2\right)+\cdots +R_n({\mathit{x}}^{k\otimes })\hfill \end{array}\hfill \end{array}\right](12)$

${\tilde{\mathit{x}}}^{\otimes 3}=\left[\begin{array}{cccccccccccccccc}\hfill x_1^3,\hfill & \hfill x_1^2{x}_2,\hfill & \hfill \cdots ,\hfill & \hfill x_1^2{x}_m,\hfill & \hfill x_1{x}_2^2,\hfill & \hfill \cdots ,\hfill & \hfill x_1{x}_2{x}_m,\hfill & \hfill \cdots ,\hfill & \hfill x_1{x}_m^2,\hfill & \hfill x_2^3,\hfill & \hfill x_2^2{x}_3,\hfill & \hfill \cdots ,\hfill & \hfill x_2^2{x}_m,\hfill & \hfill x_2{x}_m^2,\hfill & \hfill \cdots ,\hfill & \hfill x_m^3\hfill \end{array}\right](13)$

$\begin{array}{cc}\hfill {\mathit{a}}^3& =\frac{1}{3!}\left[\begin{array}{ccccccccccccccc}\hfill \left(\genfrac{}{}{0.0pt}{}{3}{3}\right)\hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{2,1}}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{2,1}}\right)\hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{1,2}}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{1,1,1}}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{2,1}}\right)\hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{3}\right)\hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{2,1}}\right)\hfill & \hfill \cdots \hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{2,1}}\right)\hfill & \hfill \left(\genfrac{}{}{0.0pt}{}{3}{\mathrm{1,2}}\right)\hfill & \hfill \cdots \left(\genfrac{}{}{0.0pt}{}{3}{3}\right)\hfill \end{array}\right]\hfill \\ \hfill & =\frac{1}{3!}\left[\begin{array}{cccccccccccccccc}\hfill 1\hfill & \hfill 3\hfill & \hfill \cdots \hfill & \hfill 3\hfill & \hfill 3\hfill & \hfill \cdots \hfill & \hfill 6\hfill & \hfill \cdots \hfill & \hfill 3\hfill & \hfill 1\hfill & \hfill 3\hfill & \hfill \cdots \hfill & \hfill 3\hfill & \hfill 3\hfill & \hfill \cdots \hfill & \hfill 1\hfill \end{array}\right]\hfill \end{array}(14)$

This augmented state vector is the unique multinomial state vector, ${\tilde{\mathit{x}}}^{\otimes d}$, which is $\tilde{\mathit{x}}$ exponentiated to degree d in Eq. 15, where j is the vector term index and i₁, i₂, …, i_d are the tensor dimension indices.

$\begin{array}{cc}\hfill {\tilde{\mathit{x}}}^{\otimes d}\left(j\right)& ={\mathit{x}}^{\otimes d}\left(i_1,i_2,\dots ,i_d\right)\hfill \\ \hfill & =x_{i_1}{x}_{i_2}\cdots x_{i_d}\hfill \\ \hfill & \text{where}j=i_1+\frac{i_2\left(i_2-1\right)}{2}+\cdots +\prod _{k=1}^d\frac{i_d+k-2}{k}\hfill \\ \hfill & \text{for}{i}_1=1:m,\hfill \\ \hfill & \text{for}{i}_2=i_1:m,\hfill \\ \hfill & \cdots ,\hfill \\ \hfill & \text{for}{i}_{d-1}=i_{d-2}:m,\hfill \\ \hfill & \text{for}{i}_d=i_{d-1}:m\hfill \end{array}(15)$

$n_d=\prod _{i=1}^d\frac{m+i-1}{i}(16)$

This augmented state vector, ${\tilde{\mathit{x}}}^{\otimes d}$, is of size n_d, given in Eq. 16 and calculated with the multinomial theorem (Hildebrand, 2009). Unfolding tensors is a non-unique process, for which a different unfolding yields a different vector of coefficients. These solution sets are all minima for the same unfolding problem. Supplementary Appendix Section S10.1 gives the explicit description of augmented state vectors in ascending degree and corresponding multinomial coefficient vector.

The general solution for the multinomial coefficient vector a^d(j) is given in Eq. 17, where the operator (⋅) is the binomial coefficient of choosing d states out of m total number of states and n_i is the number of individual x_i states in the multinomial state ${\tilde{\mathit{x}}}^{\otimes d}(j)$ (Hildebrand, 2009). The size of a^d also follows (Eq. 16). The multinomial coefficient vector index j in Eq. 17 aligns with the state j index in Eq. 17. Explicit coefficient definitions for ascending orders of ${\tilde{\mathit{x}}}^{\otimes d}(j)$ are given in Table 8 in Supplementary Appendix Section S10.1.

$\begin{array}{cc}\hfill {\mathit{a}}^d\left(j\right)& =\frac{1}{d!}\left(d,n_1,n_2,,\dots ,n_m\right)\text{for}{n}_1\hfill \\ \hfill & =\mathcal{O}\left(x_1\right)\in {\tilde{\mathit{x}}}^{\otimes d}\left(j\right),\cdots ,n_m=\mathcal{O}\left(x_m\right)\in {\tilde{\mathit{x}}}^{\otimes d}\left(j\right)\hfill \end{array}(17)$

The general solution for the Jacobian matrix ${\tilde{J}}_f^2(:,j)$ is given in Eq. 18. The index j of the modified Jacobian ${\tilde{J}}_f^d$ mapping follows the index j of the multinomial state vector ${\tilde{\mathit{x}}}^{\otimes d}$ mapping with one additional rule: the first dimension’s index i₀ in the original Jacobian tensor $J_f^d$ directly translates to the first dimension’s index i₀ in the modified Jacobian matrix ${\tilde{J}}_f^d$. An example of the explicit definition of ${\tilde{J}}_f^2(:,j)$ can be found in Table 8 in Supplementary Appendix Section S10.1. Note that for d ≤ m, i₁ to i_d−m+1 does not increment in index but stays at index 1 as dummy dimensions for the multinomial state, coefficient, and Jacobian derivations.

$\begin{array}{cc}\hfill {\tilde{J}}_f^d\left(i_0,j\right)& =J_f^d\left(i_0,i_1,i_2,\dots ,i_d\right)\hfill \\ \hfill \text{for}j& =i_1+\frac{i_2\left(i_2-1\right)}{2}+\cdots +\prod _{k=1}^d\frac{i_d+k-2}{k}\hfill \\ \hfill \text{for}{i}_0& =1:n\hfill \\ \hfill \text{for}{i}_1& =1:m,\hfill \\ \hfill \text{for}{i}_2& =i_1:m,\hfill \\ \hfill \cdots ,\\ \hfill \text{for}{i}_{d-1}& =i_{d-2}:m,\hfill \\ \hfill \text{for}{i}_d& =i_{d-1}:m\hfill \end{array}(18)$

Compressing redundant state terms saves an immense amount of computation, especially for the number of states in real-world applications and for deriving approximations with more than two derivatives. The general reduction ratio, r, between the number of unique terms and the full expansion is given in Eq. 19.

$r=1-\frac{{\prod }_{i=1}^d\frac{m+i-1}{i}}{m^d}(19)$

The reduction can be seen to approach 100% for large states and 0% for scalar domain, Figure 1C. The real reduction rate falls somewhere beneath the m = ∞ bounding curve and the m = 1 origin. The minimum number of states and derivatives to yield a significant computation reduction of 25% is already achieved at m = 2 states and d = 2 derivatives. Table 6 in Supplementary Appendix Section S10.1 illustrates how the reduction ratio scales with the derivative order, explicitly calculating the corresponding number of states for full state tensor expansion compared to the unique state terms in the augmented state vector ${\tilde{\mathit{x}}}^{\otimes d}$. Motivated by linear solutions and significant computational cost, a framework was derived such that the tensor derivatives and states in the Taylor expansion can be reshaped into a unique multinomial matrix and vectors, respectively.

4 Tensor derivatives of a neural network

This section derives different single-layer neural network’s tensor derivatives $J_f^d$ that populate the Taylor series. The tensor derivatives evaluated at the origin ${\left.J_f^d\right|}_{x=0}$ are the coefficient tensors A^d. This section’s derivation is the next step in the overall process of approximating a single-layer neural network, with a polynomial function. The derivative formulation covers a wide range of the most popular networks, classified into network type and activation function. Network layers contained in this section are feedforward, convolution, and recurrent layers. Activation functions include binary, max, linear, ReLU, softmax, sigmoid, tanh, and probabilistic, referenced in Table 1.

TABLE 1

TABLE 1. Activation function type by ascending complexity with their associated vector and index expressions.

The tensor derivatives that approximate the neural network layer are dictated by the pairing of cell layer type and activation function type; a feedforward layer with a ReLU activation has different tensor derivatives than a feedforward layer with a sigmoid activation. The following subsections vary the relevant transformations σ(⋅) and calculates ascending orders of different NN layer derivatives to then populate a Taylor approximation in tensor form (Eq. 5), and then explicitly in matrix form (Eq. 18). The layer types are illustrated in Figure 2.

FIGURE 2

FIGURE 2. Basis single layer types transforming input to output: (A) perceptron layer, (B) convolution layer, and (C) recurrent layer.

4.1 Perceptron layer

A single-layer feedforward network with n number of neurons in the layer is depicted in Figure 2A. The output from a hidden layer y_F is a transformation f_F of the input x, and a learned weight and bias matrix, W and b. The input and output are in vector form, where x is of size ${\mathbb{R}}^{m\times 1}$ and y_F is of size ${\mathbb{R}}^{n\times 1}$. The vector equation is given in Eq. 20, where σ(⋅) is the activation function.

${\mathit{y}}_F=f_F\left(\mathit{x}\right)=\sigma \left(W,\mathit{b},\mathit{x}\right)(20)$

The index equation is given in Eq. 21, where the order of indices follows the dimension. The index, i, corresponds to a value in input state x and the index, j, corresponds to a value in output state y_F.

$y_j=f_j\left(x_i\right)=\sigma \left(w_{ji},b_j,x_i\right)(21)$

For many activation functions, derivatives truncate in finite order, such as binary, linear, and ReLU functions. The coefficient tensors for these terminating derivatives are trivial solutions as their Taylor series are equivalent to their original function expressions. These derivations may be found in Supplementary Appendix Section S10.2. For continuously differentiable activation functions, like the sigmoid, tanh, softmax, and probabilistic, the Taylor approximation series is artificially truncated at a user-defined order d (Eq. 22).

$\begin{array}{cc}\hfill & y_j\approx a_j^0+\sum _{i=1}^m{A}_{ji}^1{x}_i+\frac{1}{2!}\sum _{i_1=1}^m\sum _{i_2=1}^m{A}_{j{i}_1{i}_2}^2{x}_{i_1{i}_2}^{\otimes 2}+\cdots \hfill \\ \hfill & +\frac{1}{d!}\sum _{i_1=1}^m\cdots \sum _{i_d=1}^m{A}_{j{i}_1\cdots i_d}^d{x}_{i_1\cdots i_d}^{\otimes d}\hfill \end{array}(22)$

The higher order polynomial coefficient tensors are iteratively derived with immediately previous polynomial coefficient tensors. The general derivative relationships for each activation function are proved by induction from lower order derivatives. The general sigmoid derivative is given in Eq. 23 with the 0th to 2nd order terms given in Eqs 88–90 in Supplementary Appendix as proof of the iterative pattern.

$A_{j{i}_1\cdots i_d}^d=\frac{\partial A_{j{i}_1\cdots i_{d-1}}^{d-1}}{\partial \sigma }{w}_{j{i}_d}\sigma \left(b_j\right)\left(1-\sigma \left(b_j\right)\right)(23)$

The tanh derivative is given by Eq. 24 with 0^th to 2^nd derivatives in Eqs 91–93 in the Supplementary Appendix.

$A_{j{i}_1\cdots i_d}^d=\frac{\partial A_{j{i}_1\cdots i_{d-1}}^{d-1}}{\partial \sigma }{w}_{j{i}_d}\left(1-{\sigma }^2\left(b_j\right)\right)(24)$

The softmax derivative is given by Eq. 25 with 0^th to 1^st derivatives in Eqs 94, 95 in Supplementary Appendix.

$A_{j{i}_1\cdots i_d}^d=A_{j{i}_1\cdots i_{d-1}}^{d-1}{w}_{j{i}_d}(25)$

Probabilistic activation functions come in many different forms of which the Gaussian or radial basis function is the most popular function, given in Table 1. The polynomial coefficients for this function are complicated expressions for which two intermediate expressions simplify and reveal iterative patterns more clearly in Eq. 26: ${\alpha }_t^D$ and $s_t^D$. Each polynomial coefficient tensor is a sum n_t terms composed of ${\alpha }_t^D$ and $s_t^D$, where t the increment of a subexpression and D is the term order. The number of terms n_t depends only on the term’s degree order D, defined in Eq. 27.

$A_{j{i}_1\cdots i_d}^d=\sum _{t=1}^{n_t}{\alpha }_t^D{s}_t^D(26)$

$n_t=⌈\frac{D+1}{2}⌉(27)$

The most general terms, ${\alpha }_t^D$ and $s_t^D$, for any term and degree definition are in Eqs 28, 29, with explicit definitions in Table 9 in Supplementary Appendix Section S10.2 and 0th to 4th order terms are explicitly given in Eqs 99–103 in Supplementary Appendix.

${\alpha }_t^D=\prod _{k=1}^{t-1}\left(2k-1\right){\left(\frac{-{\beta }_j}{\Vert {\mathit{c}}_j\Vert }\right)}^{t-1}{\alpha }_1^{D-t+1}(28)$

$s_t^D=\prod _{l=1}^{D-2\left(t-1\right)}\left(\sum _{k=l}^D\frac{{\beta }_j{c}_{j{i}_k}}{\Vert {\mathit{c}}_{\mathit{j}}\Vert }\right)(29)$

4.2 Convolution layer

The convolution layer commonly uses two types of activation functions, linear and max, to achieve filtering and pooling. The derivatives of these activation functions truncate either on the 0th or 1st order derivative. The coefficient tensors when injected into the Taylor series yield exact representations of the original activation functions but offer standard indexing for matrix and vector conversion. A single-layer convolution layer with n filters of f spatial extent, s stride, and p zero padding is depicted in Figure 2B. Like the perceptron layer, the output from the hidden layer, Y, is a transformation of the input, X, and a learned weight and bias tensor, W and b. Unlike the perceptron layer, the input and output are typically in the matrix or third order tensor form, where X is of size ${\mathbb{R}}^{w_1\times h_1\times d_1}$ and Y is of size ${\mathbb{R}}^{w_2\times h_2\times d_2}$. The tensor equation is given in Eq. 30.

$Y=f_C\left(X\right)=\sigma \left(W,\mathit{b},X\right)(30)$

The tensor equation with indices is given in Eq. 31. The indices i, j, k for the output range from: i = 1, 2, …, w₂, j = 1, 2, …, h₂, and k = 1, 2, …, d₂. The indices l, m, n range from: l = 1, 2, …, w₁, m = 1, 2, …, h₁, and n = 1, 2, …, d₁.

$Y_{\mathit{ijk}}=\sigma \left(W_{ij}^k,b_k,X_{\mathit{lmn}}\right)(31)$

The linear activation function within a convolution layer is often called a convolution filter and offers feature extraction of input data. The convolution filter function utilizing the convolution operator in matrix and index form is given in Eq. 32, where the definition of ${\tilde{X}}_{ij}$ is given in Eq. 33.

$Y_{\mathit{ijk}}=W^k⊛{\tilde{X}}_{ij}+b_k(32)$

${\tilde{X}}_{ij}=X\left[s\left(i-1\right)-p+1:s\left(i-1\right)-p+f,s\left(j-1\right)-p+1:s\left(j-1\right)-p+f,1:d_1\right](33)$

The relationship between input and output sizes is defined by the network hyperparameters, reiterated here: number of filters n, height and width of the filter f, stride length s, and padding p, given in Eq. 34.

$w_2=\frac{w_1-f+2p}{s}+1,h_2=\frac{h_1-f+2p}{s}+1,d_2=n(34)$

The hyperparameters n, f, s, p are user-defined for which a common setting for the hyperparameters is: f = 3, s = 1 and p = 1. The constraint p = (f − 1)/2 preserves input to output size. The learned parameters W is of size ${\mathbb{R}}^{f\times f\times n}$ and b is of size ${\mathbb{R}}^n$. The output equation in strictly index form is given in Eq. 35.

$Y_{\mathit{ijk}}=\sum _{l=1}^f\sum _{m=1}^f\sum _{n=1}^{d_1}{W}_{\mathit{lmn}}^k{X}_{l+s\left(i-1\right)-p,m+s\left(j-1\right)-p,n}+b_k(35)$

The linear activation function is a continuously differentiable function with a Taylor approximation series that truncates after the 1st order term, given in Eq. 36.

$Y_{\mathit{ijk}}=a_{\mathit{ijk}}^0+\sum _{l=1}^{w_1}\sum _{m=1}^{h_1}\sum _{n=1}^{d_1}{A}_{\mathit{ijklmn}}^1{X}_{\mathit{lmn}}(36)$

The 0th and 1st order terms are given in Eqs 37, 38. $A_{\mathit{ijklmn}}^1$ is a sparse six dimensional tensor that performs an equivalent convolution operation with W^k. The Taylor approximation yields an exact representation to the original function expression despite the difference in operation representation.

$a_{\mathit{ijk}}^0=f_{\mathit{ijk}}\left(X_{\mathit{lmn}}=0\right)=b_k(37)$

$\begin{array}{cc}\hfill A_{\mathit{ijklmn}}^1& ={\left.\frac{\partial f_{\mathit{ijk}}}{\partial X_{\mathit{lmn}}}\right|}_{X_{\mathit{lmn}}=0}\hfill \\ \hfill & =\left\{\begin{array}{cc}{W}_{l+s\left(1-i\right)+p,m+s\left(1-j\right)+p,n}^k,\hfill & \text{if\hspace{0.17em}}1+s\left(i-1\right)+p\le l\le f+s\left(i-1\right)+p\hfill \\ \hfill & \text{\hspace{0.17em}and\hspace{0.17em}}1+s\left(j-1\right)+p\le m\le f+s\left(j-1\right)+p\hfill \\ 0,\hfill & \text{otherwise}\hfill \end{array}\right.\hfill \end{array}(38)$

The maximum activation function within a convolution layer is often called a pooling layer. A pooling layer typically follows a filter layer, offering translation invariance in terms of convolution filter output. The max function outputs the maximum value of the input that falls within the kernel. The matrix form is given in Eq. 39.

$Y_{\mathit{ijk}}=\underset{i,j,k}{\max }\left(X\left[s\left(i-1\right)+1:s\left(i-1\right)+f,s\left(j-1\right)+1:s\left(j-1\right)+f,k\right]\right)(39)$

As there are no distinct kernels and no padding, the only hyperparameters are field size f and stride s for which the relationship between input and output sizes is defined in Eq. 40.

$w_2=\frac{w_1-f}{s}+1,h_2=\frac{h_1-f}{s}+1,d_2=d_1(40)$

Common settings for the hyperparameters are f = 2 and s = 2. The Taylor approximation follows the same form as Eq. 36, which truncates after the 1st order term. The 0^th and 1^st order terms are given in Eqs 41, 42. The Taylor approximation yields an exact representation to the original function expression despite the difference in operation representation.

$a_{\mathit{ijk}}^0=f_{\mathit{ijk}}\left(X_{\mathit{lmn}}=0\right)=0(41)$

$A_{\mathit{ijklmn}}^1=\left\{\begin{array}{cc}1,\hfill & \text{if\hspace{0.17em}}{X}_{\mathit{lmn}}=\max \left({\tilde{X}}_{\mathit{ijk}}\right)\hfill \\ 0,\hfill & \text{otherwise}\hfill \end{array}\right.(42)$

4.3 Recurrent layer

The structure of a single-layer with n number of recurrent units in the layer is depicted in Figure 2C. The output from the convolution hidden layer, ${\mathit{y}}_C^t$ or equivalently s^t, is a transformation of the current time step’s input, x^t, the previous time step’s internal state, s^t−1, and a learned weight and bias matrices, W, U, and b. The input, internal state, and output are typically in vector form, where x^t is of size ${\mathbb{R}}^{m\times 1}$ but s^t−1 and ${\mathit{y}}_C^t$ are of size ${\mathbb{R}}^{n\times 1}$. The weights are typically in matrix form, where W is of size ${\mathbb{R}}^{n\times n}$, U is of size ${\mathbb{R}}^{n\times m}$, and b is of size ${\mathbb{R}}^{n\times 1}$. The vanilla recurrent unit vector relationship is given in Eq. 43.

$\mathit{y}=f\left({\mathit{s}}^{t-1},{\mathit{x}}^t\right)=\sigma \left(W,{\mathit{s}}^{t-1},U,{\mathit{x}}^t,\mathit{b}\right)(43)$

The index relationship is given in Eq. 44, where the order of indices follows the dimension. The index i corresponds to a value in the internal state s^t−1, the index k corresponds to a value in the input state x^t, and the index j corresponds to a value in the output state ${\mathit{y}}_C^t$.

$y_j=f_j\left(s_i^{t-1},x_k^t\right)=\sigma \left(w_{ji},s_i^{t-1},u_{jk},x_k^t,b_j\right)(44)$

The explicit vanilla RNN vector equation and index equation are given in Eqs 45, 46, respectively.

$\mathit{y}=\sigma \left(W{\mathit{s}}^{t-1}+U{\mathit{x}}^t+\mathit{b}\right)(45)$

$y_j=\sigma \left(\sum _i{w}_{ji}{s}_i^{t-1}+\sum _k{u}_{jk}{x}_k^t+b_j\right)(46)$

The vanilla RNN vector equation can be reformed into a feed-forward layer with analogous tensor and coefficient derivations. The previous state s^t−1 and the current input x^t may be joined together into one input z, given in Eq. 47.

${\mathit{z}}^t=\left[{\mathit{s}}^{t-1}{\mathit{x}}^t\right](47)$

The combined input z is of additive size ${\mathbb{R}}^{(n+m)\times 1}$ with associated dimension index l. The combined weight matrix, V, is given in Eq. 48 and is of size ${\mathbb{R}}^{n\times (n+m)}$.

$V=\left[WU\right](48)$

The reformed state prediction vector equation and index equation are given in Eqs 49, 50.

${\mathit{y}}_C^t=\sigma \left(V{\mathit{z}}^t+\mathit{b}\right)(49)$

$y_j=\sigma \left(\sum _l{v}_{jl}{z}_l+b_j\right)(50)$

The similarity between the reformed equations of the recurrent layer and feed-forward layer is apparent. To be explicit, the modified Taylor series expansion about the reformed state z is given in Eqs 51, 52.

$\mathit{f}\left(\mathit{z}\right)=\mathit{f}\left({\mathit{z}}_{\mathbf{0}}\right)+J_f^1\left({\mathit{z}}_{\mathbf{0}}\right)z+\frac{1}{2!}{J}_f^2\left({\mathit{z}}_{\mathbf{0}}\right)\otimes z^{2\otimes }+\cdots +{\mathit{R}}_{\mathit{n}}\left(\mathit{z}\right)(51)$

$y_j\approx a_j^0+\sum _{l=1}^{n+m}{A}_{jl}^1{z}_l+\frac{1}{2!}\sum _{l_1=1}^{n+m}\sum _{l_2=1}^{n+m}{A}_{j{l}_1{l}_2}^2{z}_{l_1{l}_2}^{\otimes 2}+\cdots +\frac{1}{d!}\sum _{l_1=1}^{n+m}\cdots \sum _{l_d=1}^{n+m}{A}_{j{l}_1\cdots l_d}^d{z}_{l_1\cdots l_d}^{\otimes d}(52)$

The tensor and coefficient derivations can be found in Supplementary Appendix Section S10.2] as the form of the equations are identical but the input state, weight matrix, and respective indices are directly analogous to the feedforward derivation.

5 Multiple layer network approximation

The output of the multi-layer network is an embedded Taylor approximation of each individual layer. Given a network with k layers, the final output y is a transformation of the kth intermediate state z^k. The output expression is given in Eq. 53.

$\begin{array}{cc}\hfill \mathit{y}& ={\mathit{f}}_{\mathit{o}}\left({\mathit{z}}^k\right)\hfill \\ \hfill & =a^{k,0}+A^{k,1}{\mathit{z}}^k+A^{k,2}{\mathit{z}}^{k,\otimes 2}+\cdots +A^{k,d}{\mathit{z}}^{k,\otimes d}\hfill \end{array}(53)$

The last hidden layer prior to the output layer transforms intermediate state z^k−1 to z^k, given in Eq. 54, repeated for all intermediate states z for hidden layers 1 to k − 1. The input layer transforms the data input x to the first intermediate state z¹, given in Eq. 55.

$\begin{array}{cc}\hfill {\mathit{z}}^k& ={\mathit{f}}_{\mathit{k}}\left({\mathit{z}}^{k-1}\right)\hfill \\ \hfill & =a^{k-\mathrm{1,0}}+A^{k-\mathrm{1,1}}{\mathit{z}}^{k-1}+A^{k-\mathrm{1,2}}{\mathit{z}}^{k-1,\otimes 2}+\cdots +A^{k-1,d}{\mathit{z}}^{k-1,\otimes d}\hfill \end{array}(54)$

$\begin{array}{cc}\hfill {\mathit{z}}^1& ={\mathit{f}}_{\mathbf{1}}\left(\mathit{x}\right)\hfill \\ \hfill & =a^{i,0}+A^{i,1}\mathit{x}+A^{i,2}{\mathit{x}}^{\otimes 2}+\cdots +A^{i,d}{\mathit{x}}^{\otimes d}\hfill \end{array}(55)$

The mapping from the input to the output is a recursive function embedding intermediate functions backward from the final layer, given in Eq. 56.

$\mathit{y}=\mathit{f}\left(\mathit{x}\right)={\mathit{f}}_{\mathit{o}}\left({\mathit{f}}_{\mathit{k}}\left(\cdots {\mathit{f}}_{\mathbf{2}}\left({\mathit{f}}_{\mathbf{1}}\left(\mathit{x}\right)\right)\cdots \right)\right)(56)$

A verification of the multi-layer approximation may be found in Supplementary Appendix Section S10.4.

6 Physical constraints in the form of semi-algebraic constraints

The development of new semi-algebraic optimization routines motivate a polynomial representation of an unknown dynamical system extracted from NN. Since many physical vector fields are at least piecewise smooth, we can use Taylor’s theorem to construct a polynomial that uniformly approximates the underlying ground truth arbitrarily tightly as the degree increases.

In the context of dynamical systems, physical laws provide valuable context that may be applied to state prediction. A more informed state prediction is found by combining the NN-derived polynomial state equations and user-defined semi-algebraic constraints. This is mainly enticing when learning and updating the new polynomial expression on-the-fly when new data is gathered. Hierarchies of semi-definite and sometimes even, linear program relaxations may be possible toward convergence of a global minimizer within the set of coefficients as parameters for such a problem. Moreover, incorporation of such constraints on the admissible set for its domain may indeed collapse the degree and required state dimension of the learned polynomial. Indeed, after the initial and possibly large polynomial is accurately extracted from the NN differential equation from the analytic unconstrained methods presented in this article, a new optimization goal would be to set up a hierarchy of optimization problems minimizing simultaneously, degrees and state dimensions, thus compressing dimension of the parameter space. The dimension of the parameter space, n_s, is given in Eq. 57, where n is the size of the state s and d is the degree of the polynomial.

$n_s\left(d\right)=\left(\begin{array}{c}\hfill n+d\hfill \\ \hfill d\hfill \end{array}\right)=\frac{\left(n+d\right)!}{d!n!}(57)$

This section offers common constraints but in application, any constraint in polynomial form may be defined and appended to this larger set of linear equations. A comprehensive state for rigid body dynamics is translation [x y z] and rotation, [θ_x θ_y θ_z], in all six degrees of freedom and the associated velocity states, denoted by a derivative dot above the state. The full state vector is shown in Eq. 58.

$\mathit{s}=\left[xyz\dot{x}\dot{y}\dot{z}{\theta }_x{\theta }_y{\theta }_z{\dot{\theta }}_x{\dot{\theta }}_y{\dot{\theta }}_z\right](58)$

For a predictive dynamics model, the neural network could be trained to develop a discrete transition model f_d to yield the next state s_k+1 from the current state s_k or a continuous model f_c to yield the current state derivative ${\dot{\mathit{s}}}_k$, given in Eqs 59, 60, respectively.

${\mathit{s}}_{k+1}={\mathit{f}}_{\mathit{d}}\left({\mathit{s}}_k\right)(59)$

${\dot{\mathit{s}}}_k={\mathit{f}}_{\mathit{c}}\left({\mathit{s}}_k\right)(60)$

Some suggested constraints of interest can be separated into systems under no external influence, external influence, and physical constraints. Under no external influence, a system’s total energy (kinetic energy and potential energy U) is conserved, given in Eq. 61. Similarly, momentum is conserved in both translation and angular, given in Eq. 62. If rotational degrees of freedom are constrained, the θ terms in Eq. 62 are zero, and for constrained translation, the x, y, z terms are zero.

$\begin{array}{cc}\hfill & \frac{1}{2}\left(\left[{\dot{x}}_k{\dot{y}}_k{\dot{z}}_k\right]M\left[\begin{array}{c}\hfill {\dot{x}}_k\hfill \\ \hfill {\dot{y}}_k\hfill \\ \hfill {\dot{z}}_k\hfill \end{array}\right]+\left[{\theta }_{xk}{\theta }_{yk}{\theta }_{zk}\right]I\left[\begin{array}{c}\hfill {\theta }_{xK}\hfill \\ \hfill {\theta }_{yk}\hfill \\ \hfill {\theta }_{zK}\hfill \end{array}\right]\right)+U\left({\mathit{s}}_k\right)\hfill \\ \hfill & =\frac{1}{2}\left(\left[{\dot{x}}_{k+1}{\dot{y}}_{k+1}{\dot{z}}_{k+1}\right]M\left[\begin{array}{c}\hfill {\dot{x}}_{k+1}\hfill \\ \hfill {\dot{y}}_{k+1}\hfill \\ \hfill {\dot{z}}_{k+1}\hfill \end{array}\right]+\left[{\theta }_{x,k+1}{\theta }_{y,k+1}{\theta }_{z,k+1}\right]I\left[\begin{array}{c}\hfill {\theta }_{x,k+1}\hfill \\ \hfill {\theta }_{y,k+1}\hfill \\ \hfill \left.{\theta }_{z,k+1}\right]\hfill \end{array}\right]\right)+U\left({\mathit{s}}_{k+1}\right)\hfill \end{array}(61)$

$M\left[\begin{array}{c}\hfill {\dot{x}}_k\hfill \\ \hfill {\dot{y}}_k\hfill \\ \hfill {\dot{z}}_k\hfill \end{array}\right]+I\left[\begin{array}{c}\hfill {\theta }_{x,k}\hfill \\ \hfill {\theta }_{y,k}\hfill \\ \hfill {\theta }_{z,k}\hfill \end{array}\right]=M\left[\begin{array}{c}\hfill {\dot{x}}_{k+1}\hfill \\ \hfill {\dot{y}}_{k+1}\hfill \\ \hfill {\dot{z}}_{k+1}\hfill \end{array}\right]+I\left[\begin{array}{c}\hfill {\theta }_{x,k+1}\hfill \\ \hfill {\theta }_{y,k+1}\hfill \\ \hfill {\theta }_{z,k+1}\hfill \end{array}\right](62)$

Under external influence, these matrix equalities turn into matrix inequalities and additional external terms are integrated. Regarding conservation of energy, if this external influence has a known energy relationship, the external work term W(s) may be seen in Eq. 63. Likewise, the momentum conservation equation is modified with external influences in the form of force and torque, seen in Eq. 64. If rotational degrees of freedom are constrained, the θ terms in Eq. 64 are zero, and for constrained translation, the x, y, z terms are zero.

$\begin{array}{cc}\hfill & \frac{1}{2}\left(\left[{\dot{x}}_k{\dot{y}}_k{\dot{z}}_k\right]M\left[\begin{array}{c}\hfill {\dot{x}}_k\hfill \\ \hfill {\dot{y}}_k\hfill \\ \hfill {\dot{z}}_k\hfill \end{array}\right]+\left[{\theta }_{xk}{\theta }_{yk}{\theta }_{zk}\right]I\left[\begin{array}{c}\hfill {\theta }_{xk}\hfill \\ \hfill {\theta }_{yk}\hfill \\ \hfill {\theta }_{zk}\hfill \end{array}\right]\right)+U\left({\mathit{s}}_k\right)+W\left({\mathit{s}}_k\right)\hfill \\ \hfill & \ge \frac{1}{2}\left(\left[{\dot{x}}_{k+1}{\dot{y}}_{k+1}{\dot{z}}_{k+1}\right]M\left[\begin{array}{c}\hfill {\dot{x}}_{k+1}\hfill \\ \hfill {\dot{y}}_{k+1}\hfill \\ \hfill {\dot{z}}_{k+1}\hfill \end{array}\right]+\left[{\theta }_{x,k+1}{\theta }_{y,k+1}{\theta }_{z,k+1}\right]I\left[\begin{array}{c}\hfill {\theta }_{x,k+1}\hfill \\ \hfill {\theta }_{y,k+1}\hfill \\ \hfill \left.{\theta }_{z,k+1}\right]\hfill \end{array}\right]\right)+U\left({\mathit{s}}_{k+1}\right)+W\left({\mathit{s}}_{k+1}\right)\hfill \end{array}(63)$

$M\left[\begin{array}{c}\hfill {\dot{x}}_k\hfill \\ \hfill {\dot{y}}_k\hfill \\ \hfill {\dot{z}}_k\hfill \end{array}\right]+F\left({\mathit{s}}_k\right)\mathrm{\Delta }t+I\left[\begin{array}{c}\hfill {\theta }_{x,k}\hfill \\ \hfill {\theta }_{y,k}\hfill \\ \hfill {\theta }_{z,k}\hfill \end{array}\right]+\tau \left({\mathit{s}}_k\right)\mathrm{\Delta }t=M\left[\begin{array}{c}\hfill {\dot{x}}_{k+1}\hfill \\ \hfill {\dot{y}}_{k+1}\hfill \\ \hfill {\dot{z}}_{k+1}\hfill \end{array}\right]+F\left({\mathit{s}}_{k+1}\right)\mathrm{\Delta }t+I\left[\begin{array}{c}\hfill {\theta }_{x,k+1}\hfill \\ \hfill {\theta }_{y,k+1}\hfill \\ \hfill {\theta }_{z,k+1}\hfill \end{array}\right]+\tau \left({\mathit{s}}_{k+1}\right)\mathrm{\Delta }t(64)$

Outside of physical laws of dynamics, a more general constraint is a state bound in the form of an inequality. A state boundary could result from a physical boundary, in which a body cannot intersect another body. A lower bound and higher bound are given by Eq. 65, where r is a reference point.

${\mathit{s}}_{k+1}\le \mathit{r}\text{OR}{\mathit{s}}_{k+1}\ge \mathit{r}(65)$

These two constraints can be superimposed as long as the constraints do not conflict with each other. Another set of bounding conditions results from a state relationship and sign of state derivative, given in state inequality (Eq. 66).

$\begin{array}{c}{\mathit{s}}_{k+1}\le {\mathit{s}}_k\text{if}{\dot{\mathit{s}}}_k\le 0\\ \text{OR}\\ {\mathit{s}}_{k+1}\ge {\mathit{s}}_k\text{if}{\dot{\mathit{s}}}_k\ge 0\end{array}(66)$

7 Solving for state prediction simultaneously with constraints

The proposed NN-Poly method can be used as a system identification method and/or a state prediction method. The state prediction solution in matrix form and in polynomial basis space is given in Eq. 67, where y_k is either the state derivative s_k or the propagated state s_k+1.

${\mathit{y}}_k={\tilde{J}}_f^d{\mathit{a}}^d{\tilde{\mathit{s}}}^{\otimes d}(67)$

As derived previously, ${\tilde{J}}_f^d$ and a^d are both matrices populated only with numerical coefficients that approximate the NN function. Together, ${\tilde{J}}_f^d{\mathit{a}}^d$ are an analogous state transition matrix, where the traditional input state s_k is augmented into the previously defined higher order polynomial basis space ${\tilde{\mathit{s}}}^{\otimes d}$. As previously shown, constraints may be represented as linear equations in the same polynomial basis space. To solve for equality constraints simultaneously with state prediction, the constraint equation matrix, h_e, is appended to the polynomial state equation matrix, shown in Eq. 68, and solved with semi-definite programs (SDPs).

$\left[\begin{array}{c}\hfill {\mathit{y}}_k\hfill \\ \hfill h_e\hfill \end{array}\right]=\left[\begin{array}{c}\hfill {\tilde{J}}_f^d{\mathit{a}}^d\hfill \\ \hfill H_e\hfill \end{array}\right]{\tilde{\mathit{s}}}^{\otimes d}(68)$

For inequality constraints, numerical programs may be utilized to solve the semi-algebraic optimization problem, given in Eq. 69, where h_i are inequality constraint equations. Solving the semi-algebraic optimization problem is outside scope of this study, but the authors refer us to prevalent tools, such as the linear programming and semi-definite programming packages (Lasserre, 2015). These SDPs are convex but grow arbitrarily large as upon iteration. Future research includes exploiting the information incorporated in constraints known about the system to reduce the size of these SDPs, building upon work of Ahmadi and El Khadir (2020).

${\mathit{y}}_k={\tilde{J}}_f^d{\mathit{a}}^d{\tilde{\mathit{s}}}^{\otimes d}\text{such\hspace{0.17em}that}{h}_i\le H_i{\tilde{\mathit{s}}}^{\otimes d}(69)$

One can implement constrained state prediction in real-time on an embedded dynamic system in a learning application. In an algorithmic loop, a neural network may be trained with every iteratively collected measurement, then the subsequent polynomial may be generated and the state prediction/control effort constrained with predefined constraints. Other applications include post-processing system identification for data-constrained applications, in which neural network parameters are more effective to communicate than large data sets, like space or deep-sea applications.

8 NN-Poly state prediction performance

Our aim in these results is to show the minimal approximation loss between the NN-Poly and the models that were derived directly from data: the neural network and polynomial. In the unconstrained case, the NN-Poly can only be as accurate as the neural network from which the polynomial is derived from as the polynomial approximates the neural network. Similarly, the NN-Poly can only be as accurate as a polynomial found from the original data because NN-Poly lost information between the original data and the neural network representation. In the constrained case, the NN-Poly has the ability to incorporate domain knowledge that the neural network cannot capture, which offers NN-Poly the ability to better represent the underlying dynamic system generating the data; for example, a neural network trained on data generated from a bouncing ball may predict the ball’s state to intersect with the ground, but constraints placed on the polynomial model would bound predictions such that the ball never intersects with the ground, yielding a more accurate state prediction. The proposed Taylor expansion with the NN parameters is coded in MATLAB (https://github.com/alexdhjing/NNX_matlab). Metrics to evaluate performance of each method are efficiency, accuracy, and complexity. This section discusses the method of comparison, metrics to evaluate performance, and subsequent results of the state prediction methods.

8.1 Methods

Several dynamic models are used to measure efficiency and accuracy of each state prediction method, not only in the state prediction but also in the model representation. Each algorithm is trained with the same pairwise input and output data, generated from the true dynamic model, to predict a state for a range of dynamic systems. The input–output data pairs are of form {x_k, x_k+1}, in which the input is state vector at time step k and the output is of time k + 1. A majority of data pairs train the various models and the rest of the data pairs are set aside to evaluate state error and computation time. Other metrics evaluate the model coefficients and structure after training. All metrics are formally defined in the next subsection.

The selected dynamic models were chosen in ascending complexity, from a two-dimensional feature space with linear dynamics and non-linear dynamics. The 1DOF underdamped linear spring mass damper system has a linear transition matrix from previous state to next state, constituting the simplest dynamic system to identify, described in Eq. 70. The 1DOF non-linear spring system has non-linear spring stiffness and is governed by a differential equation, given in Eq. 71. A 2DOF spring pendulum demonstrates non-linearity and coupling of dynamics, given in Eq. 72. In both the 1DOF non-linear spring and 2DOF spring pendulum cases, the differential equations of motion propagate the state to generate data. The system identification methods do not generate expressions for acceleration but generate a mapping from previous state to next state, implicitly integrating the double derivative.

$\left[\begin{array}{c}\hfill x_{t+1}\hfill \\ \hfill v_{t+1}\hfill \end{array}\right]=\left[\begin{array}{cc}\hfill 0.9995\hfill & \hfill 0.01\hfill \\ \hfill -0.0999\hfill & \hfill 0.9985\hfill \end{array}\right]\left[\begin{array}{c}\hfill x_t\hfill \\ \hfill v_t\hfill \end{array}\right](70)$

$\ddot{x}=\frac{-3{\mu }_0}{2\pi {\left(x+a\right)}^4}(71)$

$\left[\begin{array}{c}\hfill \ddot{x}\hfill \\ \hfill \ddot{y}\hfill \end{array}\right]=\left[\begin{array}{c}\hfill -5\left(\sqrt{x^2+y^2}-1\right)\frac{x}{\sqrt{x^2+y^2}}\hfill \\ \hfill -5\left(\sqrt{x^2+y^2}-1\right)\frac{y}{\sqrt{x^2+y^2}}-10\hfill \end{array}\right](72)$

8.2 Metrics of evaluation

Metrics for evaluation are computation time, state error (mean squared error), coefficient error, length of solution, and coefficient stability, given in Table 2. The state error is of mean squared error form of the algorithm’s state prediction and the true state for which smaller error represents a more accurate approximation. Coefficient error refers to a coefficient vector c of length m, geared toward polynomial solutions for which smaller error again signifies a more accurate model. Parameter stability refers to the learned parameters, relevant for all methods, for which values closer to 1 represent high stability and values approaching infinity represent instability. The length of solution refers to the number of h(x) for which a smaller number of terms represents a more parsimonious solution.

TABLE 2

TABLE 2. Metrics for evaluating system identification methods on dynamic systems.

8.3 Complexity

We will explore the complexity of our proposed method by deriving and comparing the number of flops for the following methods: a polynomial directly from data, training a NN and NN-Poly. Intuitively before even approaching a rigorous derivation, the NN-Poly method explicitly relates NN parameters to polynomial coefficients, emulating a “hard-coded” computation. We added computing time into the evaluation metrics as calling table elements from memory would likely be the most computationally intensive task in the NN-Poly method. Calculating polynomial coefficients directly from a large data set with the least-squares method will be computationally intensive due to the matrix inverse operation that scales cubed with dimension of the data set. A neural network’s flops depend on training epochs until convergence, stochastically related to the initial parameterization of the neural network. For all flop calculations, we will assume that:

• The input state size m and output state size n are equivalent m = n

• The state size m is much smaller than the amount of training points t, m ≪ t

The least-squares method to calculate polynomial coefficients A with a matrix of inputs X and outputs Y is given in Eq. 73, where A_p is the set of polynomial coefficients derived from the least-squares method.

$A_p=Y{\left(X^{\otimes d}\right)}^T{\left(\left(X^{\otimes d}\right){\left(X^{\otimes d}\right)}^T\right)}^{-1}(73)$

The number of flops of a polynomial derived directly from data is on the order given in Eq. 74. Intermediate steps are given in Eqs 135–138 in Supplementary Appendix Section S10.5.

$\mathcal{O}\left(A_p\right)\approx t\frac{m^d}{d!}+\frac{m^{3d}}{d!}(74)$

To train neural networks, we must account for forward passes and backward propagation per epoch overall training data. In implementation, the neural network does not necessarily train across all the data but for this derivation of flops will assume so to simplify the calculation. We will also assume that the network has only a single layer with k neurons. The total number of flops to train a neural network is given in Eq. 75.

$\mathcal{O}\left(\text{NN}\right)\approx mnkt(75)$

To convert this neural network into a polynomial, the polynomial coefficients for each polynomial degree scales with the number of neurons in the layer. The highest order polynomial dominates the number of flops, which approximates the total number of flops in converting a single-layer NN with k neurons to a polynomial of degree d given in Eq. 76. The set of polynomial coefficients derived from the NN is given by $A_{NN}^d$. Intermediate steps are shown in Eqs 140–145 in Supplementary Appendix Section S10.5.

$\mathcal{O}\left(A_{NN}^d\right)\approx k{m}^{d+1}(76)$

The combined complexity of training a neural network and converting those NN parameters to polynomial coefficients is given in

$\mathcal{O}\left(\text{NN}+A_{NN}^d\right)\approx k{m}^{2}t+k{m}^{d+1}(77)$

$=k\left(m^{2}t+m^{d+1}\right)(78)$

The condition for the neural network training to be more computationally complex than the NN-Poly conversion is given in Eq. 79.

$\left\{\begin{array}{cc}\mathcal{O}\left(\text{NN}\right)>\mathcal{O}\left(A_{NN}^d\right),\hfill & \text{if\hspace{0.17em}}t>m^{d-1}\hfill \\ \mathcal{O}\left(A_{NN}^d\right)>\mathcal{O}\left(\text{NN}\right),\hfill & \text{otherwise}\hfill \end{array}\right.(79)$

Given the order of complexity of each method that ultimately yields a polynomial (least-squares polynomial directly from data and polynomial from NN parameters), what are the conditions on state size m, training data size t, and neural network size by neurons k that make either method more or less complex than the other? The condition for the NN-Poly method to be less complex than a polynomial from the raw data is given in Eq. 80.

$\left\{\begin{array}{cc}\mathcal{O}\left(A_p\right)>\mathcal{O}\left(\text{NN}+A_{NN}^d\right),\hfill & \text{if\hspace{0.17em}}mk<\frac{t+m^d}{d!}\hfill \\ \mathcal{O}\left(\text{NN}+A_{NN}^d\right)>\mathcal{O}\left(A_p\right),\hfill & \text{otherwise}\hfill \end{array}\right.(80)$

Intuitively, the NN-Poly method is computationally advantageous for the following conditions:

• There are many training points

• The neural network is small

• The state size is large

• The state size is sufficiently large and the polynomial degree is large

Complexity does not fully capture computational load though, as the NN-Poly method relies heavily on memory calls. The next section incorporates computing time for this reason.

8.4 Results

For each dynamic system, Tables 3–5 report the performance of the strict polynomial, the sole NN and NN-Poly for each dynamic system. Wherever an ϵ is listed in the tables, ϵ denotes an immensely small value within machine precision. The computation time for the NN-polynomial expansion does not include the NN training time, only the time to transform the NN parameters into polynomial coefficients.

TABLE 3

TABLE 3. 1DOF spring evaluation of performance for all system identification methods.

The method that best predicts the 1 DOF linear spring state is the strict polynomial; although curiously, the NN-Poly exactly predicts the original system state matrix coefficients. The performance across all methods is shown in Table 3. The proposed NN-Poly approximation method performance in each state’s time series and across increasing polynomial degrees is shown in Figure 3. As expected, increasing the order of polynomial approximation yields less state error, although not much performance is gained past the second-order approximation, seen in Figure 3. The small error bars for each degree signals that the final solution from each NN random initialization does not vary error much. The NN-polynomial conversion is comparable in computation but includes more state error as expected. This straightforward test case is best solved with the simplest solver, the direct polynomial solution; even a least squares solution is sufficient. This system does not need a complex, expressive system identification method due to the simplicity of its linear form.

FIGURE 3

FIGURE 3. (A) Third-order NN-Poly approximation of 1DOF linear system and error as difference of each state. (B) MSE error of position and velocity state across different orders of approximation for NN-Poly.

The method that best predicts the 1 DOF non-linear spring state are NN and NN-Poly, with performance reported in Table 4. Unlike the linear system approximation, the proposed NN-Poly approximation varies from the NN parameter initialization and does not converge to a steady state error until the fourth order, seen in Figure 4. The sole NN and NN-Poly approximate the data with the least state error, generate a minimal representation, and yield the most stable parameters of all methods. Subsequently, the NN-Poly retains the same value of state error from NN, demonstrating the accuracy of transformation from a NN form to polynomial form, while also offering a form from which to apply domain knowledge and safety guarantees.

TABLE 4

TABLE 4. 1 DOF flux-pinned system evaluation of performance for all system identification methods.

FIGURE 4

FIGURE 4. (A) Third-order NN-Poly approximation of 1DOF non-linear spring system and error as difference of each state. (B) MSE error of position and velocity state across different orders of approximation for NN-Poly.

For the 2DOF system, NN and NN-Poly predict state accurately, seen in Table 5. The third order NN-poly approximation for each state is shown in Figure 5A. The NN-Poly MSE error decreases with increasing polynomial degree and does not converge until after the fourth order, seen in Figure 5B. The NN and NN-Poly predict the 2DOF system with fewer terms. Each method has comparable parameter stability and computation time. This coupled and slightly non-linear dynamic system straddles the boundary in deciding which model to use.

FIGURE 5

FIGURE 5. (A) Third-order NN-Poly approximation of a 2DOF non-linear coupled spring–pendulum system and error as difference of each state. (B) 2DOF spring–pendulum individual MSE error of position and velocity state across different orders of NN-Poly approximation.

TABLE 5

TABLE 5. 2 DOF spring pendulum system evaluation of performance for all system identification methods.

9 Conclusion

Leveraging recent advances in deep learning, NN-Poly provides accurate predictions of non-linear, coupled system dynamics with minimal context. A NN-to-polynomial mapping avoids the need to download an immense amount of data and fit a polynomial directly to a large dataset by exploiting the compactness of the NN. A polynomial enhances interpretability of the neural network by making its feature dependence explicit, as polynomials have a long history of analysis and mathematical literature, including safety verification and guarantees. This work’s major contribution is offering a polynomial form and semi-algebraic constraints, such polynomial inequality and equality constraints, to capture the NN model and system context in the final predictive function solution. These semi-algebraic constraints represent the application of domain knowledge, such as conservation of energy in the form of quadratic rates, and safety constraints, such as linear inequalities that bound specific state values. The results of this effort show comparable prediction and computation performance between a sole NN, sole polynomial, and the proposed method for linear systems but great improvement in the proposed method for highly nonlinear systems. Further future work also includes approximation of more complex systems, in increasing degrees of freedom, in the degree of non-linearity, and in the coupling of states.

Data availability statement

The datasets presented in this study can be found in online repositories. The names of the repository/repositories and accession number(s) can be found as follows: https://github.com/alexdhjing/NNX_matlab.

Author contributions

FZ was the primary author for the majority of this manuscript and derived all the theory that produced all equations. DJ wrote the code that generated the plots in the results. FL contributed the insight and section on semi-algebraic constraints. SF reviewed the paper and assisted in identifying gaps in explanation. FL and SF guided the trajectory of the research contributions.

Funding

FZ thanks the NASA Space Technology Research Fellowship Grant NNX15AP55H and the NSF AI Institute in Dynamics Systems award number 2112085 for supporting this research. SF’s work was funded by the Office of Naval Research (ONR) grant N00014-19-1-2266.

Acknowledgments

FZ would like to thank Chelsea Sidrane and Anish Potnis for their valuable feedback.

Conflict of interest

Author DJ was employed by the company Huawei.

The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Supplementary material

The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/frobt.2022.968305/full#supplementary-material

References

Ahmadi, A. A., and El Khadir, B. (2020). “Learning dynamical systems with side information,” in Learning for Dynamics and Control (PMLR), 718.

Google Scholar

Ahmadi, A. A., and Parrilo, P. A. (2011). “Converse results on existence of sum of squares lyapunov functions,” in 2011 50th IEEE conference on decision and control and European control conference (IEEE), 6516.

CrossRef Full Text | Google Scholar

Cranmer, M., Greydanus, S., Hoyer, S., Battaglia, P., Spergel, D., and Ho, S. (2020). Lagrangian neural networks. arXiv preprint arXiv:2003.04630.

Google Scholar

Djeumou, F., Neary, C., Goubault, E., Putot, S., and Topcu, U. (2022). “Neural networks with physics-informed architectures and constraints for dynamical systems modeling,” in Learning for Dynamics and Control Conference (PMLR), 263–277.

Google Scholar

Dutta, S., Chen, X., and Sankaranarayanan, S. (2019). “Reachability analysis for neural feedback systems using regressive polynomial rule inference,” in Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control. (IEEE).

CrossRef Full Text | Google Scholar

Ferrari, S., Rudd, K., and Muro, G. (2013). “A constrained backpropagation (cprop) approach to function approximation and approximate dynamic rogramming,” in Reinforcement Learning and Approximate Dynamic Programming for Feedback Contro, 162–181.l.

CrossRef Full Text | Google Scholar

Ferrari, S., and Stengel, R. F. (2005). Smooth function approximation using neural networks. IEEE Trans. Neural Netw. 16, 24–38. doi:10.1109/tnn.2004.836233

PubMed Abstract | CrossRef Full Text | Google Scholar

Granados, A. (2015). Taylor series for multi-variable functions.

Google Scholar

Greydanus, S., Dzamba, M., and Yosinski, J. (2019). “Hamiltonian neural networks,” in Advances in neural information processing systems. Editors H. Wallach, H. Larochelle, A. Beygelzimer, F. d’Alche-Buc, E. Fox, and R. Garnett (Curran Associates, Inc.), 32.

Google Scholar

Hildebrand, A. (2009). Multinomial coefficients.

Google Scholar

Hornik, K., Stinchcombe, M., and White, H. (1989). Multilayer feedforward networks are universal approximators. Neural Netw. 2, 359–366. doi:10.1016/0893-6080(89)90020-8

CrossRef Full Text | Google Scholar

Huang, C., Fan, J., Li, W., Chen, X., and Zhu, Q. (2019). Reachnn: Reachability analysis of neural-network controlled systems. ACM Trans. Embed. Comput. Syst. 18, 1–22. doi:10.1145/3358228

PubMed Abstract | CrossRef Full Text | Google Scholar

Lagaris, I. E., Likas, A., and Fotiadis, D. I. (1998). Artificial neural networks for solving ordinary and partial differential equations. IEEE Trans. Neural Netw. 9, 987–1000. doi:10.1109/72.712178

PubMed Abstract | CrossRef Full Text | Google Scholar

Lasserre, J. B. (2015). An introduction to polynomial and semi-algebraic optimization, 52. Cambridge: Cambridge University Press.

Google Scholar

Lipton, Z. C. (2018). The mythos of model interpretability. Queue 16, 31–57. doi:10.1145/3236386.3241340

CrossRef Full Text | Google Scholar

Liu, W., Lai, Z., Bacsa, K., and Chatzi, E. (2022). Physics-guided deep markov models for learning nonlinear dynamical systems with uncertainty. Mech. Syst. Signal Process. 178, 109276. doi:10.1016/j.ymssp.2022.109276

CrossRef Full Text | Google Scholar

Narasimhamurthy, M., Kushner, T., Dutta, S., and Sankaranarayanan, S. (2019). “Verifying conformance of neural network models,” in 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) (IEEE), 1.

Google Scholar

Pinkus, A. (1999). Approximation theory of the mlp model in neural networks. Acta Numer. 8, 143–195. doi:10.1017/s0962492900002919

CrossRef Full Text | Google Scholar

Psichogios, D. C., and Ungar, L. H. (1992). A hybrid neural network-first principles approach to process modeling. AIChE J. 38, 1499–1511. doi:10.1002/aic.690381003

CrossRef Full Text | Google Scholar

Raissi, M., Perdikaris, P., and Karniadakis, G. E. (2019). Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J. Comput. Phys. 378, 686–707. doi:10.1016/j.jcp.2018.10.045

CrossRef Full Text | Google Scholar

Rolnick, D., and Tegmark, M. (2017). The power of deeper networks for expressing natural functions. arXiv preprint arXiv:1705.05502.

Google Scholar

Rudy, S. H., Brunton, S. L., Proctor, J. L., and Kutz, J. N. (2017). Data-driven discovery of partial differential equations. Sci. Adv. 3, e1602614. doi:10.1126/sciadv.1602614

PubMed Abstract | CrossRef Full Text | Google Scholar

Sidrane, C., Katz, S., Corso, A., and Kochenderfer, M. J. (2022). Verifying inverse model neural networks. arXiv preprint arXiv:2202.02429.

Google Scholar

Wang, S., Sankaran, S., and Perdikaris, P. (2022). Respecting causality is all you need for training physics-informed neural networks. arXiv preprint arXiv:2203.07404.

Google Scholar