Unscrambling disease progression at scale: fast inference of event permutations with optimal transport
Peter A. Wijeratne, Daniel C. Alexander

TL;DR
This paper introduces a novel optimal transport-based method for fast, scalable inference of disease progression event sequences, enabling detailed modeling of neurodegenerative and age-related conditions with high accuracy and interpretability.
Contribution
It presents a new approach leveraging optimal transport for permutation inference, achieving 1000x faster results and handling more features than existing methods.
Findings
Significantly faster inference than state-of-the-art methods.
Demonstrated robustness to noise in simulated data.
Successfully applied to real-world Alzheimer's and macular degeneration datasets.
Abstract
Disease progression models infer group-level temporal trajectories of change in patients' features as a chronic degenerative condition plays out. They provide unique insight into disease biology and staging systems with individual-level clinical utility. Discrete models consider disease progression as a latent permutation of events, where each event corresponds to a feature becoming measurably abnormal. However, permutation inference using traditional maximum likelihood approaches becomes prohibitive due to combinatoric explosion, severely limiting model dimensionality and utility. Here we leverage ideas from optimal transport to model disease progression as a latent permutation matrix of events belonging to the Birkhoff polytope, facilitating fast inference via optimisation of the variational lower bound. This enables a factor of 1000 times faster inference than the current state of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGenomic variations and chromosomal abnormalities
