mlsanityData to 13 Oct 2026

HIBMatch: Hypergraph Information Bottleneck for Semi-supervised Alzheimer's Progression

arXiv 2303.10390 ↗First posted 18 Mar 2023cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Alzheimer's disease progression prediction is critical for patients with early Mild Cognitive Impairment (MCI) to enable timely intervention and improve their quality of life. While existing progression prediction techniques demonstrate potential with multimodal data, they are highly limited by their reliance on labelled data and fail to account for a key element of future progression prediction: not all features extracted at the current moment may be relevant for predicting progression several years later. To address these limitations in the literature, we design a novel semi-supervised multimodal learning hypergraph architecture, termed HIBMatch, by harnessing hypergraph knowledge based on information bottleneck and consistency regularisation strategies. Firstly, our framework utilises hypergraphs to represent multimodal data, encompassing both imaging and non-imaging modalities. Secondly, to harmonise relevant information from the currently captured data for future MCI conversion prediction, we propose a Hypergraph Information Bottleneck (HIB) that discriminates against irrelevant information, thereby focusing exclusively on harmonising relevant information for future MCI conversion prediction. Thirdly, our method enforces consistency regularisation between the HIB and a discriminative classifier to enhance the robustness and generalisation capabilities of HIBMatch under both topological and feature perturbations. Finally, to fully exploit the unlabeled data, HIBMatch incorporates a cross-modal contrastive loss for data efficiency. Extensive experiments on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset demonstrate that our proposed HIBMatch framework surpasses existing state-of-the-art methods in Alzheimer's disease prognosis.

Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 17 of its 67 references that are in the map. First posted on arXiv 18 Mar 2023.

Builds on

17 of 67 references.

References · 17

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,009
  2. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,492
  3. 2016Densely Connected Convolutional Networkscited by 6,707
  4. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,285
  5. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,266
  6. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,082
  7. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
  8. 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,378
  9. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 539
  10. 2018Hypergraph Neural Networkscited by 485
  11. 2019ReMixMatch: Semi-Supervised Learning with Distribution Alignment and Augmentation Anchoringcited by 349
  12. 2018DropBlock: A regularization method for convolutional networkscited by 262
5 more
  1. 2020Graph Information Bottleneckcited by 168
  2. 2020CoMatch: Semi-supervised Learning with Contrastive Graph Regularizationcited by 167
  3. 2021Graph Learning: A Surveycited by 140
  4. 2022Multi-Modal Hypergraph Diffusion Network with Dual Prior for Alzheimer Classificationcited by 9
  5. 2022NorMatch: Matching Normalizing Flows with Discriminative Classifiers for Semi-Supervised Learningcited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.