Interpreting Temporal Graph Neural Networks with Koopman Theory
원문 초록
Spatiotemporal graph neural networks (STGNNs) have shown promising results in many domains, from forecasting to epidemiology. However, understanding the dynamics learned by these models and explaining their behaviour is significantly more complex than for models dealing with static data. Inspired by Koopman theory, which allows a simpler description of intricate, nonlinear dynamical systems, we introduce an explainability approach for temporal graphs. We present two methods to interpret the STGNN's decision process and identify the most relevant spatial and temporal patterns in the input for the task at hand. The first relies on dynamic mode decomposition (DMD), a Koopman-inspired dimensionality reduction method. The second relies on sparse identification of nonlinear dynamics (SINDy), a popular method for discovering governing equations, which we use for the first time as a general tool for explainability. We show how our methods can correctly identify interpretable features such as infection times and infected nodes in the context of dissemination processes.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Filtered Markovian Projection: Dimensionality Reduction in Filtering for Stochastic Reaction Networks
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Active Learning for Manifold Gaussian Process Regression
Distributed Lyapunov Functions for Nonlinear Networks
Deep Symmetric Autoencoders from the Eckart-Young-Schmidt Perspective
Enabling stratified sampling in high dimensions via nonlinear dimensionality reduction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.