mlsanityData to 7 Oct 2026

GINTRIP: Interpretable Temporal Graph Regression using Information bottleneck and Prototype-based method

arXiv 2409.10996 ↗First posted 17 Sep 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep neural networks (DNNs) have demonstrated remarkable performance across various domains, but their inherent complexity makes them challenging to interpret. This is especially true for temporal graph regression tasks due to the complex underlying spatio-temporal patterns in the graph. While interpretability concerns in Graph Neural Networks (GNNs) mirror those of DNNs, no notable work has addressed the interpretability of temporal GNNs to the best of our knowledge. Innovative methods, such as prototypes, aim to make DNN models more interpretable. However, a combined approach based on prototype-based methods and Information Bottleneck (IB) principles has not yet been developed for temporal GNNs. Our research introduces a novel approach that uniquely integrates these techniques to enhance the interpretability of temporal graph regression models. The key contributions of our work are threefold: We introduce the Graph INterpretability in Temporal Regression task using Information bottleneck and Prototype (GINTRIP) framework, the first combined application of IB and prototype-based methods for interpretable temporal graph tasks. We derive a novel theoretical bound on mutual information (MI), extending the applicability of IB principles to graph regression tasks. We incorporate an unsupervised auxiliary classification head, fostering diverse concept representation using multi-task learning, which enhances the model's interpretability. Our model is evaluated on real-world datasets like traffic and crime, outperforming existing methods in both forecasting accuracy and interpretability-related metrics such as MAE, RMSE, MAPE, and fidelity.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 36 references that are in the map. First posted on arXiv 17 Sep 2024.

Builds on

21 of 36 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  3. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  4. 2018This Looks Like That: Deep Learning for Interpretable Image Recognitioncited by 731
  5. 2020Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networkscited by 563
  6. 2019GMAN: A Graph Multi-Attention Network for Traffic Predictioncited by 433
  7. 2020Parameterized Explainer for Graph Neural Networkcited by 423
  8. 2020Explainability in Graph Neural Networks: A Taxonomic Surveycited by 383
  9. 2021Spatial-Temporal Graph ODE Networks for Traffic Flow Forecastingcited by 209
  10. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
  11. 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
  12. 2021Discrete Graph Structure Learning for Forecasting Multiple Time Seriescited by 169
9 more
  1. 2020Interpreting Graph Neural Networks for NLP With Differentiable Edge Maskingcited by 152
  2. 2022Rethinking Semantic Segmentation: A Prototype Viewcited by 140
  3. 2021Improving Subgraph Recognition with Variational Graph Information Bottleneckcited by 45
  4. 2020Multi-Loss Weighting with Coefficient of Variationscited by 36
  5. 2023The expressive power of pooling in Graph Neural Networkscited by 35
  6. 2022Spatial-Temporal Sequential Hypergraph Network for Crime Prediction with Dynamic Multiplex Relation Learningcited by 32
  7. 2023Interpretable Prototype-based Graph Information Bottleneckcited by 23
  8. 2021Unsupervised Image Segmentation by Mutual Information Maximization and Adversarial Regularizationcited by 13
  9. 2023Explainable Spatio-Temporal Graph Neural Networkscited by 13

Built on by

Not cited yet.