Crisis-Resilient Portfolio Management via Graph-based Spatio-Temporal Learning
- URL: http://arxiv.org/abs/2510.20868v1
- Date: Thu, 23 Oct 2025 06:23:15 GMT
- Title: Crisis-Resilient Portfolio Management via Graph-based Spatio-Temporal Learning
- Abstract summary: We present CRISP (Crisis-Resilient Investment through S-temporal Patterns), a graph-based graph-basedtemporal learning framework.<n>Unlike fixed-topology methods, CRISP discovers which relationships asset matter through attention mechanisms.<n>This enables adaptive portfolio allocation that maintains profitability during downturns.
- Score: 9.3237091894548
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Financial time series forecasting faces a fundamental challenge: predicting optimal asset allocations requires understanding regime-dependent correlation structures that transform during crisis periods. Existing graph-based spatio-temporal learning approaches rely on predetermined graph topologies--correlation thresholds, sector classifications--that fail to adapt when market dynamics shift across different crisis mechanisms: credit contagion, pandemic shocks, or inflation-driven selloffs. We present CRISP (Crisis-Resilient Investment through Spatio-temporal Patterns), a graph-based spatio-temporal learning framework that encodes spatial relationships via Graph Convolutional Networks and temporal dynamics via BiLSTM with self-attention, then learns sparse structures through multi-head Graph Attention Networks. Unlike fixed-topology methods, CRISP discovers which asset relationships matter through attention mechanisms, filtering 92.5% of connections as noise while preserving crisis-relevant dependencies for accurate regime-specific predictions. Trained on 2005--2021 data encompassing credit and pandemic crises, CRISP demonstrates robust generalization to 2022--2024 inflation-driven markets--a fundamentally different regime--by accurately forecasting regime-appropriate correlation structures. This enables adaptive portfolio allocation that maintains profitability during downturns, achieving Sharpe ratio 3.76: 707% improvement over equal-weight baselines and 94% improvement over static graph methods. Learned attention weights provide interpretable regime detection, with defensive cluster attention strengthening 49% during crises versus 31% market-wide--emergent behavior from learning to forecast rather than imposing assumptions.
Related papers
- Uncovering Salience-Driven Dynamics in Consumer Confidence with Generative Social Simulation [56.70690339492564]
We introduce ConsumerSim, a generative Human--Environment response framework that reconstructs Consumer Confidence Index dynamics.<n>Across U.S., EU27, and Japanese official CCI target series, ConsumerSim ranks first among persistence, time-series, regression, and shocks information-augmented baselines.<n>Findings support a behavioral view of consumer confidence as an interpretable Human--Environment response process.
arXiv Detail & Related papers (2026-06-29T14:46:22Z) - Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [86.99017195607077]
We address real-time sampling and estimation of autoregressive Markovian sources in wireless networks.<n>We propose a graphical reinforcement learning framework for policy optimization.<n>Theoretically, our proposed policies are transferable, allowing a policy trained on one graph to be effectively applied to structurally similar graphs.
arXiv Detail & Related papers (2026-01-19T02:18:45Z) - Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration [56.074760766965085]
PRISM achieves a dynamics-aware framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge.<n>Our findings suggest that disentangling data based on internal optimization regimes is crucial for scalable and robust agent alignment.
arXiv Detail & Related papers (2026-01-12T05:43:20Z) - Topology Identification and Inference over Graphs [61.06365536861156]
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
arXiv Detail & Related papers (2025-12-11T00:47:09Z) - Explainable Heterogeneous Anomaly Detection in Financial Networks via Adaptive Expert Routing [9.3237091894548]
Existing detectors treat all anomalies uniformly, producing scores without revealing which mechanism is failing.<n>We address these via adaptive graph learning with specialized expert networks that provide built-in interpretability.<n>We achieve 92.3% detection of 13 major events with 3.8-day lead time, outperforming best baseline by 30.8pp.
arXiv Detail & Related papers (2025-10-20T01:30:41Z) - Conformal Inference for Time Series over Graphs [29.748266176856973]
We develop a sequential prediction framework tailored for graph time series.<n>A key technical innovation is to leverage the graph structure and thus capture pairwise dependencies across nodes.<n>Our scheme yields an exponential shrinkage in the volume of the ellipsoidal prediction set relative to its graph-agnostic counterpart.
arXiv Detail & Related papers (2025-10-13T06:32:09Z) - Revisiting Multivariate Time Series Forecasting with Missing Values [74.56971641937771]
Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
arXiv Detail & Related papers (2025-09-27T20:57:48Z) - A Study of Dynamic Stock Relationship Modeling and S&P500 Price Forecasting Based on Differential Graph Transformer [4.6028394466086535]
We propose a Differential Graph Transformer framework for dynamic relationship modeling and price prediction.<n>Our DGT integrates sequential graph structure changes into multi-head self-attention.<n>Clausal temporal attention captures global/local dependencies in price sequences.
arXiv Detail & Related papers (2025-06-23T14:53:31Z) - Beyond Attention: Learning Spatio-Temporal Dynamics with Emergent Interpretable Topologies [0.20482269513546453]
Graph Attention Networks (GATs) are popular for modeling spatial dependencies, but they rely on predefined adjacency structures and dynamic attention scores.<n>We propose InterGAT, a simplified alternative that replaces masked attention with a fully learnable, symmetric node interaction matrix.<n>Our framework, InterGAT-GRU, outperforms the baseline GAT-GRU in forecasting accuracy, achieving at least a 21% improvement on the SZ-Taxi dataset and a 6% improvement on the Los-Loop dataset.
arXiv Detail & Related papers (2025-06-01T01:27:32Z) - Modeling Regime Structure and Informational Drivers of Stock Market Volatility via the Financial Chaos Index [0.0]
This paper investigates the structural dynamics of stock market volatility through the Financial Chaos Index.<n>We identify three distinct market regimes, low-chaos, intermediate-chaos, and high-chaos, each characterized by differing levels of systemic stress.<n>We find that shifts in macroeconomic, financial, policy, and geopolitical uncertainty exhibit strong predictive power for volatility dynamics across regimes.
arXiv Detail & Related papers (2025-04-26T15:48:11Z) - Topology-Aware Conformal Prediction for Stream Networks [54.505880918607296]
We propose Spatio-Temporal Adaptive Conformal Inference (textttCISTA), a novel framework that integrates network topology and temporal dynamics into the conformal prediction framework.<n>Our results show that textttCISTA effectively balances prediction efficiency and coverage, outperforming existing conformal prediction methods for stream networks.
arXiv Detail & Related papers (2025-03-06T21:21:15Z) - Compressed Regression over Adaptive Networks [58.79251288443156]
We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem.
We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
arXiv Detail & Related papers (2023-04-07T13:41:08Z) - Causally-guided Regularization of Graph Attention Improves
Generalizability [69.09877209676266]
We introduce CAR, a general-purpose regularization framework for graph attention networks.
Methodname aligns the attention mechanism with the causal effects of active interventions on graph connectivity.
For social media network-sized graphs, a CAR-guided graph rewiring approach could allow us to combine the scalability of graph convolutional methods with the higher performance of graph attention.
arXiv Detail & Related papers (2022-10-20T01:29:10Z) - Temporal-Relational Hypergraph Tri-Attention Networks for Stock Trend
Prediction [45.74513775015998]
We present a collaborative temporal-relational modeling framework for end-to-end stock trend prediction.
A novel hypergraph tri-attention network (HGTAN) is proposed to augment the hypergraph convolutional networks.
In this manner, HGTAN adaptively determines the importance of nodes, hyperedges, and hypergraphs during the information propagation among stocks.
arXiv Detail & Related papers (2021-07-22T02:16:09Z) - Stochastically forced ensemble dynamic mode decomposition for
forecasting and analysis of near-periodic systems [65.44033635330604]
We introduce a novel load forecasting method in which observed dynamics are modeled as a forced linear system.
We show that its use of intrinsic linear dynamics offers a number of desirable properties in terms of interpretability and parsimony.
Results are presented for a test case using load data from an electrical grid.
arXiv Detail & Related papers (2020-10-08T20:25:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.