mlsanityData to 7 Oct 2026

Predicting cognitive scores with graph neural networks through sample selection learning

arXiv 2106.09408 ↗First posted 17 Jun 2021cs.LG q-bio.NCcited by 7

Not on the map. Why?

Abstract (arXiv)

Analyzing the relation between intelligence and neural activity is of the utmost importance in understanding the working principles of the human brain in health and disease. In existing literature, functional brain connectomes have been used successfully to predict cognitive measures such as intelligence quotient (IQ) scores in both healthy and disordered cohorts using machine learning models. However, existing methods resort to flattening the brain connectome (i.e., graph) through vectorization which overlooks its topological properties. To address this limitation and inspired from the emerging graph neural networks (GNNs), we design a novel regression GNN model (namely RegGNN) for predicting IQ scores from brain connectivity. On top of that, we introduce a novel, fully modular sample selection method to select the best samples to learn from for our target prediction task. However, since such deep learning architectures are computationally expensive to train, we further propose a learning-based sample selection method that learns how to choose the training samples with the highest expected predictive power on unseen samples. For this, we capitalize on the fact that connectomes (i.e., their adjacency matrices) lie in the symmetric positive definite (SPD) matrix cone. Our results on full-scale and verbal IQ prediction outperforms comparison methods in autism spectrum disorder cohorts and achieves a competitive performance for neurotypical subjects using 3-fold cross-validation. Furthermore, we show that our sample selection approach generalizes to other learning-based methods, which shows its usefulness beyond our GNN architecture.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 14 of its 72 references that are in the map. First posted on arXiv 17 Jun 2021.

Builds on

14 of 72 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  5. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  6. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
  7. 2019Graph Transformer Networkscited by 520
  8. 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
  9. 2017Few-Shot Learning with Graph Neural Networkscited by 324
  10. 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
  11. 2019Edge-labeling Graph Neural Network for Few-shot Learningcited by 114
  12. 2021Graph Neural Networks in Network Neurosciencecited by 91
2 more
  1. 2019GMNN: Graph Markov Neural Networkscited by 82
  2. 2019Understanding the Representation Power of Graph Neural Networks in Learning Graph Topologycited by 52

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2; 2024: 2; 2025: 1.

7 papers.