Diffusion-Guided Pretraining for Brain Graph Foundation Models

• URL: http://arxiv.org/abs/2602.09437v2
• Date: Thu, 19 Feb 2026 16:57:26 GMT
• Title: Diffusion-Guided Pretraining for Brain Graph Foundation Models
• Authors: Xinxu Wei, Rong Zhou, Lifang He, Yu Zhang,
• Abstract summary: We propose a unified diffusion-based pretraining framework that addresses both limitations.<n>First, diffusion is designed to guide structure-aware dropping and masking strategies, preserving brain graph semantics.<n>Second, diffusion enables topology-aware graph-level readout and node-level global reconstruction.
• Score: 11.520820567690949
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: With the growing interest in foundation models for brain signals, graph-based pretraining has emerged as a promising paradigm for learning transferable representations from connectome data. However, existing contrastive and masked autoencoder methods typically rely on naive random dropping or masking for augmentation, which is ill-suited for brain graphs and hypergraphs as it disrupts semantically meaningful connectivity patterns. Moreover, commonly used graph-level readout and reconstruction schemes fail to capture global structural information, limiting the robustness of learned representations. In this work, we propose a unified diffusion-based pretraining framework that addresses both limitations. First, diffusion is designed to guide structure-aware dropping and masking strategies, preserving brain graph semantics while maintaining effective pretraining diversity. Second, diffusion enables topology-aware graph-level readout and node-level global reconstruction by allowing graph embeddings and masked nodes to aggregate information from globally related regions. Extensive experiments across multiple neuroimaging datasets with over 25,000 subjects and 60,000 scans involving various mental disorders and brain atlases demonstrate consistent performance improvements.

Related papers

• CodeBrain: Towards Decoupled Interpretability and Multi-Scale Architecture for EEG Foundation Model [52.466542039411515]
  EEG foundation models (EFMs) have emerged to address the scalability issues of task-specific models.<n>We present CodeBrain, a two-stage EFM designed to fill this gap.<n>In the first stage, we introduce the TFDual-Tokenizer, which decouples heterogeneous temporal and frequency EEG signals into discrete tokens.<n>In the second stage, we propose the multi-scale EEGSSM architecture, which combines structured global convolution with sliding window attention.
  arXiv  Detail & Related papers  (2025-06-10T17:20:39Z)
• A Brain Graph Foundation Model: Pre-Training and Prompt-Tuning for Any Atlas and Disorder [9.83654608793608]
  We propose a novel graph-based pre-training paradigm for constructing a brain graph foundation model.<n>BrainGFM is pre-trained on a diverse mixture of brain atlases with varying parcellations.<n>BrainGFM is pre-trained on 27 datasets spanning 25 common neurological and psychiatric disorders.
  arXiv  Detail & Related papers  (2025-05-31T20:35:53Z)
• Brain Network Classification Based on Graph Contrastive Learning and Graph Transformer [0.6906005491572401]
  This paper proposes a novel model named PHGCL-DDGformer that integrates graph contrastive learning with graph transformers.<n> Experimental results on real-world datasets demonstrate that the PHGCL-DDGformer model outperforms existing state-of-the-art approaches in brain network classification tasks.
  arXiv  Detail & Related papers  (2025-04-01T13:26:03Z)
• Predicting Infant Brain Connectivity with Federated Multi-Trajectory GNNs using Scarce Data [54.55126643084341]
  Existing deep learning solutions suffer from three major limitations. We introduce FedGmTE-Net++, a federated graph-based multi-trajectory evolution network. Using the power of federation, we aggregate local learnings among diverse hospitals with limited datasets.
  arXiv  Detail & Related papers  (2024-01-01T10:20:01Z)
• Classification of developmental and brain disorders via graph convolutional aggregation [6.6356049194991815]
  We introduce an aggregator normalization graph convolutional network by leveraging aggregation in graph sampling. The proposed model learns discriminative graph node representations by incorporating both imaging and non-imaging features into the graph nodes and edges. We benchmark our model against several recent baseline methods on two large datasets, Autism Brain Imaging Data Exchange (ABIDE) and Alzheimer's Disease Neuroimaging Initiative (ADNI)
  arXiv  Detail & Related papers  (2023-11-13T14:36:29Z)
• HDGL: A hierarchical dynamic graph representation learning model for brain disorder classification [1.7495515703051119]
  We propose a hierarchical dynamic graph representation learning (HDGL) model, which is the first model designed to address all the aforementioned challenges. We evaluate the performance of the proposed model on the ABIDE and ADHD-200 datasets.
  arXiv  Detail & Related papers  (2023-11-06T06:29:23Z)
• A Generic Shared Attention Mechanism for Various Backbone Neural Networks [53.36677373145012]
  Self-attention modules (SAMs) produce strongly correlated attention maps across different layers. Dense-and-Implicit Attention (DIA) shares SAMs across layers and employs a long short-term memory module. Our simple yet effective DIA can consistently enhance various network backbones.
  arXiv  Detail & Related papers  (2022-10-27T13:24:08Z)
• Dynamic Inference with Neural Interpreters [72.90231306252007]
  We present Neural Interpreters, an architecture that factorizes inference in a self-attention network as a system of modules. inputs to the model are routed through a sequence of functions in a way that is end-to-end learned. We show that Neural Interpreters perform on par with the vision transformer using fewer parameters, while being transferrable to a new task in a sample efficient manner.
  arXiv  Detail & Related papers  (2021-10-12T23:22:45Z)
• MoCL: Contrastive Learning on Molecular Graphs with Multi-level Domain Knowledge [28.386302970315736]
  We propose a novel framework called MoCL, which utilizes domain knowledge at both local- and global-level to assist representation learning. We evaluate MoCL on various molecular datasets under both linear and semi-supervised settings.
  arXiv  Detail & Related papers  (2021-06-05T18:00:51Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

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.