MDGMIX: Boundary-Aware Subgraph Mixing for Multi-Domain Graph Pre-Training

• URL: http://arxiv.org/abs/2605.25771v1
• Date: Mon, 25 May 2026 12:21:27 GMT
• Title: MDGMIX: Boundary-Aware Subgraph Mixing for Multi-Domain Graph Pre-Training
• Abstract summary: Multi-domain graph pre-training is a crucial step in constructing foundational graph models.<n>This paper empirically reveals significant data redundancy in multi-domain graph pre-training.<n>We propose the Multi-domain Graph Pre-training Framework, MDGMIX, which combines boundary-aware subgraph mixing with hierarchical discrimination.
• Score: 20.866173432752934
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-domain graph pre-training is a crucial step in constructing foundational graph models with cross-domain generalization capabilities. However, existing methods predominantly rely on jointly training all source domain graphs, resulting in high computational costs. Furthermore, it remains unclear whether all source domain graph data contribute equally to effective transfer. This paper empirically reveals significant data redundancy in multi-domain graph pre-training. Based on this finding, we propose the Multi-domain Graph Pre-training Framework, MDGMIX, which combines boundary-aware subgraph mixing with hierarchical discrimination. By selecting boundary nodes to construct challenging mixed-domain subgraphs, MDGMIX employs coarse-grained domain discrimination and fine-grained domain decomposition losses to decouple shared patterns from domain-specific patterns. During adaptation, MDGMIX employs a lightweight prompt weighting mechanism to transfer source domain knowledge. Extensive experiments demonstrate that MDGMIX consistently outperforms strong baselines in few-shot classification tasks while exhibiting superior time and memory efficiency. The code is available at: https://github.com/zhengziyu77/MDGMIX.

Related papers

• Decoupled and Divergence-Conditioned Prompt for Multi-domain Dynamic Graph Foundation Models [59.8742208800447]
  We propose DyGFM, a Dynamic Graph Foundation Model over multiple domains based on decoupled and divergence-conditioned prompting.<n>We show that DyGFM consistently outperforms 12 state-of-the-art baselines on both node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2026-05-13T13:50:03Z)
• LEDA: Latent Semantic Distribution Alignment for Multi-domain Graph Pre-training [26.195024921277962]
  We propose a novel Latent sEmantic Distribution Alignment (LEDA) model for universal graph pre-training.<n>LEDA exhibits strong performance across a broad range of graphs and downstream tasks.
  arXiv  Detail & Related papers  (2026-02-26T06:18:14Z)
• Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding [29.231227321203136]
  We propose a unified multi-domain textbfGraph textbfPre-training method across textbfHomogeneous and textbfHeterogeneous graphs.<n>$textGPH2$ enables stable transfer across graph types and domains, significantly outperforming existing graph pre-training methods.
  arXiv  Detail & Related papers  (2026-02-13T16:34:55Z)
• Contrastive Graph Modeling for Cross-Domain Few-Shot Medical Image Segmentation [58.41482540044918]
  Cross-domain few-shot medical image segmentation (CD-FSMIS) offers a promising and data-efficient solution for medical applications.<n>We present Contrastive Graph Modeling (C-Graph), a framework that leverages the structural consistency of medical images as a reliable domain-transferable prior.
  arXiv  Detail & Related papers  (2025-12-25T14:00:17Z)
• Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignment [9.215549756572976]
  Real-world graphs are often sparse and prone to noisy connections and adversarial attacks.<n>We propose the Multi-Domain Graph Foundation Model (MDGFM), a unified framework that aligns and leverages cross-domain topological information.<n>By aligning topologies, MDGFM not only improves multi-domain pre-training but also enables robust knowledge transfer to unseen domains.
  arXiv  Detail & Related papers  (2025-02-04T05:09:23Z)
• Exploiting Graph Structured Cross-Domain Representation for Multi-Domain Recommendation [71.45854187886088]
  Multi-domain recommender systems benefit from cross-domain representation learning and positive knowledge transfer. We use temporal intra- and inter-domain interactions as contextual information for our method called MAGRec. We perform experiments on publicly available datasets in different scenarios where MAGRec consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-02-12T19:51:32Z)
• Multi-label Image Classification using Adaptive Graph Convolutional Networks: from a Single Domain to Multiple Domains [8.02139126500224]
  This paper proposes an adaptive graph-based approach for multi-label image classification. It is done by integrating an attention-based mechanism and a similarity-preserving strategy. The proposed framework is then extended to multiple domains using an adversarial training scheme.
  arXiv  Detail & Related papers  (2023-01-11T14:42:47Z)
• FIXED: Frustratingly Easy Domain Generalization with Mixup [53.782029033068675]
  Domain generalization (DG) aims to learn a generalizable model from multiple training domains such that it can perform well on unseen target domains. A popular strategy is to augment training data to benefit generalization through methods such as Mixupcitezhang 2018mixup. We propose a simple yet effective enhancement for Mixup-based DG, namely domain-invariant Feature mIXup (FIX) Our approach significantly outperforms nine state-of-the-art related methods, beating the best performing baseline by 6.5% on average in terms of test accuracy.
  arXiv  Detail & Related papers  (2022-11-07T09:38:34Z)
• Finding Diverse and Predictable Subgraphs for Graph Domain Generalization [88.32356432272356]
  This paper focuses on out-of-distribution generalization on graphs where performance drops due to the unseen distribution shift. We propose a new graph domain generalization framework, dubbed as DPS, by constructing multiple populations from the source domains. Experiments on both node-level and graph-level benchmarks shows that the proposed DPS achieves impressive performance for various graph domain generalization tasks.
  arXiv  Detail & Related papers  (2022-06-19T07:57:56Z)
• Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation [56.694330303488435]
  We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework. In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-07-17T07:52:44Z)

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.