MPP-GNN: Subject-Adaptive Community Detection for fMRI-Based Alzheimer's Disease Classification
arXiv:2607.28681
2026
Optimization
1 ideas extracted · analyzed Aug 31, 2026
What the math gives to ML
The paper's transferable contribution is a smoothing-based variational treatment of discrete graph partitioning: instead of committing to hard communities before representation learning, it samples partition-inducing weights from a learnable Gaussian and optimizes partition quality and downstream prediction in a coupled bilevel loop. This provides a generic mechanism for differentiable stochastic structure discovery, applicable beyond fMRI to graph pooling, token grouping, and mixture-of-experts routing. The most promising adaptation is to use the outer validation objective to learn routing or pooling parameters while the inner model trains on the resulting soft assignments, with Gaussian noise preserving gradient flow and exposing uncertainty in the discrete structure.
Ideas from this paper
Unverified
2026
Replace a hard, separately precomputed graph partition or expert assignment with partition-inducing parameters sampled from a learnable Gaussian distribution. Train the neural representation in an inner loop and update the distribution parameters using an outer validation loss, allowing the discovered structure and predictor to co-adapt while retaining gradients through otherwise discrete assignments.
Useful6/10
Difficulty6/10
Novelty5/10