Unveiling the Actual Performance of Neural-based Models for Equation Discovery on Graph Dynamical Systems
Riccardo Cappi, Paolo Frazzetto, Nicol\`o Navarin, Alessandro Sperduti

TL;DR
This paper evaluates neural-based models for discovering governing equations in graph dynamical systems, highlighting the interpretability and effectiveness of novel Kolmogorov-Arnold Networks compared to traditional methods.
Contribution
Introduces a graph-adapted Kolmogorov-Arnold Network and provides a comprehensive comparison of symbolic regression techniques for equation discovery on networks.
Findings
Both MLP and KAN models successfully identify underlying equations.
KAN models offer greater interpretability and parsimony.
Neural architectures outperform existing baselines in accuracy.
Abstract
The ``black-box'' nature of deep learning models presents a significant barrier to their adoption for scientific discovery, where interpretability is paramount. This challenge is especially pronounced in discovering the governing equations of dynamical processes on networks or graphs, since even their topological structure further affects the processes' behavior. This paper provides a rigorous, comparative assessment of state-of-the-art symbolic regression techniques for this task. We evaluate established methods, including sparse regression and MLP-based architectures, and introduce a novel adaptation of Kolmogorov-Arnold Networks (KANs) for graphs, designed to exploit their inherent interpretability. Across a suite of synthetic and real-world dynamical systems, our results demonstrate that both MLP and KAN-based architectures can successfully identify the underlying symbolic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
