Newton-Cotes Graph Neural Networks: On the Time Evolution of Dynamic Systems

Reasoning system dynamics is one of the most important analytical approaches for many scientific studies. With the initial state of a system as input, the recent graph neural networks (GNNs)-based methods are capable of predicting the future state distant in time with high accuracy. Although these methods have diverse designs in modeling the coordinates and interacting forces of the system, we show that they actually share a common paradigm that learns the integration of the velocity over the interval between the initial and terminal coordinates. However, their integrand is constant w.r.t. time. Inspired by this observation, we propose a new approach to predict the integration based on several velocity estimations with Newton-Cotes formulas and prove its effectiveness theoretically. Extensive experiments on several benchmarks empirically demonstrate consistent and significant improvement compared with the state-of-the-art methods.

Paper

References (53)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer 9Zk24/10 · confidence 4/52023-07-02

Summary

This paper proposes Newton-Cotes Graph Neural Networks (NC), which are a time-continuous extension of Equivariant Graph Neural Networks (EGNNs). The authors also conducted a mathematical analysis on the predictive variance of NC under the Gaussian assumption. Through numerical experiments, the authors have demonstrated that the NC-formulated EGNNs outperform the baseline EGNNs.

Strengths

- The method is clear and can be generalized to other GNN classes beyond Equivariant GNNs.

Weaknesses

**The proposed method is a special case of a larger GNN class, but there is no comparison provided with this GNN class in the submitted paper.** Although the authors have demonstrated the effectiveness of the NC integrator in conjunction with GNN through numerical experiments, the paper fails to compare the proposed Newton-Cotes Graph Neural Networks (NC) with the most competitive baseline class, Graph Neural Ordinary Differential Equations (GDEs) [1]. It would be highly beneficial to compare the proposed method with the more well-established GDE models. In my opinion, the proposed NC can be considered a special case of GDE where the integrator is the Newton-Cotes method and the GNN corresponds to the proposed EGNN. Furthermore, based on the advancements in Neural ODE research, the limitation mentioned in section 3.5 could already be addressed using adjoint sensitivity methods. [1] Graph Neural Ordinary Differential Equations

Questions

- Regarding the selection of the numerical integrator, it would be beneficial to clarify the advantages of using NC over more well-known and commonly used integrators such as Runge-Kutta or Dormand–Prince. - When it comes to training NC+, is it necessary to collect the K-1 intermediate points?

Rating

4: Borderline reject: Technically solid paper where reasons to reject, e.g., limited evaluation, outweigh reasons to accept, e.g., good evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

2 fair

Presentation

2 fair

Contribution

1 poor

Limitations

- The current manuscript lacks a comparison with the most competitive baseline methods, as well as a comprehensive review of relevant literature.

Reviewer Gu3W8/10 · confidence 3/52023-07-05

Summary

This paper builds on recent advances in deep learning for physical simulation to produce reliable results of long-term consecutive predictions. The authors provide a proof that equivariant graph neural networks learn a linear map from initial velocity to a target velocity, and propose to inject inductive bias based on Newton-Cotes (NC) formulas as alternative of standard equivariant graph convolution. The paper introduces techniques for training, such as a new objective and a new regularization loss for higher order features, and also gives theoretical guarantee that variance can be reduced by increasing the degree of NC formula. Experiments in various multiple body interaction systems demonstrate that the proposed model outperforms state-of-the-art baselines .

Strengths

The paper is appropriately placed in the current growing literature on scientific machine learning to create a novel fast model for tackling complex problems in the realm of particle systems. Although the proposed architecture is simple in appearance, the motivation of introducing NC formulas is convincing giving both concise visualization and theoretical claims on the limitation of the existing models. Results of the experiments show that introducing NC formulas is effective to perform long-term accurate prediction. In my opinion this is a good paper and above the acceptance threshold.

Weaknesses

Although the proposed methods NC(k) and NC(k)+ outperforms state-of-the-art baselines, it is still somewhat unclear which components of NC(k)+ help to improve the performance of NC(k)+. What if setting all the coefficients of Newton-Cotes formula to be 1 (or some constant) while remaining the other parameters same? Without some additional ablation study, it is a bit difficult to get a clear picture of how new components of the proposed method would help improving its prediction performance. In the forward process, how is the coefficients of Newton-Cotes formula obtained? Is the coefficients trainable or derived from the equation (15)? It is also unclear how to derive coordinate at intermediate time step $t^{k}$ once velocity is updated by the formula (13), while the formula (12) is used only when computing the final state at T. For training time shown in Figure 2, why does the training cost of NC with GMN grow much faster than NC with the other backbones? It will be helpful to get more insight of the trends. Also, the order of NC(k) seems to be set K<=8, due to the catastrophic Runge’s phenomenon. Are there any limitation on the length of time interval [0, T] to which new NC points are spaced? How does the length of the interval affects the performance?

