Adapting HFMCA to Graph Data: Self-Supervised Learning for Generalizable fMRI Representations
Functional magnetic resonance imaging (fMRI) analysis faces significant challenges due to limited dataset sizes and domain variability between studies. Traditional self-supervised learning methods inspired by computer vision often rely on positive and negative sample pairs, which can be problematic for neuroimaging data where defining appropriate contrasts is non-trivial. We propose adapting a recently developed Hierarchical Functional Maximal Correlation Algorithm (HFMCA) to graph-structured fMRI data, providing a theoretically grounded approach that measures statistical dependence via density ratio decomposition in a reproducing kernel Hilbert space (RKHS), and applies HFMCA-based pretraining to learn robust and generalizable representations. Evaluations across five neuroimaging datasets demonstrate that our adapted method produces competitive embeddings for various classification tasks and enables effective knowledge transfer to unseen datasets. Codebase and supplementary material can be found here: https://github.com/fr30/mri-eigenencoder
Authors
- Shujian Yu (ORCID: https://orcid.org/0000-0002-6385-1705)
- Guido van Wingen (ORCID: https://orcid.org/0000-0003-3076-5891)
- Qiang Li (ORCID: https://orcid.org/0000-0002-1258-8564)
- Jakub Frac
- Alexander Schmatz
Institutions
- Center for Translational Research in Neuroimaging and Data Science (US)
- Amsterdam University Medical Centers (NL)
- Vrije Universiteit Amsterdam (NL)
Publication Details
- Published
- 2026-04-21
- DOI
- https://doi.org/10.1109/icassp55912.2026.11460861
- Primary Topic
- Advanced Graph Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Vrije Universiteit Amsterdam