Uncover Governing Law of Pathology Propagation Mechanism Through A Mean-Field Game
Tingting Dan, Zhihao Fan, Guorong Wu
摘要
Alzheimer’s disease (AD) is marked by cognitive decline along with the widespread of tau aggregates across the brain cortex. Due to the challenges of imaging pathology spreading flows in vivo , however, quantitative analysis on the cortical pathways of tau propagation and its interaction with the cascade of amyloid-beta (A β ) plaques lags behind the experimental insights of underlying pathophysiological mechanisms. To address this challenge, we present a physics-informed neural network, empowered by mean-field theory, to uncover the biologically meaningful spreading pathways of tau aggregates between two longitudinal snapshots. Following the notion of ‘prion-like’ mechanism in AD, we first formulate the dynamics of tau propagation as a mean-field game (MFG), where the spread of tau aggregate at each location (aka. agent) depends on the collective behavior of the surrounding agents as well as the potential field formed by amyloid burden. Given the governing equation of propagation dynamics, MFG reaches an equilibrium that allows us to model the evolution of tau aggregates as an optimal transport with the lowest cost in Wasserstein space. By leveraging the variational primal-dual structure in MFG, we propose a Wasserstein -1 Lagrangian generative adversarial network (GAN), in which a Lipschitz critic seeks the appropriate transport cost at the population level and a generator parameterizes the flow fields of optimal transport across individuals. Additionally, we incorporate a symbolic regression module to derive an explicit formulation capturing the A β -tau crosstalk. Experimental results on public neuroimaging datasets demonstrate that our explainable deep model not only yields precise and reliable predictions of future tau progression for unseen new subjects but also provides a new window to uncover new understanding of pathology propagation in AD through learning-based approaches.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper5
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding 等ICML 2020 · 被引用 1,910 次
- Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientsBrenden K. Petersen, Mikel Landajuela, T. Nathan Mundhenk, Cláudio Prata Santiago 等ICLR 2021 · 被引用 444 次
- GRAND: Graph Neural DiffusionBen Chamberlain, James Rowbottom, Maria I. Gorinova, Michael M. Bronstein 等ICML 2021 · 被引用 358 次
- GREAD: Graph Neural Reaction-Diffusion NetworksJeongwhan Choi, Seoyoung Hong, Noseong Park, Sung-Bae ChoICML 2023 · 被引用 60 次
- Conditional Diffusion with Ordinal Regression: Longitudinal Data Generation for Neurodegenerative Disease StudiesHyuna Cho, Ziquan Wei, Seungjoo Lee, Tingting Dan 等ICLR 2025
相关 Paper
- A Stage-Aware Mixture of Experts Framework for Neurodegenerative Disease Progression ModellingTiantian He, Keyue Jiang, An Zhao, Anna Schroder 等AAAI 2026
- Neurodegenerative Brain Network Classification via Adaptive Diffusion with Temporal RegularizationHyuna Cho, Jaeyoon Sim, Guorong Wu, Won Hwa KimICML 2024 · 被引用 7 次
- Reinforcement Learning based Disease Progression Model for Alzheimer's DiseaseKrishnakant V. Saboo, Anirudh Choudhary, Yurui Cao, Gregory A. Worrell 等NeurIPS 2021 · 被引用 19 次
- High-dimensional Mean-Field Games by Particle-based Flow MatchingJiajia Yu, Junghwan Lee, Yao Xie, Xiuyuan ChengICLR 2026 · 被引用 3 次
- A Computational Framework for Solving Wasserstein Lagrangian FlowsKirill Neklyudov, Rob Brekelmans, Alexander Tong, Lazar Atanackovic 等ICML 2024 · 被引用 42 次
