arXiv Machine Learning July 20, 2026 By Riccardo Cappi, Paolo Frazzetto, Nicol\`o Navarin, Alessandro Sperduti

Discovering Generalizable Governing Equations for Graph Dynamical Systems with Interpretable Neural Networks

Read the original on arXiv Machine Learning →

arXiv:2508. 18173v2 Announce Type: replace Abstract: The discovery of symbolic governing equations is a central goal in science; yet, it remains challenging particularly for graph dynamical systems, where the network topology further shapes the system behavior.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

benchmarks

arXiv Machine Learning

4d ago

Data-Efficient Time-Dependent PDE Surrogates: Graph Neural Simulators vs. Neural Operators

arXiv:2509.06154v3 Announce Type: replace Abstract: Developing accurate, data-efficient surrogate models is central to advancing AI for Science. Neural operators (NOs), which approximate mappings bet...

By Dibyajyoti Nayak, Somdatta Goswami

benchmarks

arXiv Machine Learning

Jul 7

MeGA-MP: Metric Graph Advection Message Passing -- A Physics-Informed Message Passing Operator for Advection-Dominated Metric Graphs

arXiv:2607. 05167v1 Announce Type: new Abstract: Many real-world systems are organized as networks where spatio-temporal dynamics unfold along connections and not discretely between nodes.

By Janine Strotherm, Luca Hermes, Andr\'e Artelt, Barbara Hammer

safety

arXiv AI

Jul 14

GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization

arXiv:2607. 10127v1 Announce Type: cross Abstract: Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery.

By Xuanzhou Chen, Taoli Cheng

llms rag reinforcement-learning fine-tuning benchmarks

arXiv Machine Learning

Jul 22

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures

arXiv:2509. 12484v2 Announce Type: replace Abstract: We propose a novel neural network architecture, called Non-Trainable Modification (NTM), for computing Nash equilibria in stochastic differential games (SDGs) on graphs.

By Ruimeng Hu, Jihao Long, Haosheng Zhou

rag agents robotics benchmarks safety

arXiv Statistics ML

Aug 25

Symbolic Neural ODEs: Learning interpretable models from time-series data

arXiv:2608.22112v1 Announce Type: cross Abstract: We present a machine learning framework for identifying sparse, interpretable models of dynamical systems directly from time-series data. Our approac...

By Nibodh Boddupalli, Jeff Moehlis

efficiency

arXiv AI

Jul 16

Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agentic System

arXiv:2607. 13608v1 Announce Type: new Abstract: Automatic scientific discovery has long been a goal of computational scholars - a machine that can discover nature's secrets on its own, moving computational systems beyond data-fitting tools toward the generation and refinement of mechanistic models of the universe.

By David Krongauz, Arad Zulti, Eran Segal, Teddy Lazebnik

llms agents benchmarks

One email a morning, machine-written

Related stories

Data-Efficient Time-Dependent PDE Surrogates: Graph Neural Simulators vs. Neural Operators

MeGA-MP: Metric Graph Advection Message Passing -- A Physics-Informed Message Passing Operator for Advection-Dominated Metric Graphs

GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures

Symbolic Neural ODEs: Learning interpretable models from time-series data

Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agentic System