Questions

Please have a look at the weakness mentioned in the strength and weakness section and address these. Overall the idea is interesting, the authors need to substantiate their claims in light of possibly a few more experiments. **Minor question** What does “steps” of Table 4 in Appendix C mean?

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

4 excellent

Presentation

3 good

Contribution

4 excellent

Limitations

Yes, the limitations are discussed in the appendix.

Reviewer MNf48/10 · confidence 4/52023-07-06

Summary

This paper integrates Newton-Cotes formulas from numerical analysis in (equivariant) graph networks. The authors introduce an approach that makes several velocity estimations to predict the integration towards the final state of a system. Further, they show that standard equivariant graph networks can be interpreted as a trivial case of their formalism. The proposed method (NC) has provably lower errors/variance, and becomes better with more velocity estimations. NC can be used with supervision from intermediate velocities, but it can also work well without supervision. The authors demonstrate the effectiveness of their method on several benchmarks, and using multiple graph network architectures as a backbone.

Strengths

The paper is very well-written and easy to follow. The proposed method is well-motivated from numerical analysis, and it is simple and clear. The proposed method shows improvements on 3 different benchmarks, and using 3 established equivariant graph networks as a backbone. The non-supervised version of the method (NC) can be directly integrated in many existing graph network architectures.

Weaknesses

The analysis on the prediction errors of intermediate velocities (figures 3, 6, 7) could be more in-depth, especially for the unsupervised version of the method (NC). It is unclear why the errors often increase as training progresses, or why they tend to fluctuate erratically, and whether this has an impact on performance, or if the model can make up for it. The qualitative visualizations, especially for MD17 and n-body (figure 8) are very hard to interpret.

Questions

1. Following the weaknesses listed above, in figures 3 and 6, why do the errors fluctuate or keep increasing with epochs? What is its impact on performance? 2. The Newton-Cotes formulas exhibit a reflection symmetry. Is it possible that the model is learning to predict the reflected intermediate velocities? An ablation study on that would be useful. 3. In subsection 4.6, the authors perform an ablation study on the method's ability to make consecutive predictions. There are related works that propose equivariant graph networks for multiple step prediction, including LoCS [2] and EqMotion [1]. It would be interesting to examine the applicability and added value of NC to such methods. As an example, it would be interesting to see the integration of NC in LoCS, since this work treats velocities in a principled manner and makes predictions in local frames. #### Minor 4. In lines 161-162, the authors mention that "EGNN always uses the same input velocity and coordinate as constant features in different layers". However, EGNN does use the updated coordinates in different layers, at least in the n-body setting. #### References [1] Xu, Chenxin et al. EqMotion: Equivariant Multi-agent Motion Prediction with Invariant Interaction Reasoning. CVPR 2023. [2] Kofinas, Miltiadis et al. Roto-translated Local Coordinate Frames for Interacting Dynamical Systems. NeurIPS 2021.

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The authors have adequately addressed the limitations of their work.

Reviewer P4zh6/10 · confidence 3/52023-07-24

Summary

The paper introduces a new method for predicting system dynamics. Unlike past works that predict the average velocity between start and end time, the proposed approach makes several velocity estimation at different time points and then uses Newton-Cotes formula for computing the integration. This method reduces the prediction error and improve accuracy in predicting future state of the system. The paper improves this method further by incorporating loss for each predicted velocity estimate, and shows better performance than current SOTA systems.

Strengths

1. The paper is clearly written with good figures. Supplementary material provides additional GIFs and proofs to help with understanding. 2. The paper proposes an interesting method to improve the current dynamics prediction systems by predicting velocity estimates at different time points and then using Newton-Cotes method to integrate them. Paper proofs that this method leads to reduction in variance, and therefore the error. NC+ approach further reduces the error by incorporating additional loss. 3. The paper shows that even their NC method outperforms the previous SOTA approaches significantly. 4. Despite predicting velocities at different time points, this method doesn't degrade the training time a lotl.

Weaknesses

I feel the novelty of the method is limited. The method replaces the average velocity estimate with multiple velocity estimates that are then integrated over, something that seems pretty obvious. Also, something that is not clear is why the performance improvement saturates at only K=2, as shown in Fig 2? Another weakness is that the inference time scales linearly as the value of K is increased.

