arXiv Machine Learning

Deep graph kernel point processes over networks

arXiv Machine Learning
Sep 4

Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs

The paper introduces a statistical feature augmentation technique that encodes behavioral interaction statistics into the input space for dynamic graph anomaly detection. Experiments on Reddit, Wikipedia, and MOOC datasets across seven models—both continuous-time and discrete-time—show that this augmentation consistently improves detection performance compared to models trained on original embeddings. The enriched input also facilitates fine-grained post-hoc analysis of behavioral importance, linking classical network analysis with deep learning.

By Philipp Schlinge, Jean-Luc Schnipper, Martin Atzmueller
arXiv AI
6d ago

DES-JEPA: Learning a Shared Vocabulary for High-Dimensional Discrete Event Sequences

DES-JEPA introduces a joint-embedding predictive architecture that learns a shared discrete vocabulary from synthetic stochastic processes with unaligned event vocabularies. Coupled with DES-PFN, a prior‑fitted network that reuses this vocabulary for in‑context next‑event prediction, the framework can handle up to 700 distinct event types without task‑specific fine‑tuning. It achieves competitive zero‑shot performance on eight unseen real‑world datasets, addressing the limitations of current foundation models for high‑dimensional discrete event sequences.

By Hugo Math, Maximilian Forstenh\"ausler, Christos Anagnostopoulos
arXiv Machine Learning
Aug 27

DeltaGNN: Graph Neural Network with Information Flow Control

DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.

By Kevin Mancini, Islem Rekik
arXiv Machine Learning
Oct 3

Information propagation dynamics in Deep Graph Networks

The paper explores how information propagates in Deep Graph Networks (DGNs) for both static and dynamic graphs, treating DGNs as dynamical systems. It presents new architectures that better preserve long‑term node dependencies and learn complex spatio‑temporal patterns from irregular, sparsely sampled dynamic graphs. The work combines theoretical analysis with empirical results to demonstrate the effectiveness of these designs.

By Alessio Gravina