Aug 2026· Lecture notes in computer science· 1 citation· 38 references
Computer Science
TL;DR
This work proposes Graph Layer for Inference in Dynamic En- vironments (GLIDE), a novel GNN layer enhanced by two theoretically grounded design mechanisms that significantly improve learning under dynamic topology while preserving robustness in static scenarios.
Abstract
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. In this work, we investigate the representa- tional power of GNNs for forecasting under both static and dynamic settings (i.e., when pairwise correlations evolve drastically over time) and identify critical limitations in current architectures. To formalize this, we first propose Temporal Correlation Volatility (TCV), a model- agnostic metric designed to quantify the distributional evolution of these latent structures. We establish a clear connection between TCV and performance degradation, demonstrating that many popular models, including Transformers, generalize poorly in high-TCV settings and are often outperformed by simple structure-agnostic baselines. To address these limitations, we propose Graph Layer for Inference in Dynamic En- vironments (GLIDE), a novel GNN layer enhanced by two theoretically grounded design mechanisms: (D1) Path-based Message Passing, which captures path-based neighborhoods and (D2) Static and Dynamic Propagation Separation, which identifies optimal dynamics via local static approximation. These components significantly improve learning under dynamic topology while preserving robustness in static scenarios. Ex- tensive experiments on synthetic and real-world benchmarks show that GLIDE improves average performance by up to 45.6% across static and dynamic settings, with the largest gain reaching 85.7%. The source code is available at https://github.com/ChenS676/GLIDE.
A Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is “global basis, dynamic weights”, which learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs.
Zhen-Zhou Li, Xiang Li, Zhibin Niu· Proceedings of the Thirty-Fi...· 0 citations
A Params-Per-Pair diagnostic is introduced that predicts from dataset properties alone whether structural priors will help and reveals a horizon-dependent complementarity: the structural prior contributes 33% of the gain at short horizons but 88% at long horizons, confirming that time-invariant knowledge compensates as...
C. Mohapatra, Rohit Malshe, J. Pachón· 0 citations
Backtesting results reveal that the annualized return of iron ore futures outperforms the baseline strategy by an average of 7.6 percentage points across five backtesting windows, and the Decomposition-Enhanced Network effectively bridges advanced structural modeling and actionable algorithmic trading.
This work proposes CvLoss, a plug-in structural regularizer that constrains forecast residuals on a cross-variable graph and shows that CvLoss consistently improves competitive forecasting models, outperforms representative learning objectives, and is compatible with a variety of forecasting backbones.
Kuiye Ding, Yifan Hu, Hanchen Wang et al.· 1 citation
A novel theoretical model, namely the multiway autoregressive (MARS) model, which characterizes multiple evolutionary paths by capturing dependencies within and across two core factors underlying diverse evolutionary mechanisms is proposed, which develops a general DGNN framework, a multiway autoregressive network (MAN...
Ping He, Xiao-hua Xu· IEEE Transactions on Neural...· 0 citations
NLDNAR‐CP is proposed, a novel change point detection method within a node‐specific NAR framework that accommodates heterogeneous temporal dependencies across variables and efficiently detects multiple structural breaks while preserving scalability to high‐dimensional networks.
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduJul 15, 2026
Assistant Professor Pat Pataranutaporn describes a new interface that lets everyday users glimpse inside an AI's neural network before their chatbot ever says a word.
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduJul 6, 2026
PhD student Rachel Sava, winner of the Envisioning the Future of Computing Prize, explores transformative improvements and dystopian risks of neural technology.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.