Questions

I would like authors to address the points raised in weakness section. What is the intuition behind accuracy not increasing past K=2. It seems that higher K should result in even better performance, but that's not the case.

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

4 excellent

Presentation

3 good

Contribution

3 good

Limitations

The authors have not addressed limitations in their work.

Reviewer Gu3W2023-08-11

Additional questions

Thank the authors for the response. Most of my concerns were addressed. I have a few follow-up questions on the following response: >Regarding the order of NC (k), the neural model learns to compensate for the prediction error (as illustrated in Fig. 1 and Lines 36-44). Setting a larger k may reduce the variance of the prediction error and make the optimization easier, but this strategy does not always work especially when the model is robust. Furthermore, the accuracy gain exponentially decreases as we estimate more points in numerical integration. Take Fig. 1 as an example, a shift from 1e-1 to 1e-2 yields a more significant gain compared to a shift from 1e-3 to 1e-4. For >Setting a larger k may reduce the variance of the prediction error and make the optimization easier... my question is the impact on prediction error when making the interval length longer, say [0, T] to [0, N*T]. Since the order of NC(k) (and NC(k)+) is bounded from above due to the catastrophic Runge’s phenomenon, the prediction error would also be bounded from the bottom. It would be helpful if the authors provide insights or theoretical/experimental results that clarify the robustness of the proposed method against the interval length. > Take Fig. 1 as an example, a shift from 1e-1 to 1e-2 yields a more significant gain compared to a shift from 1e-3 to 1e-4. What do you mean by shift? In appearance, I don’t see any terms relating to shift in figure 1. Can you expand the explanation?

Authorsrebuttal2023-08-11

Thank you very much for your prompt response. We appreciate the opportunity to provide further clarifications. **1. The true question is the impact on prediction error when making the interval length longer, say [0, T] to [0, N*T].** We apologize for the oversight. Exploring the impact of the interval length $T$ is indeed an interesting problem. It is important to note that a larger $T$ implies predicting the future states more distant from the input, posing greater difficulty for the model. Our theoretical analysis (Equation (11), Proposition 3.2) also reveals a positive correlation between the variance/error of prediction and the interval $T$. We have conducted some new experiments and present the results (NC ($k=2$) without additional training data) as follow: | $T$ | N-body (1,2,0) NC/GMN | MD17 (Aspirin) NC/GMN | Motion NC/GMN | |---|---:|---:|---:| | $0.5T$ | 1.50/1.81 | 6.97/7.32 | 10.2/13.7 | | $T$ | 1.55/1.84 | 9.50/10.14 | 30.0/43.9 | | $2T$ | 1.59/1.98 | 14.93/16.60 | 54.4/86.1 | | $4T$ | 1.62/2.10 | 19.05/21.60 | 98.6/165.8 | We can observe that the choice of $T$ determines the difficulty of the task to some extent. The performance of both methods decreases as $T$ increases. Specifically, the performance of the two methods slightly decreases on the N-body dataset due to its relative simplicity, but drops more rapidly on the MD17 and Motion datasets. Nevertheless, our method consistently and significantly outperforms the baseline across different $T$ values and datasets, providing empirical evidence of its robustness. Additionally, we have conducted an experiment to evaluate the performance of our method w.r.t $k$ under a long interval ($4T$). The results on MD17 (Aspirin) are presented as follows: | Method | $T$ | $4T$ | |---|:---:|:---:| | GMN | 10.14 | 21.60 | | NC ($k=2$) | 9.50 | 19.05 | | NC ($k=4$) | 9.34 | 18.69 | | NC ($k=8$) | 9.49 | 18.61 | We can observe that increasing $k$ provides more improvement with longer $T$, but the gain (4→8) remains relatively marginal. **2. In appearance, I don’t see any terms relating to shift in Figure 1. Can you expand the explanation?** We are pleased to provide a more detailed explanation. The higher-order NC formulas offer improved accuracy as well as smaller error terms. Specifically, the error terms are proportional to $T^3$, $T^5$, $T^7$ for $k=1$, $2$, and $4$, respectively. It is worth noting that the numerical gain in accuracy diminishes exponentially as $k$ increases. This can be roughly understood as $T^3 - T^5 \gg T^5 - T^7$. In other words, the incremental improvement in accuracy becomes progressively smaller with higher-order NC. Take Figure 1 as an example, the blue + yellow area represents the error of NC ($k=0$), which is significantly larger than the error of NC ($k=1$) (the blue area). The yellow area precisely represents the accuracy gain. If we extend the estimation to NC ($k=2$) in the figure, the area of its error must be a sub-area of the error of NC ($k=1$). Consequently, the accuracy gain from $k=1$ to $k=2$ is also a sub-area of the blue area and significantly smaller than the yellow area.

