Scientist Stories: Mengjia Xu, Neuro-inspired Algorithms and Theory

29 Apr 2024 · 1 min
0:51

In this technical presentation, Mengjia Xu outlines a research program that leverages advanced graph representation learning to extract neuroimaging signatures of Alzheimer’s disease (AD) and normal brain aging. After a brief overview of AD prevalence, biomarkers (amyloid‑β, tau, and especially brain connectivity), and the advantages of magnetoencephalography (MEG) for functional connectivity, Xu reviews a suite of graph embedding techniques: classic node2vec, Gaussian embeddings that model each node as a probability distribution, and modern graph neural networks (GNNs) including graph transformers. Recognizing that brain connectomes exhibit hierarchical, tree‑like structure, Xu motivates hyperbolic (Poincaré‑disk) embeddings, explains their mathematical foundations, and describes Riemannian stochastic gradient descent with learned curvature for efficient optimization. The talk then presents two application streams. First, a hyperbolic graph convolutional network (HG‑GCN) is applied to a cohort of 76 mild‑cognitive‑impairment (MCI) patients (48 stable, 28 progressive) and 53 healthy controls, using 5‑minute resting‑state MEG data mapped to a 68‑region atlas. Gaussian and hyperbolic embeddings reveal discriminative regions (temporal and frontal cortices) and achieve superior classification of progression versus stability compared with Euclidean baselines. Second, a large‑scale aging study analyzes 587 healthy subjects aged 18–99 (MEG functional data, cortical thickness, and other multimodal features). Hyperbolic embeddings capture hierarchical radius changes across seven decade‑spanning age groups, showing a pronounced loss of hierarchy in early visual cortex, a linear decrease in primary visual areas, and a late‑life increase in hippocampal hierarchy. Subnetwork‑level analyses (dorsal/ventral attention, sensorimotor) link hierarchical radius reductions to cognitive and functional scores. Throughout, Xu emphasizes that low‑dimensional hyperbolic embeddings (as few as three dimensions) preserve graph distances and hierarchy far more efficiently than Euclidean embeddings, leading to improved downstream tasks such as link prediction and disease classification. The presentation concludes with acknowledgments of collaborators across MIT, Italy, Spain, and the United States, and notes funding sources.

More from Joshua

youtube.com

Scientist Stories: Jennifer Doudna, The Code Breaker

10mo ago
youtube.com

Founder Stories: Helmy Eltoukhy, Founder & CEO of Guardant Health

1y ago
youtube.com

Scientist Stories: Fabian Theis, Machine Learning and Systems Biology

2y ago
youtube.com

Scientist Stories: Thomas Lanyon-Hogg, Chemical Biology in Drug Discovery

2y ago
youtube.com

Founder Stories: Bobby Gaspar, Manufacturing Hematopoietic Stem Cells

2y ago
youtube.com

Scientist Stories: Dana Pe'er, Single-Cell Gene Regulation

2y ago
youtube.com

Scientist Stories: Hans Waterham, The value of phenotypic assays in peroxisomal disorders

2y ago
youtube.com

Scientist Stories: Michael Rosenblum, Exploring Regulatory T-Cells

2y ago
youtube.com

Scientist Stories: Hannah Mitchison, Expanding Ciliopathies

2y ago
youtube.com

Scientist Stories: Leonardo Ferreira, Engineered Immune Cell Therapies

2y ago
youtube.com

Scientist Stories: Joel Zlotogora, Genetic carrier screening programs for reproductive purposes

2y ago
See all content