Graph-Augmented LSTM for Forecasting Sparse Anomalies in Graph-Structured Time Series
Sneh Pillai
TL;DR
The paper tackles anomaly detection in graph-structured, multivariate time series with sparse anomalies by introducing Graph-Augmented LSTM, which propagates neighbor information during forecasting. Anomalies are detected from forecast residuals via per-node thresholds, with explicit modeling of the graph topology to capture cross-series dependencies. Empirical results on Yahoo S5 and METR-LA show state-of-the-art F1-scores, with significant gains over LSTM-only, ARIMA, and Prophet, and ablations confirming the critical role of accurate graph structure. The work demonstrates the practical value of graph-informed forecasting for reliable anomaly detection in complex systems and outlines avenues for dynamic graph learning and more expressive graph neural architectures.
Abstract
Detecting anomalies in time series data is a critical task across many domains. The challenge intensifies when anomalies are sparse and the data are multivariate with relational dependencies across sensors or nodes. Traditional univariate anomaly detectors struggle to capture such cross-node dependencies, particularly in sparse anomaly settings. To address this, we propose a graph-augmented time series forecasting approach that explicitly integrates the graph of relationships among time series into an LSTM forecasting model. This enables the model to detect rare anomalies that might otherwise go unnoticed in purely univariate approaches. We evaluate the approach on two benchmark datasets - the Yahoo Webscope S5 anomaly dataset and the METR-LA traffic sensor network - and compare the performance of the Graph-Augmented LSTM against LSTM-only, ARIMA, and Prophet baselines. Results demonstrate that the graph-augmented model achieves significantly higher precision and recall, improving F1-score by up to 10% over the best baseline
