Hugging Face Trending Papers

Multi-Term Fourier Graph Neural Network with Sample Relationship Learning for Enhanced Remaining Useful Life Prediction

arXiv Machine Learning
Sep 22

SiST-GNN: Simultaneous Spatial-Temporal Message Passing for Dynamic Graph Representation Learning

SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.

By Shubhajit Roy, Anirban Dasgupta
arXiv Machine Learning
Sep 23

Spatiotemporal Kronecker Covariance Neural Networks

The paper introduces the Kronecker coVariance Neural Network (KVNN), a temporal graph neural network that models spatiotemporal covariance matrices as sums of Kronecker products, decoupling spatial and temporal dependencies. KVNNs perform filtering on spatial and temporal components, enabling expressive processing, rigorous spectral analysis, and provable stability to finite-sample estimation errors. Experiments on five real-world datasets show that KVNNs deliver strong forecasting performance with fewer trainable parameters than competing methods and maintain consistency under estimation noise.

By Andrea Cavallo, Athanasios Georgoutsos, Elvin Isufi
Hugging Face Trending Papers
Aug 7

When GNNs Fail: Quantifying and Overcoming Temporal Correlation Volatility in Time Series

Modeling multivariate time series by representing them as graphs, where individual series act as nodes and pairwise temporal corre- lations serve as edges, has gained significant traction. Recent advances in Graph Neural Networks (GNNs) have demonstrated strong perfor- mance by assuming a static graph topology and aggregating information from neighboring series.