Beyond Co-Movement: Locality by Exposures Enables a Joint Factor-Graph Framework for Portfolio Diversification

• URL: http://arxiv.org/abs/2608.06618v1
• Date: Thu, 06 Aug 2026 22:07:26 GMT
• Title: Beyond Co-Movement: Locality by Exposures Enables a Joint Factor-Graph Framework for Portfolio Diversification
• Abstract summary: We introduce the Mutually-INformed Graph-Locality and Exposures framework (MINGLE)<n>It mutually regularises the factor and graph domains by redefining graph locality through systematic factor exposure profiles.<n>The resulting exposure-similarity graph aligns more closely with established economic sectors than conventional correlation-based graphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Current portfolio construction methods are either agnostic to the effects of idiosyncratic shocks (standard factor models) or to the latent data structure driving systematic returns (recent graph-based approaches). This presents an opportunity to combine the complementary market aspects captured by the factor and graph domains, allowing asset allocations to operate directly on the underlying market structure, rather than on its observed co-movement or its finite-sample artefacts. In this work, we introduce the Mutually-INformed Graph-Locality and Exposures framework (MINGLE), which mutually regularises the factor and graph domains by redefining graph locality through systematic factor exposure profiles, rather than via observed co-movements. This is formalised through a unified Alternating Direction Method of Multipliers (ADMM) framework that jointly learns a latent factor representation and its induced graph topology directly from market returns. The resulting exposure-similarity graph aligns more closely with established economic sectors than conventional correlation-based graphs. Portfolios constructed from this representation are shown to consistently outperform their correlation-based counterparts across a range of volatility regimes and transaction cost levels. For rigour, paired statistical testing confirms that these gains stem from the reconciliation of the graph and factor domains.

Related papers

• Relational Multi-Agent Reinforcement Learning for Dynamic Pricing in High-Speed Railway Markets [5.680630061642918]
  In liberalised railway systems, operators must set prices dynamically in an environment with partial observability.<n>Agents must learn to infer strategic interactions only from observable market data.<n>An entity graph modelling approach is proposed, which represents the environment as a graph of operational units.<n>An extension of the multi-agent twin delayed deep deterministic policy gradient algorithm with graph-based representation learning processes the features of the entities.
  arXiv  Detail & Related papers  (2026-07-06T14:58:26Z)
• Geometrical fairness in graph neural networks [0.5872014229110214]
  We introduce a fairness-aware adaptation of graph-based diffusion by modifying the underlying Laplacian operator.<n>We provide a principled analysis of the resulting behavior and establish theoretical insights into fairness properties.
  arXiv  Detail & Related papers  (2026-06-16T08:50:30Z)
• 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)
• G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge [88.82814893945077]
  Large language models (LLMs) excel at complex reasoning but remain limited by static and incomplete parametric knowledge.<n>Recent graph-enhanced RAG (GraphRAG) attempts to bridge this gap by constructing tailored graphs and enabling LLMs to reason on them.<n>G-reasoner is a unified framework that integrates graph and language foundation models for reasoning over diverse graph-structured knowledge.
  arXiv  Detail & Related papers  (2025-09-29T04:38:12Z)
• GraphOracle: A Foundation Model for Knowledge Graph Reasoning [9.894106590443714]
  We introduce textbftextscGraphOracle, a relation-centric foundation model that unifies reasoning across knowledge graphs.<n>A query-dependent attention mechanism is developed to learn inductive representations for both relations and entities.<n>Pre-training on diverse knowledge graphs, followed by minutes-level fine-tuning, enables effective generalization to unseen entities, relations, and entire graphs.
  arXiv  Detail & Related papers  (2025-05-16T11:14:57Z)
• Graph Structure Refinement with Energy-based Contrastive Learning [56.957793274727514]
  We introduce an unsupervised method based on a joint of generative training and discriminative training to learn graph structure and representation.<n>We propose an Energy-based Contrastive Learning (ECL) guided Graph Structure Refinement (GSR) framework, denoted as ECL-GSR.<n>ECL-GSR achieves faster training with fewer samples and memories against the leading baseline, highlighting its simplicity and efficiency in downstream tasks.
  arXiv  Detail & Related papers  (2024-12-20T04:05:09Z)
• Evaluating Financial Relational Graphs: Interpretation Before Prediction [4.421486904657393]
  We introduce the SPNews dataset, collected based on S&P 500 Index stocks, to facilitate the construction of dynamic relationship graphs. By using the relationship graph to explain historical financial phenomena, we assess its validity before constructing a graph neural network. Our evaluation methods can effectively differentiate between various financial relationship graphs, yielding more interpretable results.
  arXiv  Detail & Related papers  (2024-09-28T22:43:00Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Knowledge Graph Completion with Counterfactual Augmentation [23.20561746976504]
  We introduce a counterfactual question: "would the relation still exist if the neighborhood of entities became different from observation?" With a carefully designed instantiation of a causal model on the knowledge graph, we generate the counterfactual relations to answer the question. We incorporate the created counterfactual relations with the GNN-based framework on KGs to augment their learning of entity pair representations.
  arXiv  Detail & Related papers  (2023-02-25T14:08:15Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Algorithms for Learning Graphs in Financial Markets [5.735035463793008]
  We investigate the fundamental problem of learning undirected graphical models under Laplacian structural constraints. We present natural justifications, supported by empirical evidence, for the usage of the Laplacian matrix as a model for the precision matrix of financial assets. We design numerical algorithms based on the alternating direction method of multipliers to learn undirected, weighted graphs.
  arXiv  Detail & Related papers  (2020-12-31T02:48:35Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

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.