Reviewer Gu3W2023-08-12

Thank you very much for addressing the additional comments. > It is important to note that a larger $T$ implies predicting the future states more distant from the input, posing greater difficulty for the model. Yes, I agree with the opinion, this is one of the fundamental issues of surrogate models. But I still believe that providing results of the additional two experiments as well as theoretical results such as Proposition 3.2 and 3.3 is quite beneficial for readers working on this domain to get a clear picture of the limitation of the proposed method. In light of the further clarification on the limitation as well as the novelty of the proposed model, I increased my score. The authors’ rebuttal is satisfactory to my concerns and strengthened their claims further. Finally let me add comments on Proposition 3.2: * Expressing the equation (5) using the notation $\epsilon^{2}_{NC(0)}$ without any explanation is confusing for readers, because the notation seems to have not been introduced prior to this equation, and even looks like a constant. * Should $\epsilon_{NC}(0)$ in the equation (10) be $\epsilon_{NC(0)}$? I appreciate for the authors’ all efforts during the rebuttal period. I really enjoyed the discussion!

Authorsrebuttal2023-08-12

We sincerely appreciate your valuable feedback and unwavering support throughout the review process. We have provided an explanation for $\epsilon_{\text{NC}(0)}^2$ and corrected the typo in $\epsilon_{\text{NC}(0)}$ in the revision. We are truly grateful for your contribution.

Reviewer 9Zk22023-08-12

Thank you for the update and clarification. My previous concerns are almost resolved! While the authors have addressed the updates to the questions, I am still pondering the novelty of the cover in this work. To me, it appears to be an application of EGNN combined with Graph Neural ODE using the Newton–Cotes integrator. I want to emphasize that I am not attempting to diminish the value of the authors' work; I genuinely appreciate the specific utilization of algorithmic components such as EGNN and GDEs with Newton-Cotes integration. However, the current manuscript does not sufficiently explain why these algorithmic choices are necessary or more advantageous compared to the existing components. Could you share your opinion on this?

Authorsrebuttal2023-08-12

Thank you very much for your prompt and kind response. We appreciate the opportunity to provide further clarifications. We are pleased to provide a more detailed explanation. As mentioned in Lines 50-55, NC uses a fixed step size and evenly divides the interval into subintervals. Using NC is necessary because our data is organized in the form of trajectories with fixed intervals between states. In such cases, applying Runge-Kutta (rk4 and rk45 as mentioned by the reviewer) and other algorithms becomes challenging. Take the 4th order Runge-Kutta as an example, our problem can be modeled as: $x^T = x^0 + \frac{1}{6} (k_1 + 2k_2 + 2k_3 + k_4)$ where $k_1 = v(t^0, x^0)$, $k_2 = v(t^0+\frac{1}{2} T, x^0 + T \frac{k_1}{2})$, … It is worth noting that the true estimation of $v(t^0+\frac{1}{2} T, x^0 + T \frac{k_1}{2})$ is not feasible since $x^0 + T \frac{k_1}{2}$ is usually not an integer. Additionally, the derivative $v$ is unknown and can be only observed at certain points with fixed intervals. Therefore, we cannot directly apply rk4 to our task. From our perspective, GDEs aim to learn the parameterized derivatives and provide estimations at any time point, which requires much more training data to capture the dynamics over time. By contrast, the neural-based methods for reasoning dynamics are designed to “skip” the fine-grained steps in order to reduce the computational costs within small intervals.

Authorsrebuttal2023-08-17

We sincerely appreciate your increased rating and recognition of the efforts we put into addressing your concerns. Your contribution to our work is highly valued and greatly appreciated.

Reviewer MNf42023-08-17

Official Comment by Reviewer MNf4

I would like to thank the authors for their rebuttal; they have addressed my questions. I am very positive towards this paper and I think its contribution is significant. I am keeping my score to an 8. I hope the authors include the related works on multi-step prediction in the camera-ready version, alongside any experiments performed with the proposed method on top of them.

Authorsrebuttal2023-08-17

We are truly grateful for your valuable comments and unwavering support. We will update the relation work and experiment sections in our revision to include the multi-step prediction methods and corresponding results. Thank you once again for your insightful suggestions.

Program Chairsdecision2023-09-21

Decision

Accept (spotlight)

© 2026 NYSGPT2525 LLC