alphaFeedback

WorksMathematics

ELPAC: Endpoint-Anchored Latent Progression with Stage-Varying Multimodal Coordination

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link
View

Abstract

Aging cohorts increasingly combine imaging, plasma, and cognitive measurements, but most subjects provide only a partially observed cross-sectional snapshot, leaving latent stage, progression subtype, and stage-varying multimodal coordination to be inferred jointly. Existing methods estimate the cohort-level aging process, model covariance under observed covariates, or fuse modalities for prediction. However, they rarely target the joint problem of endpoint-anchored staging and progression-resolved residual coordination across modalities, even though subject staging, subtype assignment, and multimodal interplay are mutually dependent. We introduce ELPAC, a Bayesian framework with two interlocking constructions. The first integrates subtype trajectories backward from clinically reliable endpoint groups along biologically structured velocity components encoding modality-specific monotone direction and optional sequential ordering priors. The second factorizes residual multimodal variation around the inferred stage axis into sparse coordination axes whose loadings and activations expose which multimodal patterns are operative in each subtype and when they emerge, with stage-resolved variation supplying the auxiliary structure for conditional identifiability. We use a scalable amortized variational inference scheme that enables joint posterior inference at cohort scale with single-pass deployment on new subjects. On synthetic data and a harmonized ADNI+NACC/SCAN Alzheimer's cohort, ELPAC demonstrates accurate latent-structure recovery, well-calibrated prediction intervals, and biologically interpretable multimodal coordination programs that differ by subtype.

Introduction

Aging-related neurodegeneration is observed indirectly: pathology accumulates for years before symptoms emerge, and two patients indistinguishable on a cognitive test may differ markedly in pathology, structural change, and future risk [1, 2]. For each subject, three latent quantities are of central scientific interest: the progression subtype that best describes them, including preserved aging; their continuous stage along that subtype trajectory; and the stage-specific structure of how measurements across modalities covary during progression. For example, consider two subjects with the same Mini-Mental State Examination (MMSE) score of 26, one 30% along the early-onset AD (EOAD) amyloid+tau trajectory (stage Si≈0.3S_i \approx0.3), the other far along healthy aging (stage Si≈0.9S_i \approx0.9), which is advanced healthy aging rather than advanced disease.

None of these quantities is directly observed. Aging studies now routinely collect brain imaging, plasma assays, and cognitive measurements [3, 4], yet most participants contribute only a single, partially observed cross-sectional snapshot, without repeated measurements or follow-up diagnoses that would reveal where they lie along progression. This creates two coupled inference problems. First, supervision is asymmetric: endpoint groups are well characterized, while early and intermediate subjects, the part of the cohort whose stage and risk are most uncertain, carry the noisiest labels. A model that grows trajectories forward from this uncertain origin therefore rests on the cohort’s weakest signal, whereas one anchored at the endpoints rests on its strongest. Second, dependence is non-stationary: the coupling between measurements changes along progression, so marginal correlations mix subjects from different latent stages and subtypes and can wash out biologically meaningful coordination. The target is therefore not subtype, stage, or covariance separately, but a joint posterior over subtype assignment, continuous stage, and stage-varying multimodal dependence, with uncertainty propagated across all of them.

Prior work has advanced each ingredient of this problem, but mostly in isolation. Disease progression models [5, 6, 7, 8, 9, 10, 11, 12, 13, 14] recover event orderings or subtype-specific mean trajectories, targeting the expected trajectory, not the multivariate dependence around it. Condition-varying covariance and dynamic factor models [15, 16, 17, 18] learn covariance as a function of an observed condition; in our setting that condition is latent. Multimodal biomedical architectures [19, 20, 21, 22, 23] fuse heterogeneous data and absorb missingness, but read it through a predictive lens rather than a progression-resolved one. Identifiable latent variable learning [24, 25, 26, 27, 28, 29] shows that auxiliary structure resolves rotational and permutation ambiguities in factor models, but typically requires the auxiliary variable to be observed, not inferred. None learns the latent disease axis and the dependence around it as mutually identifying objects.

To address the gap, we introduce ELPAC (Endpoint-anchored Latent Progression And Coordination), a Bayesian framework with two interlocking constructions that recover the latent progression and its multimodal coordination from cross-sectional snapshots (Figure 1). We integrate subtype trajectories backward from clinically reliable endpoint groups towards a shared healthy reference along per-modality velocity components that encode monotone progression, modality-specific direction, and optional sequential ordering priors. These biological constraints supply the inductive bias absent from cross-sectional snapshots, while endpoint anchoring calibrates the stage axis from the cohort’s best supervised subjects. Around that axis, residual multimodal variation decomposes into coordination axes, each a sparse coalition of regions and modalities whose covariation strengthens or attenuates with stage; the loadings expose which programs are operative in each subtype, the activations expose when they emerge. The two constructions are fitted jointly: stage-resolved variation supplies the auxiliary structure for the coordination decomposition, and the resolved coordination feeds back through the multivariate likelihood to sharpen the posterior over subtype and stage. We use a scalable amortized variational scheme paired with structured low-rank updates over the global parameters, enabling joint posterior inference at cohort scale with single-pass deployment on new subjects.

Figure 1. ELPAC workflow. Anchor-supervised multimodal cross-sectional data feed two interlocking constructions: backward integration from endpoints toward a shared healthy origin along biologically structured velocity yields subtype mean trajectories and the joint posterior over subtype and stage; residuals around the recovered stage axis factorize into sparse coordination axes whose loadings and activations expose which multimodal programs operate per subtype and when they emerge.

These design choices yield three contributions:

  • We incorporate asymmetric endpoint supervision as an inductive bias for subject-level continuous stage inference, with subtype trajectories anchored at clinically reliable groups and integrated backward through biologically structured velocity components.

  • We establish conditional identifiability of the stage-varying multimodal coordination via the inferred stage axis as auxiliary variation, yielding interpretable sparse coordination axes across and within multimodal measurements.

  • We validate ELPAC on synthetic data and on a harmonized ADNI + NACC/SCAN cohort (N=7,501N = 7{,}501; NACC March 2026 data freeze), demonstrating accurate latent-structure recovery, well-calibrated prediction intervals, and biologically interpretable coordination programs that differ by subtype.

Method

Problem formulation

We observe a cross-sectional cohort D={(Yi,Xi,Yicog)}i=1n\mathcal{D} = \{(Y_i, X_i, Y_i^{\mathrm{cog}})\}_{i=1}^{n}, where Yi∈RRY_i \in\mathbb{R}^{R} is a partially observed multimodal biomarker vector with each coordinate r∈{1,…,R}r \in\{1,\ldots,R\} assigned to a modality m(r)∈Mm(r) \in\mathcal{M}, Xi∈RPX_i \in\mathbb{R}^{P} collects demographic and genetic covariates, and Yicog∈RY_i^{\mathrm{cog}} \in\mathbb{R} is an auxiliary cognitive outcome that may be missing. Each subject carries a latent subtype ci∈{1,…,C}c_i \in\{1, \ldots, C\}, with subtypes defined by clinically distinct endpoint phenotypes, and a latent progression stage Si∈(0,1)S_i \in(0, 1). The cohort comprises three strata: endpoint anchors Ac\mathcal{A}_c with clinically confirmed subtype cc (near s→1s \to1); a healthy reference set H\mathcal{H} near s≈0s \approx0; and a general unsupervised population U\mathcal{U} with unknown (ci,Si)(c_i, S_i). The objects of inference are the subject-level latents (ci,Si)(c_i, S_i), the subtype-specific mean trajectories θc(s)∈RR\theta_c(s) \in\mathbb{R}^R, and the stage-varying within-stage covariance Σc(s)∈RR×R\Sigma_c(s) \in\mathbb{R}^{R \times R}. Boundary supervision from Ac\mathcal{A}_c and H\mathcal{H} grounds the latent stage, and the resulting stage axis serves as the auxiliary variation under which Σc(s)\Sigma_c(s) is identifiable. Table 1 summarizes the notation.

SymbolMeaningSymbolMeaning
cic_i; Si∈(0,1)S_i \in(0, 1)subtype; progression stageCC; RR; m(r)∈Mm(r) \in\mathcal{M}no. subtypes, biomarkers; modality of rr
YiY_i; OiO_ibiomarker vector; observed entriesXiX_i; YicogY_i^{\mathrm{cog}}; χc(s)\chi_c(s)covariates; cognition; its stage trend
Ac\mathcal{A}_c; H\mathcal{H}; U\mathcal{U}anchors; healthy reference; unlabeledsAs_A; sHs_Hanchor; healthy-reference stage location
θc(s)\theta_c(s); Σc(s)\Sigma_c(s)mean trajectory; within-stage covarianceμc\mu_c; Θ0\Theta_0subtype endpoint; shared healthy origin
Θc,j\Theta_{c,j}; Vc,jV_{c,j}; JJshell state; shell velocity; no. shellssgn⁡m\operatorname{sgn}_m; t~c,m\tilde{t}_{c,m}modality direction; modality onset center
δc,r\delta_{c,r}; tc,rt_{c,r}; ωc,r\omega_{c,r}inclusion; onset timing; onset sharpnessFc,rF_{c,r}; BqB_q; QQsigned velocity magnitude; spline basis, size
EiE_i; ziz_i; ηi\eta_iresidual; factor scores; idiosyncratic noiseAcA_c; νc(s)\nu_c(s); DcD_cloadings; activations; noise covariance
KK; ψp\psi_p; PPno. factors; activation B-spline basis, sizeΨ\Psi; qϕ,ψq_{\phi,\psi}global parameters; variational family

Table 1. Notation used in section 2.

Observation model

Let Mir∈{0,1}M_{ir} \in\{0,1\} indicate whether biomarker rr is observed for subject ii, with Oi={r:Mir=1}O_i = \{r : M_{ir} = 1\}, and let Oicog∈{0,1}O_i^{\mathrm{cog}} \in\{0,1\} indicate whether the auxiliary cognitive outcome YicogY_i^{\mathrm{cog}} is observed. The observed biomarker likelihood is

Yi,Oi∣ci,Si∼N(θci,Oi(Si), Σci,Oi(Si)),(1)Y_{i,O_i} \mid c_i,S_i \sim\mathcal{N}\left(\theta_{c_i,O_i}(S_i),\ \Sigma_{c_i,O_i}(S_i)\right), \tag*{(1)}

where θc(s)∈RR\theta_c(s) \in\mathbb{R}^R and Σc(s)∈RR×R\Sigma_c(s) \in\mathbb{R}^{R \times R} denote the subtype-cc mean trajectory and within-stage covariance. The subscript OiO_i selects the observed entries and corresponding submatrix, so unobserved biomarker coordinates are integrated out under the multivariate Gaussian model. When Oicog=1O_i^{\mathrm{cog}}=1, the cognitive outcome enters as

Yicog∣ci,Si,Xi∼N(γ0+γXXi+χci(Si), σcog2),(2)Y_i^{\mathrm{cog}} \mid c_i,S_i,X_i \sim\mathcal{N}\left(\gamma_0+\gamma_X X_i+\chi_{c_i}(S_i),\ \sigma_{\mathrm{cog}}^2\right), \tag*{(2)}

where γ0∼N(0,1)\gamma_0 \sim\mathcal{N}(0,1), γX∼N(0,Ip)\gamma_X \sim\mathcal{N}(0,I_p), log⁡σcog∼N(0,1)\log\sigma_{\mathrm{cog}} \sim\mathcal{N}(0,1), and χc(s)=bI(s)⊤ξc\chi_c(s)=\boldsymbol{b}^{I}(s)^\top\xi_c is a monotone I-spline with non-negative coefficients ξc,j∼Half-Normal⁡(1)\xi_{c,j}\sim\operatorname{Half\text{-}Normal}(1) that encodes the monotone progressionconditioned trend of Yicog⁡Y_i^{\operatorname{cog}}. The corresponding factor is omitted from the joint likelihood when Oicog⁡=0O_i^{\operatorname{cog}}=0.

Construction I: endpoint-anchored progression module

The subtype mean trajectory θc(s)\theta_c(s) is defined as a reverse-time integral on [0,1][0,1] between two latent boundary states. Partition the interval by shells 0=τ0<⋯<τJ=10=\tau_0<\cdots<\tau_J=1 with width Δ=1/J\Delta=1/J, and let θc(s)=I({Θc,j,Vc,j}j=0J;s)\theta_c(s)=\mathcal{I}(\{\boldsymbol{\Theta}_{c,j},V_{c,j}\}_{j=0}^{J};s) denote the cubic Hermite interpolant of shell states Θc,j∈RR\boldsymbol{\Theta}_{c,j}\in\mathbb{R}^{R} and shell-endpoint velocities Vc,j∈RRV_{c,j}\in\mathbb{R}^{R} (explicit form in equation (25)) satisfying

Θc,j−1=Θc,j−ΔVc,j,j=J,J−1,…,1.(3)\boldsymbol{\Theta}_{c,j-1}=\boldsymbol{\Theta}_{c,j}-\Delta V_{c,j},\qquad j=J,J-1,\ldots,1. \tag*{(3)}

This right-endpoint update interprets Vc,jV_{c,j} as the arrival velocity at shell boundary τj\tau_j, yielding a triangular reverse-time construction in which Θc,j\boldsymbol{\Theta}_{c,j} depends on (Θc,J,Vc,j+1:J)(\boldsymbol{\Theta}_{c,J},V_{c,j+1:J}) alone. We assign weakly informative Gaussian hyperpriors to the subtype endpoint μc\mu_c and the shared healthy-reference origin Θ0\boldsymbol{\Theta}_0,

μc∼N(0,τμ2IR),Θc,J∣μc∼N(μc,σT2IR),Θ0∼N(0,τ02IR).(4)\mu_c\sim\mathcal{N}(0,\tau_\mu^2 I_R),\qquad\boldsymbol{\Theta}_{c,J}\mid\mu_c\sim\mathcal{N}(\mu_c,\sigma_T^2 I_R),\qquad\boldsymbol{\Theta}_0\sim\mathcal{N}(0,\tau_0^2 I_R). \tag*{(4)}

The recursion equation (3) fixes Θc,0\boldsymbol{\Theta}_{c,0} deterministically as the integrated origin Θc,0=Θc,J−Δ∑j=1JVc,j\boldsymbol{\Theta}_{c,0}=\boldsymbol{\Theta}_{c,J}-\Delta\sum_{j=1}^{J}V_{c,j}, and we attach a Gaussian coupling potential that draws each subtype’s integrated origin toward the shared healthy-reference origin,

log⁡ψsoft(Θ0,{Θc,J,Vc,1:J}c=1C)=−12σ02∑c=1C∥Θc,0(Ψ)−Θ0∥2+const,(5)\log\psi_{\mathrm{soft}}\left(\boldsymbol{\Theta}_0,\{\boldsymbol{\Theta}_{c,J},V_{c,1:J}\}_{c=1}^{C}\right)=-\frac{1}{2\sigma_0^2}\sum_{c=1}^{C}\left\lVert\boldsymbol{\Theta}_{c,0}(\Psi)-\boldsymbol{\Theta}_0\right\rVert^2+\mathrm{const}, \tag*{(5)}

where σ0\sigma_0 controls the strength of the coupling: all subtypes depart from a common healthy state, while each subtype’s integrated origin may deviate from it. equation (5) is a coupling factor on the joint over (Θ0,{Θc,J,Vc,1:J})(\boldsymbol{\Theta}_0,\{\boldsymbol{\Theta}_{c,J},V_{c,1:J}\}), not a conditional density on the deterministic Θc,0(Ψ)\boldsymbol{\Theta}_{c,0}(\Psi); combined with the Gaussian boundary priors of equation (4) it yields a normalized joint prior since ψsoft≤1\psi_{\mathrm{soft}}\leq1 pointwise. The posteriors of μc\mu_c and Θ0\boldsymbol{\Theta}_0 are informed by the anchor and healthy-reference cohorts Ac\mathcal{A}_c and H\mathcal{H} through the observation likelihood equation (1) evaluated at the boundary stages introduced below. The recursion equation (3) together with equation (5) then determines θc(s)\theta_c(s) from the velocity field Vc,1:JV_{c,1:J}.

The velocity admits a biologically structured decomposition,

Vc,j,r=δc,r⋅σ(τj−tc,rωc,r)⋅Fc,r(τj),Fc,r(τj)=sgn⁡m(r)⋅softplus⁡(∑q=1QBq(τj)βc,r,q),(6)V_{c,j,r}=\delta_{c,r}\cdot\sigma\left(\frac{\tau_j-t_{c,r}}{\omega_{c,r}}\right)\cdot F_{c,r}(\tau_j),\qquad F_{c,r}(\tau_j)=\operatorname{sgn}_{m(r)}\cdot\operatorname{softplus}\left(\sum_{q=1}^{Q}B_q(\tau_j)\beta_{c,r,q}\right), \tag*{(6)}

in which δc,r∈{0,1}\delta_{c,r}\in\{0,1\} encodes biomarker inclusion in subtype cc, (tc,r,ωc,r)(t_{c,r},\omega_{c,r}) govern onset timing and sharpness, {Bq}\{B_q\} is a QQ-dimensional B-spline basis with coefficients {βc,r,q}\{\beta_{c,r,q}\}, and the modality sign sgn⁡m(r)∈{+1,−1}\operatorname{sgn}_{m(r)}\in\{+1,-1\} is a fixed modality-level constant encoding the direction of evolution (e.g., monotone accumulation versus monotone atrophy). The associated priors are

δc,r∼Bern⁡(πc,m(r)),πc,m∼Beta⁡(2,1),tc,r=σ(ηc,r),ηc,r∼N(t~c,m(r),ση2),(7)\delta_{c,r}\sim\operatorname{Bern}(\pi_{c,m(r)}),\qquad\pi_{c,m}\sim\operatorname{Beta}(2,1),\qquad t_{c,r}=\sigma(\eta_{c,r}),\qquad\eta_{c,r}\sim\mathcal{N}(\widetilde{t}_{c,m(r)},\sigma_\eta^2), \tag*{(7)}
t~c,m∼N(0.5,1),ωc,r=eφc,r,φc,r∼N(mω,σφ2),βc,r,q∼N(0,σβ2).(8)\widetilde{t}_{c,m}\sim\mathcal{N}(0.5,1),\qquad\omega_{c,r}=e^{\varphi_{c,r}},\qquad\varphi_{c,r}\sim\mathcal{N}(m_\omega,\sigma_\varphi^2),\qquad\beta_{c,r,q}\sim\mathcal{N}(0,\sigma_\beta^2). \tag*{(8)}

The modality-monotone direction encoded by sgn⁡m(r)\operatorname{sgn}_{m(r)} is an inductive bias common to event-based progression models [5, 6]. Domain knowledge enters through the modality-level onset centers t~c,m\widetilde{t}_{c,m}: when biomarker ordering or late-onset behavior is supported by prior evidence, the diffuse N(0.5,1)\mathcal{N}(0.5,1) on t~c,m\widetilde{t}_{c,m} is replaced by an informative location or ordering prior.

Subtype assignment is modeled as a covariate-modulated categorical, and the subtype-conditional stage as logit-normal. For unsupervised subjects i∈Ui\in\mathcal{U},

ci∣Xi∼Cat⁡(softmax⁡(α+BXi)),logit⁡(Si)∣i∈U,ci=c,Xi∼N(bcTXi,σc2),(9)c_i\mid X_i\sim\operatorname{Cat}(\operatorname{softmax}(\alpha+B X_i)),\qquad\operatorname{logit}(S_i)\mid i\in\mathcal{U},c_i=c,X_i\sim\mathcal{N}(b_c^\mathsf{T}X_i,\sigma_c^2), \tag*{(9)}

with α∼N(0,IC)\alpha\sim\mathcal{N}(0,I_C), B∼N(0,IC×p)B\sim\mathcal{N}(0,I_{C\times p}), bc∼N(0,Ip)b_c\sim\mathcal{N}(0,I_p), and σc∼Half-Cauchy⁡(0,1)\sigma_c\sim\operatorname{Half\text{-}Cauchy}(0,1). The diffuse prior on bcb_c is replaced by an informative location prior on the relevant covariate when subtype-specific covariate effects (e.g., age-of-onset) are supported by external evidence. For anchored subjects i∈Aci\in\mathcal{A}_c, the subtype is fixed at cc and the stage is concentrated near the endpoint,

logit⁡(Si)∣i∈Ac∼N(logit⁡(sA),ϵS2),(10)\operatorname{logit}(S_i)\mid i\in\mathcal{A}_c\sim\mathcal{N}(\operatorname{logit}(s_A),\epsilon_S^2), \tag*{(10)}

and for healthy-reference subjects i∈Hi \in\mathcal{H}, the subtype is unconstrained and the stage is concentrated near the origin,

logit⁡(Si)∣i∈H, ci=c∼N(logit⁡(sH),ϵS2)∀c.(11)\operatorname{logit}(S_i) \mid i \in\mathcal{H},\ c_i=c \sim\mathcal{N}\left(\operatorname{logit}(s_H),\epsilon_S^2\right)\quad\forall c. \tag*{(11)}

Here sA,sH∈(0,1)s_A, s_H \in(0,1) are hyperparameters localizing anchors near the endpoint and healthy subjects near the origin.

Construction II: stage-varying coordination module

With (c,s)(c,s) latent, the iterated law of total covariance separates raw pairwise correlation into a within-stage coordination term and a between-(c,s)(c,s) mean effect,

Cov⁡(Yr,Yr′)=Ec,s[Cov⁡(Yr,Yr′∣c,s)]⏟within-stage coordination+Cov⁡c,s(E[Yr∣c,s],E[Yr′∣c,s])⏟between-(c,s) mean effect.(12)\operatorname{Cov}(Y_r,Y_{r'}) = \underbrace{\mathbb{E}_{c,s}\left[\operatorname{Cov}(Y_r,Y_{r'}\mid c,s)\right]}_{\text{within-stage coordination}} + \underbrace{\operatorname{Cov}_{c,s}\left(\mathbb{E}[Y_r\mid c,s],\mathbb{E}[Y_{r'}\mid c,s]\right)}_{\text{between-}(c,s)\text{ mean effect}}. \tag*{(12)}

The second term is captured by the mean trajectory θc(s)\theta_c(s) of Construction I. We model the first by endowing the residual Ei≡Yi−θci(Si)E_i \equiv Y_i-\theta_{c_i}(S_i) with a stage-varying latent factor representation,

Ei=Acidiag⁡(νci(Si))1/2zi+ηi,zi∼N(0,IK),ηi∼N(0,Dci),(13)E_i=A_{c_i}\operatorname{diag}\left(\nu_{c_i}(S_i)\right)^{1/2}z_i+\eta_i,\qquad z_i\sim\mathcal{N}(0,I_K),\qquad\eta_i\sim\mathcal{N}(0,D_{c_i}), \tag*{(13)}

where zi∈RKz_i\in\mathbb{R}^K are latent factor scores and ηi\eta_i is idiosyncratic noise. Each column Ac,⋅,kA_{c,\cdot,k} defines a coordination axis, encoding which biomarkers and modalities co-vary, and the activation νc,k(s)\nu_{c,k}(s) governs when along progression that axis strengthens or vanishes; a column may concentrate within a single modality or span multiple modalities, capturing within-modality and across-modality coordination respectively. The induced within-stage covariance has the rank-KK-plus-diagonal form

Σc(s)=Acdiag⁡(νc(s))AcT+Dc.(14)\Sigma_c(s)=A_c\operatorname{diag}(\nu_c(s))A_c^{\mathsf{T}}+D_c. \tag*{(14)}

The loadings matrix Ac∈RR×KA_c\in\mathbb{R}^{R\times K} is constrained lower triangular with positive diagonal, fixing the rotational ambiguity inherent to factor models [27, 30]. A multiplicative-gamma cascade [28, 29] adaptively controls the effective number of factors: κc,1∼Gamma⁡(2,1)\kappa_{c,1}\sim\operatorname{Gamma}(2,1), κc,h≥2∼Gamma⁡(a2,1)\kappa_{c,h\geq2}\sim\operatorname{Gamma}(a_2,1) with a2>1a_2>1, Λc,k=∏h≤kκc,h\Lambda_{c,k}=\prod_{h\leq k}\kappa_{c,h}, and, conditional on Λc,k\Lambda_{c,k}, Ac,r,k∼N(0,Λc,k−1)A_{c,r,k}\sim\mathcal{N}(0,\Lambda_{c,k}^{-1}) for r>kr>k, Ac,k,k∼Half-Normal⁡(Λc,k−1/2)A_{c,k,k}\sim\operatorname{Half\text{-}Normal}(\Lambda_{c,k}^{-1/2}). Since E[Λc,k]\mathbb{E}[\Lambda_{c,k}] grows with kk, later columns are increasingly shrunk toward zero. The activation νc,k(s)=exp⁡(∑pwc,k,pψp(s))\nu_{c,k}(s)=\exp\left(\sum_p w_{c,k,p}\psi_p(s)\right) is expanded on a PP-dimensional B-spline basis {ψp}\{\psi_p\}. A constant shift in log⁡νc,k\log\nu_{c,k} may be absorbed into Ac,⋅,kA_{c,\cdot,k}, so we resolve the resulting scale ambiguity by supporting wc,kw_{c,k} on the centered subspace P0={w∈RP:1Tw=0}\mathcal{P}_0=\{w\in\mathbb{R}^P:1^{\mathsf{T}}w=0\}, via the projection Π0=IP−1P11T\Pi_0=I_P-\frac{1}{P}11^{\mathsf{T}}, with the singular Gaussian prior

wc,k∼N0(0,τk2Π0(KB+ϵBIP)−1Π0),τk∼Half-Normal⁡(στ),(15)w_{c,k}\sim\mathcal{N}_0\left(0,\tau_k^2\Pi_0(K_B+\epsilon_B I_P)^{-1}\Pi_0\right),\qquad\tau_k\sim\operatorname{Half\text{-}Normal}(\sigma_\tau), \tag*{(15)}

where KBK_B denotes the second-difference smoothness penalty matrix, so coordination strengthens or fades gradually along progression rather than jumping between adjacent stages, and ϵB\epsilon_B is a small ridge; τk\tau_k scales how strongly factor kk's activation varies with stage. The prior covariance has rank P−1P-1 and is supported on P0\mathcal{P}_0, so the centering identity 1Twc,k=01^{\mathsf{T}}w_{c,k}=0 holds almost surely. DcD_c is diagonal, so all within-stage cross-biomarker dependencies pass through the coordination axes; the idiosyncratic noise variances follow a log-Gaussian prior, log⁡dc,r∼N(mD,σD2)\log d_{c,r}\sim\mathcal{N}(m_D,\sigma_D^2), with Dc=diag⁡(dc,r+dmin⁡)D_c=\operatorname{diag}(d_{c,r}+d_{\min}) and a small positive floor dmin⁡d_{\min} that keeps every noise variance bounded away from zero. Downstream summaries, including stage-dependent pairwise correlations ρc(r,r′;s)\rho_c(r,r';s) and Fisher modality informativeness Wc,mFI(s)W_{c,m}^{\mathrm{FI}}(s), are deterministic functionals of (Ac,νc(s),Dc)(A_c,\nu_c(s),D_c).

Conditional identifiability

The latent stage recovered through Construction I supplies the auxiliary variation under which the Construction II decomposition (Ac,νc(⋅),Dc)(A_c,\nu_c(\cdot),D_c) is identifiable, and the resolved Σc(s)\Sigma_c(s) feeds back through the likelihood equation (1) to sharpen the (ci,Si)(c_i,S_i) posterior; the two blocks are fitted jointly.

Theorem 1 (Conditional identifiability of the dynamic factor block). Fix a subtype and suppress its index. Within the structural model of equations (14) and (15) A∈RK×KA\in\mathbb{R}^{K\times K} lower triangular with positive diagonal; activation spline coefficients wkw_k satisfying 1Twk=01^{\mathsf{T}}w_k=0; DD diagonal with strictly positive entries; data dimension R≥2K+1R\geq2K+1; activations νk(⋅)\nu_k(\cdot) non-constant; plus the generic

regularity conditions of section C.2), suppose the within-stage covariance is identified at two stages s1≠s2s_1 \ne s_2 whose activation ratios are pairwise distinct,

νj(s2)νj(s1)≠νk(s2)νk(s1)for all j≠k.(16)\frac{\nu_j(s_2)}{\nu_j(s_1)} \ne\frac{\nu_k(s_2)}{\nu_k(s_1)} \qquad\text{for all } j \ne k. \tag*{(16)}

Then the loadings A\mathbf{A}, the activation function ν(⋅)\nu(\cdot), and the idiosyncratic noise D\mathbf{D} are uniquely determined.

Proof sketch. (i) At each fixed ss, the Anderson–Rubin row-deletion condition with lower-triangular A\mathbf{A} and R≥2K+1R \ge2K+1 identifies D\mathbf{D} and Adiag⁡(ν(s))AT\mathbf{A}\operatorname{diag}(\nu(s))\mathbf{A}^{\mathsf{T}} [27, 30]. (ii) Setting Π∙:=Σ(s∙)−D\mathbf{\Pi}_{\bullet}:=\mathbf{\Sigma}(s_{\bullet})-\mathbf{D}, the generalized eigenproblem Π2v=λΠ1v\mathbf{\Pi}_2v=\lambda\mathbf{\Pi}_1v has eigenvalues νk(s2)/νk(s1)\nu_k(s_2)/\nu_k(s_1), distinct by equation (16); primal columns recover as a~k=Π1vk/∥Π1vk∥2\widetilde{\mathbf{a}}_k=\mathbf{\Pi}_1v_k/\lVert\mathbf{\Pi}_1v_k\rVert_2, and the lower-triangular positive-diagonal normalization pins scale and sign. (iii) The centering identity 1Twk=0\mathbf{1}^{\mathsf{T}}\mathbf{w}_k=0 (with partition-of-unity {ψp}\{\psi_p\}) pins ν(s1),ν(s2)\nu(s_1),\nu(s_2) pointwise. (iv) Spline-design coverage extends ν(⋅)\nu(\cdot) to all of [0,1][0,1]; boundary anchoring equations (10) and (11) together with the trajectory-feature regularity rule out non-identity boundary-fixing warps. Full proof, warp invariance, and full-model identification in section C.

Inference

Let Ψ\mathbf{\Psi} denote the global parameters of equations (1) to (11) and Z={(ci,Si)}i=1n\mathcal{Z}=\{(c_i,S_i)\}_{i=1}^{n} the subject-level latents. We approximate p(Ψ,Z∣D)p(\mathbf{\Psi},\mathcal{Z}\mid\mathcal{D}) by a structured variational family that pairs a low-rank multivariate Gaussian on Ψ\mathbf{\Psi} with CC subtype-conditional Gaussians on logit⁡(Si)\operatorname{logit}(S_i) per subject,

qϕ,ψ(Ψ,{Si(c)})=N(Ψ;μϕ,WϕWϕT+diag⁡(dϕ2))∏i=1n∏c=1CN(logit⁡(Si(c));μψ(c)(Yi,oi,Xi),τψ(c)(Yi,oi,Xi)2).(17)q_{\phi,\psi}\left(\mathbf{\Psi},\{S_i^{(c)}\}\right) = \mathcal{N}\left(\mathbf{\Psi};\boldsymbol{\mu}_{\phi},\mathbf{W}_{\phi}\mathbf{W}_{\phi}^{\mathsf{T}}+\operatorname{diag}(\mathbf{d}_{\phi}^{2})\right) \prod_{i=1}^{n}\prod_{c=1}^{C} \mathcal{N}\left(\operatorname{logit}(S_i^{(c)});\boldsymbol{\mu}_{\psi}^{(c)}(\mathbf{Y}_i,\mathbf{o}_i,\mathbf{X}_i),\boldsymbol{\tau}_{\psi}^{(c)}(\mathbf{Y}_i,\mathbf{o}_i,\mathbf{X}_i)^2\right). \tag*{(17)}

where Wϕ∈R∣Ψ∣×rg\mathbf{W}_{\phi}\in\mathbb{R}^{|\Psi|\times r_g} is the low-rank factor of the global Gaussian (rank rgr_g), and (μψ(c),τψ(c))(\boldsymbol{\mu}_{\psi}^{(c)},\boldsymbol{\tau}_{\psi}^{(c)}) are produced by an amortized recognition network with weights ψ\psi shared across subjects [31, 32]. Marginalizing cic_i exactly inside the evidence lower bound gives the collapsed bound

L(ϕ,ψ)=∑i=1nEqϕ,ψ[log⁡∑c=1Cp(c∣Xi,Ψ)ℓi(c)(Ψ,Si(c))]−KL⁡(qϕglob(Ψ)∥p(Ψ))−∑i,cEqϕglob[KL⁡(qψ(Si(c)∣Yi,Xi)∥p(Si∣ci=c,Xi,Ψ))].(18)\mathcal{L}(\phi,\psi) = \sum_{i=1}^{n}\mathbb{E}_{q_{\phi,\psi}}\left[ \log\sum_{c=1}^{C}p(c\mid\mathbf{X}_i,\mathbf{\Psi})\ell_i^{(c)}(\mathbf{\Psi},S_i^{(c)}) \right] -\operatorname{KL}\left(q_{\phi}^{\mathrm{glob}}(\mathbf{\Psi})\mathbin{\|}p(\mathbf{\Psi})\right) -\sum_{i,c}\mathbb{E}_{q_{\phi}^{\mathrm{glob}}}\left[ \operatorname{KL}\left(q_{\psi}(S_i^{(c)}\mid\mathbf{Y}_i,\mathbf{X}_i)\mathbin{\|}p(S_i\mid c_i=c,\mathbf{X}_i,\mathbf{\Psi})\right) \right]. \tag*{(18)}

with per-candidate-subtype data factor ℓi(c)=p(Yi,oi∣c,Si(c),Ψ)p(Yicog∣c,Si(c),Xi,Ψ)oicog\ell_i^{(c)}=p(\mathbf{Y}_i,\mathbf{o}_i\mid c,S_i^{(c)},\mathbf{\Psi})p(\mathbf{Y}_i^{\mathrm{cog}}\mid c,S_i^{(c)},\mathbf{X}_i,\mathbf{\Psi})^{\mathbf{o}_i^{\mathrm{cog}}}. The expectations in equation (18) are estimated by single-sample Monte Carlo with reparameterized noise,

Ψ=μϕ+Wϕϵ(W)+dϕ⊙ϵ(d),logit⁡(Si(c))=μψ(c)+τψ(c)ϵi(c).(19)\mathbf{\Psi}=\boldsymbol{\mu}_{\phi}+\mathbf{W}_{\phi}\boldsymbol{\epsilon}^{(W)}+\mathbf{d}_{\phi}\odot\boldsymbol{\epsilon}^{(d)}, \qquad \operatorname{logit}(S_i^{(c)})=\boldsymbol{\mu}_{\psi}^{(c)}+\boldsymbol{\tau}_{\psi}^{(c)}\epsilon_i^{(c)}. \tag*{(19)}

with ϵ(W)∼N(0,Irg)\boldsymbol{\epsilon}^{(W)}\sim\mathcal{N}(\mathbf{0},\mathbf{I}_{r_g}), ϵ(d)∼N(0,I∣Ψ∣)\boldsymbol{\epsilon}^{(d)}\sim\mathcal{N}(\mathbf{0},\mathbf{I}_{|\Psi|}), and ϵi(c)∼N(0,1)\epsilon_i^{(c)}\sim\mathcal{N}(0,1), and (ϕ,ψ)(\phi,\psi) are optimized with Adam [33]. Each ℓi(c)\ell_i^{(c)} is evaluated under the rank-KK-plus-diagonal covariance Σc,oi(Si(c))\mathbf{\Sigma}_{c,\mathbf{o}_i}(S_i^{(c)}) via the Sylvester–Woodbury identity [34] at cost O(RK2+K3)O(RK^2+K^3). Algorithm 1 provides the pseudocode.

The subtype posterior is

p^(ci=c∣Yi,Xi,D)=Eqϕglob(Ψ)[p(c∣Xi,Ψ)∫01p(s∣c,Xi,Ψ)ℓi(c)(Ψ,s) ds∑c′p(c′∣Xi,Ψ)∫01p(s∣c′,Xi,Ψ)ℓi(c′)(Ψ,s) ds],(20)\widehat{p}(c_i=c\mid\mathbf{Y}_i,\mathbf{X}_i,\mathcal{D}) = \mathbb{E}_{q_{\phi}^{\mathrm{glob}}(\mathbf{\Psi})} \left[ \frac{ p(c\mid\mathbf{X}_i,\mathbf{\Psi}) \int_0^1p(s\mid c,\mathbf{X}_i,\mathbf{\Psi})\ell_i^{(c)}(\mathbf{\Psi},s)\,ds }{ \sum_{c'}p(c'\mid\mathbf{X}_i,\mathbf{\Psi}) \int_0^1p(s\mid c',\mathbf{X}_i,\mathbf{\Psi})\ell_i^{(c')}(\mathbf{\Psi},s)\,ds } \right], \tag*{(20)}

and the subtype-conditional stage posterior is p^(Si∣ci=c,Yi,Xi,D)=qψ(Si(c)∣Yi,Xi)\widehat{p}(S_i\mid c_i=c,\mathbf{Y}_i,\mathbf{X}_i,\mathcal{D})=q_{\psi}(S_i^{(c)}\mid\mathbf{Y}_i,\mathbf{X}_i). Marginalizing the subtype yields a CC-component Gaussian mixture on logit⁡(Si)\operatorname{logit}(S_i),

p^(Si∣Yi,Xi,D)=∑c=1Cp^(ci=c∣Yi,Xi,D)qψ(Si(c)∣Yi,Xi).(21)\widehat{p}(S_i\mid\mathbf{Y}_i,\mathbf{X}_i,\mathcal{D}) = \sum_{c=1}^{C}\widehat{p}(c_i=c\mid\mathbf{Y}_i,\mathbf{X}_i,\mathcal{D})q_{\psi}(S_i^{(c)}\mid\mathbf{Y}_i,\mathbf{X}_i). \tag*{(21)}

Posterior expectations and credible intervals are obtained from equations (20) and (21) by Monte Carlo over Ψ∼qϕglob\mathbf{\Psi}\sim q_{\phi}^{\mathrm{glob}}, with the inner stage integral of ℓi(c)\ell_i^{(c)} against the stage prior p(s∣c,Xi,Ψ)p(s\mid c,\mathbf{X}_i,\mathbf{\Psi}) computed by quadrature on a logit-stage grid. For a held-out subject the encoder is evaluated in a single forward pass.

Experiments

We evaluate ELPAC along two axes that test the two constructions of section 2. Synthetic experiments1 measure recoverability of the anchored stage and the stage-varying factor decomposition against ground truth. The harmonized ADNI+NACC/SCAN evaluation measures held-out generative fit, subtype and stage recovery, predictive-interval (PI) coverage of biomarker observations, and the biological structure of the recovered coordination programs in a regime where most subjects are partially observed and unlabeled. We compare ELPAC against representative baselines per relevant family: SuStaIn [6] and DEBM [7] represent subtype-and-stage and event-based progression models, Static-FA [27] separates factor analysis from downstream subtype or stage prediction, MoPoE-VAE [22] and HEALNet [23] represent multimodal neural fusion, while XGBoost [35] and label propagation [36] directly use the available endpoint labels and serve as supervised reference.

Metrics. We report held-out NLL/cell for generative fit; reconstruction RMSE and masked NLL (one modality held out) for imputation; BAcc and Macro-F1 for subtype recovery; Spearman ρ\rho of recovered stage against ground-truth latent (synthetic) or MMSE (real); AUC against case–control labels for diagnostic discrimination; ∣Cog r∣\lvert\mathrm{Cog}\ r\rvert for cognition alignment; and PI coverage at the 90% nominal level for calibration. Metrics scale by 100; best bolded, second underlined.

Synthetic cohorts: joint latent-structure recovery and construction ablation

Setup. We generate synthetic data from the model in section 2 using C=3C=3 subtypes, K=3K=3 latent coordination factors, J=8J=8 trajectory shells, and R=20R=20 biomarkers split across four modalities. Each replicate has 70% endpoint anchors per subtype, 10% healthy-reference controls, and 60% unlabeled subjects. Observation masks are drawn independently per modality to match the sparse multimodal observation pattern in the real cohort. For each replicate, endpoint anchors are sampled with logit⁡(Si)∼N(logit⁡(sA),ϵS2)\operatorname{logit}(S_i)\sim\mathcal{N}(\operatorname{logit}(s_A),\epsilon_S^2) for each subtype, healthy-reference controls with logit⁡(Si)∼N(logit⁡(sH),ϵS2)\operatorname{logit}(S_i)\sim\mathcal{N}(\operatorname{logit}(s_H),\epsilon_S^2), and the remaining unlabeled subjects with (ci,Si)(c_i,S_i) drawn from equation (9). We generate 100 independent replicates at N=1,000N=1{,}000, 2,0002{,}000, and 5,0005{,}000 subjects, partition each into a stratified 80/20 train–test split, and evaluate predictive performance on held-out test subjects.

Latent-structure recovery. ELPAC jointly recovers subtype assignment, latent stage, mean trajectories, and stage-varying coordination, leading on every metric tied to the latent stage axis (Table 2).

Figure 2 provides a closer look: the subtype posterior cleanly separates the unlabeled population, the recovered mean trajectories and onset locations are close to the truth, and the stage-varying cross-modal correlations track the truth pattern across stages.

Figure 2. Synthetic latent recovery: the inferred posterior recovers subtype assignment, latent structures, and stage-varying cross-modal correlations. (a) Subtype confusion matrix. (b) Latent-recovery metrics over 100 replicates. (c) Representative cross-modal correlations.

Ablation and sensitivity. We evaluate the roles of endpoint anchoring and stage-varying coordination (Table 3). Removing endpoint anchors damages subtype recovery (BAcc −46.5-46.5 pp), cognition alignment (−21.8-21.8 pp), and held-out likelihood (+2.8+2.8 nats), while leaving stage Spearman ρ\rho within 4 pp of the full model: boundary supervision carries the subtype signal and orients the latent stage axis. Replacing the factor covariance by a diagonal covariance damages held-out likelihood (+4.7+4.7 nats), masked reconstruction (+0.38+0.38 nats), and subtype recovery (BAcc −26.7-26.7 pp): residual covariance carries both density-modeling and subtype-discriminative information. The full model also leads stage-binned posterior predictive correlation (PPC) over the static-factor variant, evidence that the stage-varying activations carry information beyond a single stationary covariance. Sensitivity analyses in section D.6 show the robustness across the factor-module hyperparameters and sample-sizes. Sweeping each of the hyperparameters one at a time leaves held-out NLL within the ±1.96\pm1.96 SE band (Figure 6, 50 paired cohorts/cell); scaling NN from 1,000 to 5,000 leaves all four recovery metrics within replicate-cohort SE of the N=1,000N=1,000 values in Table 2 (Figure 7).

MethodNLL/cell ↓\downarrowBAcc ↑\uparrowMacro-F1 ↑\uparrowStage-score ρ↑\rho\uparrowAUC{1,2}/3↑_{\{1,2\}/3} \uparrowMasked NLL ↓\downarrow∣\lvertCog r∣↑\rvert\uparrow
SuStaIn–44.0±0.844.0\pm0.843.3±0.843.3\pm0.845.4±0.645.4\pm0.654.9±1.354.9\pm1.3–47.7±0.647.7\pm0.6
DEBM–––38.4±0.838.4\pm0.871.5±0.671.5\pm0.6–13.4±0.613.4\pm0.6
Static-FA–60.4±0.860.4\pm0.859.2±0.959.2\pm0.927.5±1.227.5\pm1.252.1±1.252.1\pm1.2–42.1±1.342.1\pm1.3
MoPoE-VAE1.47±0.011.47\pm0.0147.8±0.847.8\pm0.843.8±0.943.8\pm0.939.7±0.939.7\pm0.938.1±0.738.1\pm0.71.46±0.011.46\pm0.0138.5±0.938.5\pm0.9
XGBoost–87.5±0.587.5\pm0.586.4±0.586.4\pm0.595.6±0.095.6\pm0.075.9±2.375.9\pm2.3–68.2±0.868.2\pm0.8
Label-prop–87.6±0.587.6\pm0.586.7±0.586.7\pm0.543.9±0.743.9\pm0.777.3±0.377.3\pm0.3–42.3±0.942.3\pm0.9
HEALNet–89.8±0.589.8\pm0.589.9±0.589.9\pm0.564.9±0.564.9\pm0.548.1±0.648.1\pm0.6–87.8±0.387.8\pm0.3
ELPAC (ours)1.07±0.001.07\pm0.0095.4±0.295.4\pm0.296.0±0.196.0\pm0.196.2±0.096.2\pm0.081.0±2.381.0\pm2.30.91±0.000.91\pm0.0097.9±0.197.9\pm0.1

Table 2. Synthetic benchmark: ELPAC recovers subtype, stage, diagnostic, and cognition on synthetic cohorts. N=1,000N=1{,}000 over 100 replicate cohorts.

ModelHeld-out NLL ↓\downarrowBAcc ↑\uparrowStage-score ρ↑\rho\uparrowMasked NLL ↓\downarrowStage-binned PPC ↑\uparrow∣Cog r∣↑\lvert\mathrm{Cog}\ r\rvert\uparrow
ELPAC, no-anchor22.07±0.0522.07\pm0.0548.9±0.648.9\pm0.692.4±0.192.4\pm0.11.109±0.0031.109\pm0.00381.4±0.581.4\pm0.576.1±1.176.1\pm1.1
Diagonal covariance23.97±0.0523.97\pm0.0568.7±0.568.7\pm0.595.7±0.095.7\pm0.01.289±0.0021.289\pm0.002–96.1±0.196.1\pm0.1
Static-factor covariance19.38±0.0519.38\pm0.0595.5±0.2\mathbf{95.5\pm0.2}97.4±0.0\mathbf{97.4\pm0.0}0.912±0.0020.912\pm0.00278.7±0.578.7\pm0.598.7±0.1\mathbf{98.7\pm0.1}
ELPAC (full)19.27±0.05\mathbf{19.27\pm0.05}95.4±0.295.4\pm0.296.2±0.096.2\pm0.00.910±0.002\mathbf{0.910\pm0.002}82.8±0.4\mathbf{82.8\pm0.4}97.9±0.197.9\pm0.1

Table 3. Synthetic ablation: both constructions are necessary, removing either degrades a different recovery axis. N=1,000N=1,000 over 100 replicate cohorts.

Six one-at-a-time hyperparameter sweeps showing held-out log-likelihood per subject

Figure 6. ELPAC is robust to factor-module hyperparameters. Held-out log-likelihood per subject across one-at-a-time sweeps of the six hyperparameters around the canonical configuration, with bands at ±1.96\pm1.96 SE over 50 paired replicate cohorts per cell.

Figure 7. Latent-structure recovery is stable across N∈{1,000,2,000,5,000}N \in\{1{,}000, 2{,}000, 5{,}000\}. Sample-size sweep: held-out log-likelihood, reconstruction RMSE, BAcc, and stage Spearman ρ\rho, with bands at ±1.96\pm1.96 SE over 100 paired replicate cohorts per cell.

Harmonized AD cohort: stage-resolved coordination and clinical alignment

Cohort and protocol. We evaluate ELPAC on a harmonized cross-sectional Alzheimer’s disease (AD) cohort of N=7,501N=7,501 subjects pooled from ADNI [37] and NACC [38] with SCAN-standardized imaging [39] (NACC March 2026 data freeze). Subjects are retained whenever any of the four modalities (amyloid PET, tau PET, structural MRI, plasma biomarkers) is observed, with the per-modality availability ranging from 13.3% to 73.0%. The cohort comprises 641 endpoint anchors, 219 healthy-reference startpoints, and 6,641 unlabeled subjects. The endpoint anchors split into early-onset AD (EOAD, n=68n=68), late-onset AD (LOAD, n=377n=377), and healthy aging (HA, n=196n=196). Details of dataset characteristics are summarized in Table 9. Performance is evaluated over 20 random 80/20 train–test splits, each stratified by anchor stratum (per-subtype anchors, healthy reference, unlabeled).

Generative fit, subtype and stage recovery, and calibrated prediction intervals. ELPAC leads generative fit, reconstruction, stage correlation with MMSE, and Macro-F1 in Table 4, validating the subtype and stage-axis recovery. HEALNet, paired with a supervised classification head trained on the endpoint anchors, leads diagnostic AUCs by ≤2.3\le2.3 pp over ELPAC; ELPAC additionally returns a coherent posterior over subtype, stage, and trajectories, with per-subtype, per-modality PI coverage tracking the 90% and 95% nominal targets (Figure 3, column 5).

Figure 3. Recovered subtype trajectories θc(s)\theta_c(s) and held-out predictive-interval (PI) coverage of biomarker observations. ROIs map to Desikan–Killiany (DK) atlas.

Ablation. The AD ablation reproduces the synthetic per-axis attribution at smaller deltas (Table 5). Endpoint anchoring lifts subtype recovery (BAcc +4.3+4.3 pp) and both diagnostic AUCs (+1.7+1.7 and +1.9+1.9 pp). The diagonal-covariance variant widens the held-out and masked NLL gaps by +1.8+1.8 nats each relative to the full model, and the static-factor variant drops BAcc by −9.8-9.8 pp (58.7 vs. 68.5 full), supporting stage-varying activations as the source of subtype-discriminative residual structure. The full model leads held-out NLL, subtype recovery, both diagnostic AUCs, and masked reconstruction.

ModelHeld-out NLL ↓BAcc ↑AUC AD/(CN+MCI) ↑AUC AD/MCI ↑Masked NLL ↓∣Cog⁡ r∣|\operatorname{Cog}\ r| ↑
ELPAC, no-anchor11.19±0.0364.2±1.584.7±0.377.0±0.67.38±0.0559.2±0.5
Diagonal covariance12.83±0.0566.5±1.584.9±0.376.3±0.58.98±0.0457.0±0.5
Static-factor covariance11.85±0.0458.7±1.684.0±0.374.0±0.67.25±0.0550.2±0.6
ELPAC (full)11.01±0.0368.5±1.486.4±0.278.9±0.57.22±0.0559.0±0.5

Table 5. AD cohort ablation: both constructions contribute distinct improvements. Mean ± SE across 20 held-out splits.

Recovered subtype trajectories and multimodal coordination programs. The mean biomarker trajectories track subtype-specific dominant pathologies (Figure 3): amyloid and tau in EOAD, amyloid in LOAD with structural change following and modest tau elevation, and a structural-only signal in HA that remains below the pathology threshold on amyloid and tau. The coordination programs differ qualitatively across subtypes (Figure 4). EOAD’s leading axes are cross-modal A/T/N coalitions, including one axis that ties medial-temporal tau to lateral-temporal atrophy. LOAD’s leading axis is amyloid-dominant within-modality, with cross-modal A/N and T/N structure on later axes. HA’s leading axes are atrophy-dominant within-modality. The stage-varying variance share confirms the EOAD concurrent-multimodal versus LOAD sequential-amyloid-then-tau pattern (Figure 11).

Figure 4. Coordination factors decompose pathology into subtype-specific within- and across-modality coalitions. DK maps of ∣Ac∣\lvert A_c\rvert ordered by decreasing posterior loading magnitude.

Figure 11. Subtype-specific coordination structures emerge: EOAD is concurrent multimodal whereas LOAD is sequential amyloid-then-tau. Top: stage-varying variance share Φc,k(sc)\Phi_{c,k}(s_c) for the three leading factors, with peak markers and ±1.96\pm1.96 SE bands. Bottom: modality decomposition of loading energy (sum = 1 per bar). HA omitted; see text.

Robustness to anchor corruption. Across the four targeted corruptions, ELPAC retains stage ordering and subtype separation: we corrupted anchors—subtype mislabeling, the true stage redrawn at random, an inverted group-mean direction, and a localized non-monotone bump—and refit at each level; the mislabeling arms are mirrored on the real cohort (section D.7). Anchor mislabeling degrades subtype and stage recovery smoothly as the labels get noisier (at 20% uniform mislabeling, held-out synthetic subtype accuracy and stage ρ\rho fall by 3.4 and 5.7 pp and real-cohort BAcc by 7.0 pp); the stage redraw affects staging while leaving subtype recovery unchanged; and the two mean-shape perturbations have the smallest stage-ordering effects. On the real cohort, held-out likelihood stays well inside the 0.84-nat full-vs-static-factor margin of Table 5.

Cross-cohort robustness and longitudinal consistency. Leave-one-cohort-out folds preserve the stage axis and subtype mapping (section E.1), indicating cross-cohort generalization. On subjects with longitudinal follow-up visits, ELPAC’s cross-sectional stage estimates advance on average with subsequent visits, and the same model attains the highest cognition recovery and three-year MCI-to-

AD conversion AUC among the baselines (section E.2). These support the anchored stage axis as a transferable severity coordinate.

Discussion

ELPAC resolves two coupled problems in latent-progression modeling: locating each subject on a disease axis whose endpoints are reliably labeled but whose origin is not, and capturing how multimodal biomarker coalitions reorganize along that axis. Endpoint anchoring inverts the supervision direction for the first; the stage-varying factor decomposition handles the second, with the inferred stage axis supplying the auxiliary variation that conditionally identifies its loadings and activations.

Limitations. The stage axis is pseudo-temporal, recovered from cross-sectional snapshots, so the coordination factors describe co-variation along it rather than mechanism. The dependency layer in equation (13) models second-order multimodal coordination; higher-order joint dependencies are a future extension via copula or normalizing-flow residuals. Theorem 1 identifies the dynamic factor block under the conditions of section C.2; the full-model proposition (section C.4) further invokes a Gaussian mixing-family hypothesis, with broader mixing families a separate theoretical direction. The amortized variational scheme produces cohort-scale joint inference and single-pass test-time deployment at the per-evaluation cost stated in § 2.6; richer guide families (e.g., normalizing-flow posteriors) remain an inference-side extension.

Acknowledgments and Disclosure of Funding

Funding. This work was partially funded by awards R01AG081413, R01EB034720, and R01AG068191 from the NIH. The content is solely the responsibility of the authors and does not necessarily represent the official views of the NIH.

Competing interests. The authors declare no competing interests.

Data. Data collection and sharing for the Alzheimer’s Disease Neuroimaging Initiative (ADNI) is funded by the National Institute on Aging (National Institutes of Health Grant U19 AG024904). The grantee organization is the Northern California Institute for Research and Education. In the past, ADNI has also received funding from the National Institute of Biomedical Imaging and Bioengineering, the Canadian Institutes of Health Research, and private sector contributions through the Foundation for the National Institutes of Health (FNIH) including generous contributions from the following: AbbVie, Alzheimer’s Association; Alzheimer’s Drug Discovery Foundation; Araclon Biotech; BioClinica, Inc.; Biogen; Bristol-Myers Squibb Company; CereSpir, Inc.; Cogstate; Eisai Inc.; Elan Pharmaceuticals, Inc.; Eli Lilly and Company; EuroImmun; F. Hoffmann-La Roche Ltd and its affiliated company Genentech, Inc.; Fujirebio; GE Healthcare; IXICO Ltd.; Janssen Alzheimer Immunotherapy Research & Development, LLC.; Johnson & Johnson Pharmaceutical Research &Development LLC.; Lumosity; Lundbeck; Merck & Co., Inc.; Meso Scale Diagnostics, LLC.; NeuroRx Research; Neurotrack Technologies; Novartis Pharmaceuticals Corporation; Pfizer Inc.; Piramal Imaging; Servier; Takeda Pharmaceutical Company; and Transition Therapeutics.

The NACC database is funded by NIA/NIH Grant U24 AG072122. NACC data are contributed by the NIA-funded ADRCs: P30 AG062429 (PI James Brewer, MD, PhD), P30 AG066468 (PI Oscar Lopez, MD), P30 AG062421 (PI Teresa Gomez-Isla, MD), P30 AG066509 (PI Thomas Grabowski, MD), P30 AG066514 (PI Mary Sano, PhD), P30 AG066530 (PI Helena Chui, MD, Arthur Toga, PhD), P30 AG066507 (PI Marilyn Albert, PhD), P30 AG066444 (PI David Holtzman, MD), P30 AG066518 (PIs Lisa Silbert, MD, Kevin Duff, PhD), P30 AG066512 (PI Thomas Wisniewski, MD), P30 AG066462 (PI Scott Small, MD), P30 AG072979 (PI David Wolk, MD), P30 AG072972 (PIs Charles DeCarli, MD, Rachel Whitmer, PhD), P30 AG072976 (PI Andrew Saykin, PsyD), P30 AG072975 (PI Julie Schneider, MD, MS), P30 AG072978 (PI Ann McKee, MD), P30 AG072977 (PI Robert Vassar, PhD), P30 AG066519 (PI Joshua Grill, PhD), P30 AG062677 (PIs Brad Boeve, MD, Ronald Petersen, MD, PhD), P30 AG079280 (PI Jessica Langbaum, PhD), P30 AG062422 (PI Gil Rabinovici, MD), P30 AG066511 (PI Allan Levey, MD, PhD), P30 AG072946 (PI Linda Van Eldik, PhD), P30 AG062715 (PI Sanjay Asthana, MD, FRCP), P30 AG072973 (PI Russell Swerdlow, MD), P30 AG066506 (PIs Glenn Smith, PhD, ABPP, David Lowenstein, PhD, Ranjan Duara, MD), P30 AG066508 (PIs Stephen Strittmatter, MD, PhD, Christopher Van Dyck, MD), P30 AG066515 (PI Victor Henderson, MD, MS), P30 AG072947 (PI Suzanne Craft, PhD), P30 AG072931 (PI Henry Paulson, MD, PhD), P30 AG066546 (PIs Sudha Seshadri, MD, Gladys Maestre, MD, PhD), P30 AG086401 (PI Erik Roberson, MD, PhD), P30 AG086404 (PI Gary Rosenberg, MD), P30 AG086403 (PI Angela Jefferson, PhD), P30 AG072958 (PIs Heather Whitson, MD, Gwenn Garden, MD, PhD), P30 AG072959 (PI Jagan Pillai, MD, PhD), P30 AG092752 (Ihab Hajjar, MD, MS).

SCAN is a multi-institutional project that was funded as a U24 grant (AG067418) by the National Institute on Aging in May 2020. Data collected by SCAN and shared by NACC are contributed by the NIA-funded ADRCs as follows: Arizona Alzheimer’s Center - P30 AG072980 (PI: Eric Reiman, MD); R01 AG069453 (PI: Eric Reiman (contact), MD); P30 AG019610 (PI: Eric Reiman, MD); and the State of Arizona which provided additional funding supporting our center; Boston University - P30 AG013846 (PI Neil Kowall MD); Cleveland ADRC - P30 AG062428 (James Leverenz, MD); Cleveland Clinic, Las Vegas – P20 AG068058; Columbia - P50 AG008702 (PI Scott Small MD); Duke/UNC ADRC – P30 AG072958; Emory University - P30AG066511 (PI Levey Allan, MD, PhD); Indiana University - R01 AG19771 (PI Andrew Saykin, PsyD); P30 AG10133 (PI Andrew Saykin, PsyD); P30 AG072976 (PI Andrew Saykin, PsyD); R01 AG061788 (PI Shannon Risacher, PhD); R01 AG053993 (PI Yu-Chien Wu, MD, PhD); U01 AG057195 (PI Liana Apostolova, MD); U19 AG063911 (PI Bradley Boeve, MD); and the Indiana University Department of Radiology and Imaging Sciences; Johns Hopkins - P30 AG066507 (PI Marilyn Albert, Ph.D.); Mayo Clinic - P50 AG016574 (PI Ronald Petersen MD PhD); Mount Sinai - P30 AG066514 (PI Mary Sano, PhD); R01 AG054110 (PI Trey Hedden, PhD); R01 AG053509 (PI Trey Hedden, PhD); New York University - P30AG066512-01S2 (PI Thomas Wisniewski, MD); R01AG056031 (PI Ricardo Osorio, MD); R01AG056531 (PIs Ricardo Osorio, MD; Girardin Jean-Louis, PhD); Northwestern University - P30 AG013854 (PI Robert Vassar PhD); R01 AG045571 (PI Emily Rogalski, PhD); R56 AG045571, (PI Emily Rogalski, PhD); R01 AG067781, (PI Emily Rogalski, PhD); U19 AG073153, (PI Emily Rogalski, PhD); R01 DC008552, (M.-Marsel Mesulam, MD); R01 AG077444, (PIs M.-Marsel Mesulam, MD, Emily Rogalski, PhD); R01 NS075075 (PI Emily Rogalski, PhD); R01 AG056258 (PI Emily Rogalski, PhD); Oregon Health and Science University - P30 AG066518 (PIs Lisa Silbert, MD, Kevin Duff, PhD); R56 AG074321 (PI Jeffrey Kaye, MD); Rush University - P30 AG010161 (PI David Bennett MD); Stanford – P30AG066515; P50 AG047366 (PI Victor Henderson MD MS); University of Alabama, Birmingham – P20; University of California, Davis - P30 AG012019 (PI Charles DeCarli, MD); P30 AG072972 (PI Charles DeCarli, MD); University of California, Irvine - P50 AG016573 (PI Frank LaFerla PhD); University of California, San Diego - P30AG062429 (PI James Brewer, MD, PhD); University of California, San Francisco - P30 AG062422 (Rabinovici, Gil D., MD); University of Kansas - P30 AG035982 (Russell Swerdlow, MD); University of Kentucky - P30 AG028283-15S1 (PIs Linda Van Eldik, PhD and Brian Gold, PhD); University of Michigan ADRC - P30AG053760 (PI Henry Paulson, MD, PhD) P30AG072931 (PI Henry Paulson, MD, PhD) Cure Alzheimer’s Fund 200775 - (PI Henry Paulson, MD, PhD) U19 NS120384 (PI Charles DeCarli, MD, University of Michigan Site PI Henry Paulson, MD, PhD) R01 AG068338 (MPI Bruno Giordani, PhD, Carol Persad, PhD, Yi Murphey, PhD) S100D026738-01 (PI Douglas Noll, PhD) R01 AG058724 (PI Benjamin Hampstead, PhD) R35 AG072622 (PI Benjamin Hampstead, PhD) W81XWH2110743 (PI Benjamin Hampstead, PhD) R01 AG073235 (PI Nancy Chiaravalloti, University of Michigan Site PI Benjamin Hampstead, PhD) 1I01RX001534 (PI Benjamin Hampstead, PhD) IRX001381 (PI Benjamin Hampstead, PhD); University of New Mexico - P20 AG068077 (Gary Rosenberg, MD); University of Pennsylvania - State of PA project 2019NF4100087335 (PI David Wolk, MD); Rooney Family Research Fund (PI David Wolk, MD); R01 AG055005 (PI David Wolk, MD); University of Pittsburgh - P50 AG005133 (PI Oscar Lopez MD); University of Southern California - P50 AG005142 (PI Helena Chui MD); University of Washington - P50 AG005136 (PI Thomas Grabowski MD); University of Wisconsin - P50 AG033514 (PI Sanjay Asthana MD FRCP); Vanderbilt University – P20 AG068082; Wake Forest - P30AG072947 (PI Suzanne Craft, PhD); Washington University, St. Louis - P01 AG03991 (PI John Morris MD); P01 AG026276 (PI John Morris MD); P20 MH071616 (PI Dan Marcus); P30 AG066444 (PI John Morris MD); P30 NS098577 (PI Dan Marcus); R01 AG021910 (PI Randy Buckner); R01 AG043434 (PI Catherine Roe); R01 EB009352 (PI Dan Marcus); UL1 TR000448 (PI Brad Evanoff); U24 RR021382 (PI Bruce Rosen); Avid Radiopharmaceuticals / Eli Lilly; Yale - P50 AG047270 (PI Stephen Strittmatter MD PhD); R01AG052560 (MPI: Christopher van Dyck, MD; Richard Carson, PhD); R01AG062276 (PI: Christopher van Dyck, MD); 1Florida - P30AG066506-03 (PI Glenn Smith, PhD); P50 AG047266 (PI Todd Golde MD PhD)

Appendix roadmap

The appendix supports the main paper with the full model specification, priors and hyperparameters, the exact ELBO and variational parameterization, training pseudocode, identifiability proofs, parameter-block recovery against truth, sensitivity analyses, leave-one-cohort-out and longitudinal validation, and the closed-form derivations and Sylvester–Woodbury reductions for the derived covariance-path summaries.

SectionContents
App. BFull model specification and inference: joint likelihood, variational family, ELBO and reparameterized gradients, training algorithm, test-time inference, and closed-form derived summaries (Sylvester–Woodbury reductions, pairwise correlation, Fisher modality weights)
App. CFormal identifiability definitions, full proof of Theorem 1, warp invariance, the Theorem-1 checklist at the fitted real-cohort posterior, and full-model identification proposition
App. DExperimental protocol: cohort summary, informative priors, competing methods and runtime, metric definitions, sensitivity analysis (hyperparameters and cohort size), robustness to anchor corruption, and test-time refinement
App. EReal-data validation and biology: leave-one-cohort-out cohort-shift validation, longitudinal validation (stage velocity, cognition recovery, MCI-to-AD conversion), subtype biology summaries (stage discriminability, endpoint pathology, cross-modal correlations), per-factor multimodal mixture, and stage-varying Fisher modality weights

Table 6. Supplement navigation: where to find what.

Full model specification and inference

Joint likelihood

Let Ψ\boldsymbol{\Psi} collect the global model parameters of §2 and Z={(ci,Si)}i=1n\mathcal{Z} = \{(c_i, S_i)\}_{i=1}^{n} the subject-level latents. The full joint over observables, latents, and parameters factorizes as

log⁡p(D,Z,Ψ∣X)=log⁡p(Ψ)+∑i=1n[log⁡p(ci∣Xi,Ψ)+log⁡p(Si∣ci,Xi,Ψ)+log⁡p(Yi,Oi∣ci,Si,Ψ)+Oicoglog⁡p(Yicog∣ci,Si,Xi,Ψ)].(22)\log p(\mathcal{D}, \mathcal{Z}, \boldsymbol{\Psi} \mid\mathcal{X}) = \log p(\boldsymbol{\Psi}) + \sum_{i=1}^{n} \left[\log p(c_i \mid X_i, \boldsymbol{\Psi}) + \log p(S_i \mid c_i, X_i, \boldsymbol{\Psi}) + \log p(Y_i, O_i \mid c_i, S_i, \boldsymbol{\Psi}) + O_i^{\mathrm{cog}} \log p(Y_i^{\mathrm{cog}} \mid c_i, S_i, X_i, \boldsymbol{\Psi})\right]. \tag*{(22)}

The subtype–stage priors p(ci∣Xi,Ψ)p(c_i \mid X_i, \boldsymbol{\Psi}) and p(Si∣ci,Xi,Ψ)p(S_i \mid c_i, X_i, \boldsymbol{\Psi}) are stratum-specific: equation (9) for i∈Ui \in\mathcal{U}; equation (10) for i∈Aci \in\mathcal{A}_{c}, with p(ci=c∣Xi,Ψ)=1p(c_i=c \mid X_i, \boldsymbol{\Psi})=1 encoding the observed endpoint subtype as a Dirac prior; and equation (11) for i∈Hi \in\mathcal{H}, with cic_i unconstrained. The biomarker factor log⁡p(Yi,Oi∣ci,Si,Ψ)\log p(Y_i,O_i \mid c_i, S_i, \boldsymbol{\Psi}) is conditionally independent of XiX_i given (ci,Si,Ψ)(c_i, S_i, \boldsymbol{\Psi}), while the cognitive factor depends on XiX_i linearly through equation (2).

The parameter prior p(Ψ)p(\boldsymbol{\Psi}) factorizes across the boundary, velocity, coordination, subtype–stage, and cognitive blocks of the generative process,

log⁡p(Ψ)=log⁡p(Θ0)+log⁡p(α,B)+log⁡p(γ0,γX,σcog)+log⁡ψsoft(Θ0,{Θc,J,Vc,1:J}c=1C)+∑c=1C[log⁡p(μc)+log⁡p(Θc,J∣μc)+log⁡p(Vc)+log⁡p(Ac,νc(⋅),Dc)+log⁡p(bc,σc)+log⁡p(ξc)].(23)\begin{aligned} \log p(\boldsymbol{\Psi}) ={}& \log p(\boldsymbol{\Theta}_0) + \log p(\boldsymbol{\alpha}, B) + \log p(\gamma_0, \gamma_X, \sigma_{\mathrm{cog}}) + \log\psi_{\mathrm{soft}}\left(\boldsymbol{\Theta}_0, \{\boldsymbol{\Theta}_{c,J}, V_{c,1:J}\}_{c=1}^{C}\right) \\ &+ \sum_{c=1}^{C}\left[\log p(\boldsymbol{\mu}_c) + \log p(\boldsymbol{\Theta}_{c,J} \mid\boldsymbol{\mu}_c) + \log p(V_c) \right.\\ &\qquad\left.{}+ \log p(A_c, \nu_c(\cdot), D_c) + \log p(b_c, \sigma_c) + \log p(\xi_c)\right]. \tag*{(23)} \end{aligned}

with per-component priors specified in §2, ψsoft\psi_{\mathrm{soft}} the Gaussian coupling potential of equation (5), and VcV_c the parametric velocity-field components {δc,r,tc,r,ωc,r,βc,r}r=1R\{\delta_{c,r}, t_{c,r}, \omega_{c,r}, \beta_{c,r}\}_{r=1}^{R} of equations (7) and (8), which determine the discretized shell-endpoint velocities Vc,jV_{c,j} for j=0,…,Jj=0,\ldots,J via equation (6); in particular Vc,0V_{c,0} enters the cubic Hermite equation (25) (left endpoint of the leftmost shell) and is governed by the same prior as Vc,1:JV_{c,1:J}.

Per-subject biomarker likelihood, fully composed. We write θc(s;Ψ)\theta_c(s;\boldsymbol{\Psi}), Σc(s;Ψ)\boldsymbol{\Sigma}_c(s;\boldsymbol{\Psi}) when emphasizing dependence on the global parameters Ψ\boldsymbol{\Psi} and recover the bare θc(s)\theta_c(s), Σc(s)\boldsymbol{\Sigma}_c(s) of §2 when Ψ\boldsymbol{\Psi}-dependence is implicit. The mean trajectory and within-stage covariance entering the per-subject Gaussian likelihood equation (1) are deterministic functionals of disjoint blocks of Ψ\boldsymbol{\Psi}. For the mean, the closed-form solution to the backward recursion equation (3) gives

Θc,j(Ψ)=Θc,J−Δ∑j′=j+1JVc,j′,j=0,…,J,(24)\boldsymbol{\Theta}_{c,j}(\boldsymbol{\Psi})=\boldsymbol{\Theta}_{c,J}-\Delta\sum_{j'=j+1}^{J}\mathbf{V}_{c,j'},\qquad j=0,\ldots,J, \tag*{(24)}

with each shell-endpoint velocity Vc,j\mathbf{V}_{c,j} assembled coordinatewise from equation (6) (Vc,0\mathbf{V}_{c,0} in particular is equation (6) evaluated at τ0=0\tau_0=0, supplying the slope at the leftmost shell boundary). The continuous-time trajectory is the cubic Hermite interpolant of the shell states with shell-endpoint slopes,

θc(s;Ψ)=h00(u)Θc,j−1+Δh10(u)Vc,j−1+ h01(u)Θc,j+Δh11(u)Vc,j,s∈[τj−1,τj],u=(s−τj−1)/Δ,(25)\theta_c(s;\boldsymbol{\Psi})=h_{00}(u)\boldsymbol{\Theta}_{c,j-1}+\Delta h_{10}(u)\mathbf{V}_{c,j-1} +\ h_{01}(u)\boldsymbol{\Theta}_{c,j}+\Delta h_{11}(u)\mathbf{V}_{c,j},\qquad s\in[\tau_{j-1},\tau_j],\quad u=(s-\tau_{j-1})/\Delta, \tag*{(25)}

with the standard cubic Hermite basis h00(u)=2u3−3u2+1h_{00}(u)=2u^3-3u^2+1, h10(u)=u3−2u2+uh_{10}(u)=u^3-2u^2+u, h01(u)=−2u3+3u2h_{01}(u)=-2u^3+3u^2, h11(u)=u3−u2h_{11}(u)=u^3-u^2. For the covariance, Σc(s;Ψ)\boldsymbol{\Sigma}_c(s;\boldsymbol{\Psi}) has the rank-KK-plus-diagonal form equation (14) with activation spline equation (15) and idiosyncratic floor Dc=diag⁡(dc,r+dmin⁡)D_c=\operatorname{diag}(d_{c,r}+d_{\min}).

Substituting these compositions into equation (1) gives the explicit log-likelihood evaluated on the observed coordinates Oi\mathcal{O}_i:

log⁡p(Yi,Oi∣ci,Si,Ψ)=−∣Oi∣2log⁡(2π)−12log⁡∣Σci,Oi(Si;Ψ)∣−12∥Yi,Oi−θci,Oi(Si;Ψ)∥Σci,Oi(Si;Ψ)−12,(26)\log p(\mathbf{Y}_{i,\mathcal{O}_i}\mid c_i,S_i,\boldsymbol{\Psi})=-\frac{|\mathcal{O}_i|}{2}\log(2\pi)-\frac{1}{2}\log\left|\boldsymbol{\Sigma}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})\right| -\frac{1}{2}\left\|\mathbf{Y}_{i,\mathcal{O}_i}-\boldsymbol{\theta}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})\right\|_{\boldsymbol{\Sigma}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})^{-1}}^2, \tag*{(26)}

with ∥x∥M2=xTMx\lVert\mathbf{x}\rVert_M^2=\mathbf{x}^{\mathsf{T}}M\mathbf{x}, where θci,Oi(Si;Ψ)∈R∣Oi∣\boldsymbol{\theta}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})\in\mathbb{R}^{|\mathcal{O}_i|} is the row-restriction of equation (25) to Oi\mathcal{O}_i, and Σci,Oi(Si;Ψ)∈R∣Oi∣×∣Oi∣\boldsymbol{\Sigma}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})\in\mathbb{R}^{|\mathcal{O}_i|\times|\mathcal{O}_i|} is the principal sub-block

Σci,Oi(Si;Ψ)=Aci,Oi,:diag⁡(νci(Si))Aci,Oi,:T+Dci,Oi,Oi,(27)\boldsymbol{\Sigma}_{c_i,\mathcal{O}_i}(S_i;\boldsymbol{\Psi})=\mathbf{A}_{c_i,\mathcal{O}_i,:}\operatorname{diag}(\boldsymbol{\nu}_{c_i}(S_i))\mathbf{A}_{c_i,\mathcal{O}_i,:}^{\mathsf{T}}+\mathbf{D}_{c_i,\mathcal{O}_i,\mathcal{O}_i}, \tag*{(27)}

with Ac,Oi,:∈R∣Oi∣×K\mathbf{A}_{c,\mathcal{O}_i,:}\in\mathbb{R}^{|\mathcal{O}_i|\times K} the row-restriction of Ac\mathbf{A}_c and Dc,Oi,Oi\mathbf{D}_{c,\mathcal{O}_i,\mathcal{O}_i} the corresponding diagonal sub-block. The restriction preserves the low-rank-plus-diagonal structure with rank min⁡(K,∣Oi∣)\min(K,|\mathcal{O}_i|), so the Sylvester–Woodbury reduction in equation (29) applies verbatim with Ac,Oi,:\mathbf{A}_{c,\mathcal{O}_i,:} in place of Ac\mathbf{A}_c and Dc,Oi,Oi\mathbf{D}_{c,\mathcal{O}_i,\mathcal{O}_i} in place of Dc\mathbf{D}_c, keeping the per-stage cost of the determinant and quadratic form at O(∣Oi∣K2+K3)O(|\mathcal{O}_i|K^2+K^3) regardless of the missingness pattern. The lower-triangular constraint on Ac\mathbf{A}_c is not preserved under the row restriction to Oi\mathcal{O}_i but enters only through the global identifiability of Ac\mathbf{A}_c (Theorem 1); equation (26) depends on Ac\mathbf{A}_c only through Ac,Oi,:diag⁡(νc(Si))Ac,Oi,:T\mathbf{A}_{c,\mathcal{O}_i,:}\operatorname{diag}(\boldsymbol{\nu}_{c}(S_i))\mathbf{A}_{c,\mathcal{O}_i,:}^{\mathsf{T}} and is well-defined on any sub-block.

Inference targets the posterior p(Ψ,Z∣D,X)p(\boldsymbol{\Psi},Z\mid\mathcal{D},\mathbf{X}), approximated by the structured variational family of equation (17) optimized against the collapsed ELBO of equation (18).

Inference

Reparameterized gradient. Writing w=(Ψ,{Si(c)})\mathbf{w}=(\boldsymbol{\Psi},\{S_i^{(c)}\}) for the continuous latents and θ=(ϕ,ψ)\boldsymbol{\theta}=(\boldsymbol{\phi},\boldsymbol{\psi}) for the variational parameters, equation (19) gives w=g(ϵ;θ)\mathbf{w}=g(\boldsymbol{\epsilon};\boldsymbol{\theta}) with ϵ∼N(0,I)\boldsymbol{\epsilon}\sim\mathcal{N}(\mathbf{0},I) independent of θ\boldsymbol{\theta}. The reparameterized gradient of equation (18) is

\nabla_{\boldsymbol{\theta}}\mathcal{L}(\boldsymbol{\theta})=\mathbb{E}_{\boldsymbol{\epsilon}}\left[\nabla_{\boldsymbol{\theta}}\log p(\mathcal{D},g(\boldsymbol{\epsilon};\boldsymbol{\theta}))-\n\nabla_{\boldsymbol{\theta}}\log q_{\boldsymbol{\theta}}(g(\boldsymbol{\epsilon};\boldsymbol{\theta}))\right], \tag*{(28)}

estimated by single-sample Monte Carlo per minibatch step. The Bernoulli gates δc,r\delta_{c,r} inside Ψ\boldsymbol{\Psi} are reparameterized through a Concrete relaxation (below).

Recognition network. The encoder producing {(μψ(c),τψ(c))}c=1C\{(\boldsymbol{\mu}_{\psi}^{(c)},\boldsymbol{\tau}_{\psi}^{(c)})\}_{c=1}^{C} in equation (17) is a feed-forward MLP with two hidden layers of width 128, LayerNorm, SiLU activations, and dropout 0.1, taking (Yi,Oi,Xi)(\mathbf{Y}_{i,\mathcal{O}_i},\mathbf{X}_i) as input. Output heads are CC linear projections to (μψ(c),log⁡τψ(c))(\boldsymbol{\mu}_{\psi}^{(c)},\log\boldsymbol{\tau}_{\psi}^{(c)}), with τψ(c)=softplus⁡(log⁡τψ(c))+10−3\boldsymbol{\tau}_{\psi}^{(c)}=\operatorname{softplus}(\log\boldsymbol{\tau}_{\psi}^{(c)})+10^{-3}. The global Gaussian qϕglobq_{\boldsymbol{\phi}}^{\mathrm{glob}} is realized through AutoLowRankMultivariateNormal [40] with rank rg=10r_g=10.

Reparameterization of the singular activation prior. The activation-spline prior equation (15) is supported on the centered subspace P0={w∈RP:1⊤w=0}P_0=\{w\in\mathbb{R}^{P}: \mathbf{1}^{\top}w=0\}. We sample wc,kstd∼N(0,IP)w_{c,k}^{\mathrm{std}}\sim\mathcal{N}(0,I_P) and reparameterize wc,k=τkΠ0Lwc,kstdw_{c,k}=\tau_k\Pi_0Lw_{c,k}^{\mathrm{std}}, with L=chol⁡((KB+ϵBIP)−1)L=\operatorname{chol}((K_B+\epsilon_BI_P)^{-1}) precomputed once and the projection Π0=IP−1P11⊤\Pi_0=I_P-\frac{1}{P}\mathbf{1}\mathbf{1}^{\top} enforcing 1⊤wc,k=0\mathbf{1}^{\top}w_{c,k}=0 exactly.

Concrete relaxation of the region-inclusion gates. The Bernoulli gates δc,r∼Bern⁡(πc,m(r))\delta_{c,r}\sim\operatorname{Bern}(\pi_{c,m(r)}) of equation (7) are realized at training time through a Concrete (Gumbel-Softmax) relaxation [41, 42] with temperature λ(t)=1.0−0.9 t/T∈[0.1,1.0]\lambda(t)=1.0-0.9\,t/T\in[0.1,1.0], annealed linearly across the optimization horizon TT. At evaluation, δc,r\delta_{c,r} is rounded to its hard Bernoulli value.

Optimization. The variational parameters (ϕ,ψ)(\phi,\psi) are optimized with Adam under global-norm gradient clipping at threshold 5 and minibatch size ∣B∣=256\lvert B\rvert=256, in two phases. Phase 1 holds the activation block at Σc=Dc\Sigma_c=D_c and uses lr1=3×10−3\mathrm{lr}_1=3\times10^{-3} for T1=5×104T_1=5\times10^4 steps; phase 2 releases the activation block and uses lr2=10−3\mathrm{lr}_2=10^{-3} for T2=5×104T_2=5\times10^4 steps, initialized from the phase-1 parameters. The Concrete temperature schedule λ(t)\lambda(t) runs across the combined horizon T=T1+T2T=T_1+T_2.

Algorithm 1 Stochastic variational inference for ELPAC.

Require: Cohort {(Yi,Oi,Xi,ci⋆)}i=1n\{(Y_i,O_i,X_i,c_i^\star)\}_{i=1}^{n}; learning rate lr\mathrm{lr}; horizon TT

  1. Initialize global variational parameters (μϕ,Wϕ,dϕ)(\mu_\phi,W_\phi,d_\phi) and encoder weights ψ\psi

  2. for t=1,…,Tt=1,\ldots,T do

  3. &nbsp;&nbsp;&nbsp;&nbsp;Sample minibatch B⊆{1,…,n}B\subseteq\{1,\ldots,n\}

  4. &nbsp;&nbsp;&nbsp;&nbsp;Reparameterized draw Ψ~←μϕ+Wϕϵ(W)+dϕ⊙ϵ(d)\widetilde{\Psi}\leftarrow\mu_\phi+W_\phi\epsilon^{(W)}+d_\phi\odot\epsilon^{(d)}, with ϵ(W),ϵ(d)∼N(0,I)\epsilon^{(W)},\epsilon^{(d)}\sim\mathcal{N}(0,I) and Concrete temperature λ(t)\lambda(t) for the gates δc,r\delta_{c,r} in Ψ~\widetilde{\Psi}

  5. &nbsp;&nbsp;&nbsp;&nbsp;for each i∈Bi\in B do

  6. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Encode (μψ(c),τψ(c))c=1C←qψenc(Yi,Oi,Xi)(\mu_\psi^{(c)},\tau_\psi^{(c)})_{c=1}^{C}\leftarrow q_\psi^{\mathrm{enc}}(Y_i,O_i,X_i)

  7. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Reparameterized draw logit⁡(S~i(c))←μψ(c)+τψ(c)ϵi(c)\operatorname{logit}(\widetilde{S}_i^{(c)})\leftarrow\mu_\psi^{(c)}+\tau_\psi^{(c)}\epsilon_i^{(c)}, ϵi(c)∼N(0,1)\epsilon_i^{(c)}\sim\mathcal{N}(0,1), for each cc

  8. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Evaluate ℓi(c)←p(Yi,Oi∣c,S~i(c),Ψ~)p(Yicog∣c,S~i(c),Xi,Ψ~)Oicog\ell_i^{(c)}\leftarrow p(Y_i,O_i\mid c,\widetilde{S}_i^{(c)},\widetilde{\Psi})p(Y_i^{\mathrm{cog}}\mid c,\widetilde{S}_i^{(c)},X_i,\widetilde{\Psi})^{O_i^{\mathrm{cog}}} via Sylvester–Woodbury (section B.3)

  9. &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;log⁡p^i←logsumexp⁡c[log⁡p(c∣Xi,Ψ~)+log⁡ℓi(c)]\log\hat{p}_i\leftarrow\operatorname{logsumexp}_{c}\left[\log p(c\mid X_i,\widetilde{\Psi})+\log\ell_i^{(c)}\right]

  10. &nbsp;&nbsp;&nbsp;&nbsp;end for

  11. &nbsp;&nbsp;&nbsp;&nbsp;L^B←n∣B∣∑i∈B[log⁡p^i−∑c=1CKL⁡(qψ(Si(c))∥p(Si∣ci=c,Xi,Ψ~))]+log⁡p(Ψ~)−log⁡qϕglob(Ψ~)\widehat{\mathcal{L}}_B\leftarrow\frac{n}{\lvert B\rvert}\sum_{i\in B}\left[\log\hat{p}_i-\sum_{c=1}^{C}\operatorname{KL}\left(q_\psi(S_i^{(c)})\mathbin{\|}p(S_i\mid c_i=c,X_i,\widetilde{\Psi})\right)\right]+\log p(\widetilde{\Psi})-\log q_\phi^{\mathrm{glob}}(\widetilde{\Psi})

  12. &nbsp;&nbsp;&nbsp;&nbsp;g←∇(ϕ,ψ)L^Bg\leftarrow\nabla_{(\phi,\psi)}\widehat{\mathcal{L}}_B; clip ∥g∥2≤5\lVert g\rVert_2\leq5; update (ϕ,ψ)(\phi,\psi) with Adam(lr)(\mathrm{lr})

  13. end for

  14. return (ϕ^,ψ^)(\widehat{\phi},\widehat{\psi}); evaluate posterior summaries equations (20) and (21) by Monte Carlo over Ψ∼qϕ^glob\Psi\sim q_{\widehat{\phi}}^{\mathrm{glob}}

Test-time inference. The posterior summaries equations (20) and (21) are evaluated by Monte Carlo over M=50M=50 samples Ψ(m)∼qϕglob\Psi^{(m)}\sim q_\phi^{\mathrm{glob}}, with the inner stage integral ∫01p(s∣c,Xi,Ψ(m))ℓi(c)(Ψ(m),s) ds\int_0^1p(s\mid c,X_i,\Psi^{(m)})\ell_i^{(c)}(\Psi^{(m)},s)\,\mathrm{d}s computed by Gauss–Legendre quadrature on a G=19G=19-point logit-stage grid. For a held-out subject, this requires a single encoder forward pass and M⋅C⋅GM\cdot C\cdot G Sylvester–Woodbury likelihood evaluations. Per-subject refinement of this pass is evaluated in section D.8.

Closed forms and derived summaries

This subsection collects the closed-form expressions used for the per-step likelihood evaluation in algorithm 1 and the post-hoc derived summaries reported in section E. For each subtype cc, Ac∈RR×KA_c\in\mathbb{R}^{R\times K} is the loading matrix, Dc=diag⁡(dc,1,…,dc,R)≻0D_c=\operatorname{diag}(d_{c,1},\ldots,d_{c,R})\succ0 the idiosyncratic noise, and νc(s)∈R>0K\nu_c(s)\in\mathbb{R}_{>0}^{K} the activation vector. Write Mc=Ac⊤Dc−1Ac∈RK×KM_c=A_c^{\top}D_c^{-1}A_c\in\mathbb{R}^{K\times K} (computed once per subtype) and Gc(s)=(diag⁡(νc(s))−1+Mc)−1∈RK×KG_c(s)=(\operatorname{diag}(\nu_c(s))^{-1}+M_c)^{-1}\in\mathbb{R}^{K\times K} (computed per (subtype, stage) pair).

Determinant and inverse (Sylvester / Woodbury). The Sylvester and Woodbury identities reduce the per-stage cost from O(R3)O(R^3) to O(RK2+K3)O(RK^2 + K^3):

∣Σc(s)∣=∣Dc∣⋅∣IK+diag⁡(νc(s))Mc∣,|\Sigma_c(s)| = |D_c| \cdot|I_K + \operatorname{diag}(\nu_c(s))M_c|,
[Σc(s)−1]r,r′=I[r=r′]dc,r−1−dc,r−1dc,r′−1ac,rTGc(s)ac,r′.(29)[\Sigma_c(s)^{-1}]_{r,r'} = \mathbb{I}[r=r']d_{c,r}^{-1} - d_{c,r}^{-1}d_{c,r'}^{-1}a_{c,r}^{\mathsf T}G_c(s)a_{c,r'}. \tag*{(29)}

Stage-dependent pairwise correlation ρc(r,r′;s)\rho_c(r,r';s). For r≠r′r \ne r' the cross-modal entry of Σc(s)\Sigma_c(s) and the implied correlation are

Σc(s)r,r′=ac,rTdiag⁡(νc(s))ac,r′,ρc(r,r′;s)=Σc(s)r,r′Σc(s)r,rΣc(s)r′,r′,(30)\Sigma_c(s)_{r,r'} = a_{c,r}^{\mathsf T}\operatorname{diag}(\nu_c(s))a_{c,r'}, \qquad\rho_c(r,r';s) = \frac{\Sigma_c(s)_{r,r'}}{\sqrt{\Sigma_c(s)_{r,r}\Sigma_c(s)_{r',r'}}}, \tag*{(30)}

with Σc(s)r,r=ac,rTdiag⁡(νc(s))ac,r+dc,r\Sigma_c(s)_{r,r} = a_{c,r}^{\mathsf T}\operatorname{diag}(\nu_c(s))a_{c,r} + d_{c,r}.

Fisher modality weights wc,mFI(s)w_{c,m}^{\mathrm{FI}}(s) (marginal, blockwise-exact). Let θc′(s)=dθc/ds∈RR\theta'_c(s)=\mathrm{d}\theta_c/\mathrm{d}s \in\mathbb{R}^R, computed via spline-interpolated finite differences from the inferred mean trajectory, and

Σc′(s)=Acdiag⁡(νc′(s))AcT\Sigma'_c(s)=A_c\operatorname{diag}(\nu'_c(s))A_c^{\mathsf T}

with νc,k′(s)=νc,k(s)∑pwc,k,pψp′(s)\nu'_{c,k}(s)=\nu_{c,k}(s)\sum_p w_{c,k,p}\psi'_p(s). The marginal Fisher information from modality mm alone is

Ic,mmarg(s)=θc,Rm′(s)TΣc,m(s)−1θc,Rm′(s)+12tr⁡(Σc,m(s)−1Σc,m′(s)Σc,m(s)−1Σc,m′(s)),(31)I^{\mathrm{marg}}_{c,m}(s) = \theta'_{c,R_m}(s)^{\mathsf T}\Sigma_{c,m}(s)^{-1}\theta'_{c,R_m}(s) + \frac{1}{2}\operatorname{tr}\left(\Sigma_{c,m}(s)^{-1}\Sigma'_{c,m}(s)\Sigma_{c,m}(s)^{-1}\Sigma'_{c,m}(s)\right), \tag*{(31)}

with Σc,m(s)=Σc(s)Rm,Rm\Sigma_{c,m}(s)=\Sigma_c(s)_{R_m,R_m} the marginal covariance restricted to the Rm×RmR_m \times R_m block. Both Σc,m−1\Sigma_{c,m}^{-1} and Σc,m′\Sigma'_{c,m} admit the same Sylvester–Woodbury reduction as the full-rank counterparts of equation (29), applied with Ac,RmA_{c,R_m} in place of AcA_c and Dc,Rm,RmD_{c,R_m,R_m} in place of DcD_c, keeping the per-stage cost at O(RK2+K3)O(RK^2 + K^3). The per-modality weight is the share of total marginal Fisher information,

wc,mFI(s)=Ic,mmarg(s)∑m′∈MIc,m′marg(s),(32)w_{c,m}^{\mathrm{FI}}(s) = \frac{I^{\mathrm{marg}}_{c,m}(s)}{\sum_{m'\in\mathcal{M}} I^{\mathrm{marg}}_{c,m'}(s)}, \tag*{(32)}

the marginal-modality decomposition reported by Figure 12.

Figure 12. The most stage-informative modality varies by subtype: tau-PET/sMRI in EOAD, plasma p-tau181 then tau-PET in LOAD, sMRI throughout in HA. Per-subtype Fisher modality weights wc,mFI(sc)w^{\mathrm{FI}}_{c,m}(s_c), plasma split into AβA\beta ratio and p-tau181; bands ±1.96\pm1.96 SE over 20 splits.

Identifiability details

Formal definitions

Definition 1 (Observational equivalence). Two parameter settings Ψ\Psi, Ψ′\Psi' are observationally equivalent if they induce the same marginal distribution of the observables (Yi,Xi,Yicog)(Y_i, X_i, Y_i^{\mathrm{cog}}) for every admissible cohort configuration.

Definition 2 (Identifiability up to subtype permutation). The model is identifiable up to subtype permutation if observational equivalence implies equality of Ψ\Psi and Ψ′\Psi' up to a permutation of subtype labels and the corresponding relabeling of all subtype-indexed parameters.

Proof of Theorem 1

The subtype index cc is suppressed; we write Σ(s)=Adiag⁡(ν(s))AT+D\Sigma(s)=A\operatorname{diag}(\nu(s))A^{\mathsf T}+D as in equation (14). We adopt the conditions of Theorem 1; in addition, νk(s1)>0\nu_k(s_1)>0 for every kk at the reference stage s1s_1, and the B-spline basis {ψp}p=1P\{\psi_p\}_{p=1}^P used for log⁡νk(⋅)\log\nu_k(\cdot) forms a partition of unity, ∑pψp(s)=1\sum_p\psi_p(s)=1 for all s∈[0,1]s\in[0,1].

Generic regularity (holds by construction in our model+priors). (i) Spline-design coverage. The observed stages span the activation basis: there exist S≥PS\ge P distinct posterior stage values yielding a full-rank design matrix ΦS=[ψp(sℓ)]ℓ,p\Phi_S=[\psi_p(s_\ell)]_{\ell,p}. Holds for any continuous-stage prior with [0,1][0,1] support, including the logit-normal of equation (9). (ii) Anderson–Rubin row-deletion. For every subset I⊂[R]\mathcal{I}\subset[R] of 2K+12K+1 rows, the sub-matrix [Adiag⁡(ν(s))]I[A\operatorname{diag}(\sqrt{\nu(s)})]_{\mathcal{I}} has rank KK. Holds Lebesgue-a.e. on AA, and with probability one under the multiplicative-gamma cascade prior of section 2.4. (iii) Distinguishable trajectory features. θc(s)\theta_c(s) admits at least one identifiable interior feature (extremum, inflection, or modality-discordant onset) preserved only by the identity warp on [0,1][0,1]. Generic under the structured velocity equation (6) with distinct biomarker onsets {tc,r}\{t_{c,r}\}. Step 1 (identification of Adiag⁡(ν(s))A⊤A\operatorname{diag}(\nu(s))A^{\top} and DD at a fixed stage). For any stage ss, the model imposes the rank-KK-plus-diagonal decomposition Σ(s)=Adiag⁡(ν(s))A⊤+D\Sigma(s) = A\operatorname{diag}(\nu(s))A^{\top} + D with AA lower triangular with positive diagonal and DD diagonal. Under R≥2K+1R \ge2K + 1, the lower-triangular constraint, and the AR row-deletion regularity (ii) above, the classical Anderson–Rubin theorem [27, 30] identifies the factor model Σ(s)=A~(s)A~(s)⊤+D\Sigma(s) = \widetilde{A}(s)\widetilde{A}(s)^{\top} + D up to per-column signs of A~(s):=Adiag⁡(ν(s))1/2\widetilde{A}(s) := A\operatorname{diag}(\nu(s))^{1/2}, which the positive-diagonal constraint pins to +1+1. In particular DD and Adiag⁡(ν(s))A⊤=A~(s)A~(s)⊤A\operatorname{diag}(\nu(s))A^{\top} = \widetilde{A}(s)\widetilde{A}(s)^{\top} are uniquely determined by Σ(s)\Sigma(s). Applied at s1s_1 and s2s_2 with DD shared, this yields a single DD and the rank-KK matrices Π∙:=Σ(s∙)−D=Adiag⁡(ν(s∙))A⊤\Pi_{\bullet} := \Sigma(s_{\bullet}) - D = A\operatorname{diag}(\nu(s_{\bullet}))A^{\top}.

Step 2 (factor decomposition across two stages). Restricted to the column space of AA, the matrix Π1\Pi_1 is symmetric positive definite under νk(s1)>0\nu_k(s_1) > 0, so the generalized eigenvalue problem Π2v=λΠ1v\Pi_2v = \lambda\Pi_1v on col⁡(A)\operatorname{col}(A) is well-posed and admits KK generalized eigenvalues λk=νk(s2)/νk(s1)\lambda_k = \nu_k(s_2)/\nu_k(s_1) with eigenvectors vkv_k dual to the columns of AA. Under the ratio-distinctness condition equation (16), the eigenvalues are pairwise distinct and the eigenspaces are one-dimensional. The primal columns of AA are recovered as a~k=Π1vk/∥Π1vk∥2\widetilde{a}_k = \Pi_1v_k/\lVert\Pi_1v_k\rVert_2, determined up to a per-column positive scale.

Step 3 (resolution of the per-column scale). The lower-triangular structure of AA fixes the sign and ordering of the columns: column kk has its first non-zero entry in row kk, with that entry positive. There remains a one-parameter rescaling per column, A⋅,k↦ρkA⋅,kA_{\cdot,k} \mapsto\rho_k A_{\cdot,k} and log⁡νk(⋅)↦log⁡νk(⋅)−2log⁡ρk\log\nu_k(\cdot) \mapsto\log\nu_k(\cdot) - 2\log\rho_k for ρk>0\rho_k > 0, that leaves Σ(s)\Sigma(s) invariant. Under the spline parameterization log⁡νk(s)=∑pwk,pψp(s)\log\nu_k(s) = \sum_p w_{k,p}\psi_p(s) with the partition-of-unity property ∑pψp(s)=1\sum_p \psi_p(s) = 1, the uniform shift −2log⁡ρk-2\log\rho_k in log⁡νk\log\nu_k corresponds to wk,p↦wk,p−2log⁡ρkw_{k,p} \mapsto w_{k,p} - 2\log\rho_k for every pp, so ∑pwk,p\sum_p w_{k,p} shifts by −2Plog⁡ρk-2P\log\rho_k. The centering identity ∑pwk,p=0\sum_p w_{k,p} = 0 then forces ρk=1\rho_k = 1. With the per-column scale resolved, ν(s1)\nu(s_1) and ν(s2)\nu(s_2) are identified pointwise; under the spline-design coverage regularity (i) the coefficients {wk,p}\{w_{k,p}\} are identified from Σ(s)\Sigma(s) at S≥PS \ge P stages with full-rank design ΦS\Phi_S, after which ν(⋅)\nu(\cdot) is identified throughout [0,1][0,1].

Step 4 (warp equivalence). The activation ratios in equation (16) are invariant under any strictly monotone reparameterization φ:[0,1]→[0,1]\varphi: [0,1] \to[0,1] of the latent stage. Boundary pinning by equations (10) and (11) forces φ(0)=0\varphi(0)=0 and φ(1)=1\varphi(1)=1. The trajectory-feature regularity (iii) then forbids any non-identity such φ\varphi from preserving the identified interior feature set of θc(s)\theta_c(s), so φ\varphi is the identity on [0,1][0,1] and the latent stage is identified up to the model’s natural symmetries.

Theorem-1 conditions at the fitted real-cohort posterior

The regularity conditions of section C.2 are genericity statements, which certify a prior draw. We therefore decided each condition at the fitted estimate itself: Table 7 reports the status of each, Table 8 the equation (16) margin measured there. Equation (16) asks for distinctness, and distinctness holds strictly in every seed and both folds, at both the nominal and the data-supported rank.

Every condition a fitted point can decide holds at the real-cohort posterior means, exhaustively so on the row-deletion condition, in every seed, and in both leave-one-cohort-out folds where scored. These diagnostics show the fitted estimates are consistent with every checkable algebraic and numerical condition; they do not establish real-data identifiability, nor discharge the theorem’s two-stage covariance-identification premise, which a fit cannot exhibit.

Full-model identification (Proposition 1)

Theorem 1 identifies the dynamic factor block conditional on Σc(s)\Sigma_c(s) being available at two distinct stages. Closing this conditioning at the full-model level introduces a single substantive hypothesis on the family of continuous-stage Gaussian mixtures induced by the generative process.

Proposition 1 (Full-model identifiability). Within the structural model of Theorem 1, assume that the family of continuous-stage Gaussian mixtures with stage-varying mean θc(s)\theta_c(s) and covariance Σc(s)\Sigma_c(s), induced by the generative process of §2 and indexed by subtype cc, is identifiable from the marginal distribution p(Y∣c)p(\mathbf{Y}\mid c). Then the full parameter vector (Ac,νc(⋅),Dc,θc(⋅))c=1C(A_c,\nu_c(\cdot),D_c,\theta_c(\cdot))_{c=1}^{C} and the per-subject latents are generically identifiable up to a permutation of subtype labels.

Proof sketch. Under the mixing-family identifiability hypothesis, the conditional distributions {p(Y∣c,s)}s∈[0,1]\{p(\mathbf{Y}\mid c,s)\}_{s\in[0,1]} are identified from the marginal p(Y∣c)p(\mathbf{Y}\mid c) together with the latent stage measure. The boundary supervision of equations (10) and (11), by anchoring s→0s \to0 on H\mathcal{H} and s→1s \to1 on AcA_c, fixes the strictly-monotone reparameterization ambiguity inherent to Theorem 1 (Step 4) and thereby pins the latent stage measure on [0,1][0,1]. Pointwise identifiability of p(Y∣c,s)p(Y \mid c,s) yields θc(s)\theta_c(s) from first moments and Σc(s)\Sigma_c(s) from second moments at every ss in the support; Theorem 1 applied at any two stages with pairwise distinct activation ratios identifies the dynamic factor block (Ac,νc(⋅),Dc)(A_c,\nu_c(\cdot),D_c). □

ClassTheorem-1 conditionStatus
StructuralR≥2K+1R \ge2K+1; AcA_c lower-triangular, strictly positive diagonal; νc,k(s1)>0\nu_{c,k}(s_1)>0all hold — R=22≥17R=22 \ge17 at nominal K=8K=8
centered coefficients, diagonal-positive DcD_chold by parameterization
non-constant activationsholds in all 20 pooled seeds; every subtype carries stage-monotone columns
Regularity(i) spline-design coveragefull rank P=5P=5 in all 240 designs, worst σmin⁡/σmax⁡=1.7×10−2\sigma_{\min}/\sigma_{\max}=1.7 \times10^{-2}
(ii) Anderson–Rubin row deletionexhaustive — all (2217)=26,334\binom{22}{17}=26{,}334 17-row sub-blocks of Acdiag⁡(νc(s))1/2A_c\operatorname{diag}(\nu_c(s))^{1/2} retain full rank 8
(iii) distinguishable trajectory featuresgeneric under the structured velocity, which places interior features in θc(s)\theta_c(s); fitted onsets separate across modalities in every subtype
equation (16)pairwise-distinct νc,k(s2)/νc,k(s1)\nu_{c,k}(s_2)/\nu_{c,k}(s_1)strict inequality, no tolerance, at both scopes (K=8K=8 and K⋆K_\star)

Table 7. Status of each Theorem-1 condition at the fitted posterior means on real cohort.

ScopeSubtypemin equation (16) gap over K⋆K_\starmin νc,k(s1)\nu_{c,k}(s_1), K=8K=8K⋆K_\star
PooledEOAD0.00120.06783.66
LOAD0.00020.05603.95
HA0.00010.11816.17
Leave-ADNIEOAD0.00540.09563.43
LOAD0.00290.02743.29
HA0.00110.12056.15
Leave-NACCEOAD0.01010.29422.47
LOAD0.00630.33292.97
HA0.00370.06622.55

Table 8. Equation (16) margin, activation floor, and data-supported rank (real cohort, 20 seeds per fold). Gaps compare νc,k(s2)/νc,k(s1)\nu_{c,k}(s_2)/\nu_{c,k}(s_1) at s2=0.9s_2=0.9 against s1=0.1s_1=0.1, normalized by the largest ratio in the fit and taken over the block K⋆K_\star (per-fit rounded participation ratio of the singular values of AcA_c). Gap and floor are worst-seed values; the last column is the mean of that ratio before rounding.

Scope of the mixing-family hypothesis. This subsection takes the continuous-stage extension of the finite-mixture results it cites [43, 44] as a hypothesis, and we identify the result that hypothesis corresponds to. Bruni and Koch’s identifiability theorem [45] recovers the mixing measure from the mean and covariance functions on a compact index under two regularity classes. Our construction satisfies the first, Λ1\Lambda_1, by design: splines on [0,1][0,1] give bounded C1C^1 paths and the noise floor keeps Σc(s)\Sigma_c(s) uniformly positive definite. The second, Λ2\Lambda_2, is the pairwise injectivity they single out as crucial, and we adopt it as a modeling assumption on the admissible class.

The fitted posteriors are consistent with the case Λ2\Lambda_2 reduces to within a single path: injectivity there needs one stage-monotone activation column per subtype, and Table 7 records that every subtype carries them. That matters most for healthy aging, whose near-flat mean cannot carry injectivity alone. The monotonicity is of νc,k(s)\nu_{c,k}(s) itself—the interior peaks of Figure 11 are in the normalized variance share, which peaks interiorly even when every activation is monotone.

Bruni and Koch write out the scalar case and state the multivariate extension without a general-pp proof. Their subtype-mixture result identifies labels through disjoint ranges; under ELPAC’s shared healthy origin (equations (5) and (11)) we instead assume the endpoint anchors at s→1s \to1 (equation (10)) select the labeled components, carried inward by the backward recursion (equation (3)). Thus Proposition 1 stays explicitly conditional, and no reported result depends on it. Theorem 1 is established without invoking the mixing-family hypothesis.

Experimental protocol

Real-data cohort summary

Data used in the preparation of this article were obtained from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) database (adni.loni.usc.edu). The ADNI was launched in 2003 as a public-private partnership, led by Principal Investigator Michael W. Weiner, MD. The original goal of ADNI was to test whether serial magnetic resonance imaging (MRI), positron emission tomography (PET), other biological markers, and clinical and neuropsychological assessment can be combined to measure the progression of mild cognitive impairment (MCI) and early Alzheimer’s disease (AD). The current goals include validating biomarkers for clinical trials, improving the generalizability of ADNI data by increasing diversity in the participant cohort, and to provide data concerning the diagnosis and progression of Alzheimer’s disease to the scientific community. For up-to-date information, see adni.loni.usc.edu. ADNI clinical, cognitive, and fluid-biomarker data were taken from the ADNIMERGE R package (version 0.0.1, June 2022), and amyloid and tau PET regional SUVRs from the UC Berkeley processed tables (IDA release September 2025, downloaded December 2025).

Table 9 summarizes the harmonized ADNI/NACC cohort introduced in § 3.2 and used for the ablations of Table 5. The cohort comprises every ADNI or NACC subject in the canonical extraction with at least one of four modalities measured (amyloid PET, tau PET, structural MRI, plasma biomarkers). Subtype anchors are subjects with clinically confirmed endpoint phenotypes (EOAD, LOAD, HA), and the remaining subjects are unlabeled at the subtype level and contribute through the unsupervised likelihood. Demographic denominators reflect non-missing values per field, and modality-availability rates report the percentage of cohort subjects with at least one feature observed in each modality. Per-feature missingness exceeds 80% on some plasma cells, and the observation likelihood equation (1) integrates out the unobserved coordinates analytically. Site and scanner effects are harmonized fold-wise with ComBat [46], and intracranial volume is residualized fold-wise from sMRI volumes. Age, education, female fraction, and APOE-ϵ\epsilon4 rate agree across sources within 1.7 years and within sample-size-weighted SDs, consistent with the cross-cohort transfer in section E.1.

ADNINACCTotal
Subjects1,7225,7797,501
Subtype anchors
EOAD (early-onset Alzheimer’s disease)402868
LOAD (late-onset Alzheimer’s disease)263114377
HA (healthy aging)83113196
NC startpoint pool249170219
Unlabeled (general cohort)1,2875,3546,641
Demographics, mean (SD) or %
Age at scan (years)72.9 (7.8)71.2 (8.5)71.6 (8.4)
Female (%)49.059.657.2
Education (years)16.3 (2.6)16.2 (2.7)16.2 (2.7)
APOE-ε4 carriers (%)43.839.140.2
Modality availability (% of cohort with ≥ 1 feature observed)
Amyloid PET72.634.042.9
Tau PET16.915.415.7
Structural MRI79.970.973.0
Plasma biomarkers58.00.013.3

Table 9. The harmonized ADNI+NACC/SCAN cohort is dominated by an unlabeled middle population with sparse multimodal coverage. Per-cohort sample sizes, subtype-anchor counts, demographics, and per-modality availability (N=7,501N=7,501). NACC subjects from the March 2026 data freeze with SCAN-standardized imaging. Totals for demographics and modality availability are sample-size-weighted across ADNI and NACC; pooled SDs use the standard combined-sample formula.

Prior specifications

The boundary supervision priors equations (10) and (11) use sA=0.95s_A = 0.95, sH=0.01s_H = 0.01, and ϵS=0.1\epsilon_S = 0.1 throughout. For the AD experiments, the diffuse priors on the modality-level onset centers {t~c,m}\{\tilde{t}_{c,m}\} in equation (8) and on the age coordinate of bcb_c in equation (9) are replaced by informative location and ordering priors. (a) AD biomarker cascade. For c∈{EOAD,LOAD}c \in\{\mathrm{EOAD}, \mathrm{LOAD}\}, the modality-level centers are softly ordered amyloid-PET →\to tau-PET →\to structural-MRI through a Gaussian penalty ∑m<m′(max⁡(0,t~c,m−t~c,m′))2/σord2\sum_{m<m'} \bigl(\max(0,\tilde{t}_{c,m}-\tilde{t}_{c,m'})\bigr)^2/\sigma_{\mathrm{ord}}^2 with σord=0.1\sigma_{\mathrm{ord}}=0.1, encoding the NIA-AA cascade [2]. (b) Preserved-aging endpoint. For the HA subtype, t~HA,m∼N(logit⁡0.9,0.052)\tilde{t}_{\mathrm{HA},m} \sim\mathcal{N}(\operatorname{logit} 0.9, 0.05^2) for m∈{Amyloid PET,Tau PET}m \in\{\mathrm{Amyloid\ PET},\mathrm{Tau\ PET}\}, placing pathology onsets near the endpoint. (c) Subtype age priors. The age coordinate of bcb_c is drawn from N(−2.0,0.5)\mathcal{N}(-2.0, 0.5) for EOAD, N(+1.5,0.5)\mathcal{N}(+1.5, 0.5) for LOAD, and N(−0.5,0.5)\mathcal{N}(-0.5, 0.5) for HA, with the remaining coordinates keeping N(0,1)\mathcal{N}(0,1). The synthetic experiments use the diffuse bc≡0b_c \equiv0 and the unconditional categorical α∼N(0,IC)\alpha\sim\mathcal{N}(0,I_C) on subtype.

Competing methods and runtime

The external baselines (Table 2 and Table 4) and internal variants (Table 3 and Table 5) are introduced in § 3.1 and § 3.2. Table 10 reports per-fit wall-clock time and training sample size on the synthetic and real-data benchmarks. The intended read of the table is end-to-end cost for a single posterior fit, so the ELPAC numbers cover both phases of the curriculum optimizer of section B.2 (initialization with diagonal covariance plus the joint phase under the rank-KK-plus-diagonal covariance) and the test-time encoder pass.

MethodNLL/cell ↓RMSE ↓∣ρ∣|\rho|MMSE ↑Macro-F1 ↑BAcc ↑AUC AD/(CN+MCI) ↑AUC AD/MCI ↑
SuStaIn––35.6±1.026.9±1.036.6±0.579.4±0.573.0±0.5
DEBM––40.3±1.1––75.2±0.770.4±0.6
Static-FA––40.3±1.128.7±1.441.7±0.479.7±0.573.3±0.5
MoPoE-VAE1.96±0.023.12±0.1043.7±0.238.7±0.247.8±0.282.5±0.375.0±0.2
XGBoost––36.4±0.963.4±0.370.9±0.577.4±0.571.5±0.4
Label-prop––42.0±0.865.4±0.174.6±0.175.9±0.570.3±0.4
HEALNet––49.2±0.450.4±0.462.1±0.487.8±0.181.2±0.2
ELPAC (ours)1.35±0.002.09±0.0150.1±0.466.9±1.368.5±1.486.4±0.278.9±0.5

Table 4. AD cohort benchmark: ELPAC leads generative fit, biomarker reconstruction, MMSE-aligned staging, and subtype Macro-F1, while label-consuming baselines lead diagnostic classification. Mean ± SE across 20 held-out splits.

MethodDeviceSyntheticReal
nnTime (s)nnTime (s)
SuStaIn [6]CPU1,000†3,089.28±49.677,501†29,707.17±951.63
DEBM [7]CPU1,000†7.21±0.157,501†55.34±6.60
Static-FA [27, 47]CPU1,000†0.78±0.067,501†14.18±1.14
MoPoE-VAE [22]CPU1,0006.30±0.207,5015.55±0.32
XGBoost [35]CPU∼1500.90±0.016411.20±0.06
Label-prop [36]CPU∼1500.03±0.00641102.91±0.91
HEALNet [23]CPU1,000258.11±5.547,501926.95±175.06
Diagonal covarianceGPU1,00060.77±0.567,501198.13±0.62
Static-factor covarianceGPU1,000114.66±0.647,501511.27±50.92
ELPAC (full)GPU1,000167.25±1.677,501384.61±1.39

Table 10. ELPAC fits the full multimodal cohort jointly within wall-clock budgets comparable to the joint-fusion baselines. Hardware, sample size, and per-fit wall-clock (seconds, mean±SE) over 100 synthetic replicates and 20 AD splits. nn is the total sample size (train+held-out). Supervised label-consuming baselines (XGBoost, Label-prop) operate on the labeled anchor partition, others on the full cohort. † SuStaIn, DEBM, and Static-FA are fit per biomarker on observed cells; reported nn is the cohort size, while the effective per-feature training set ranges from ∼1,000 (plasma) to ∼5,500 (sMRI) on the real cohort. MoPoE-VAE, HEALNet, and ELPAC variants are fit jointly on all modalities.

Hardware. ELPAC is fit on a single NVIDIA RTX Pro 6000 Blackwell GPU (48 GB VRAM), with 2 CPU cores and 6 GB host memory per task. CPU baselines run on shared partitions of mixed Intel Xeon and AMD EPYC nodes (64 to 128 cores per node, up to 2.3 TB RAM per node), with each task allocated 4 CPU cores and 16 GB RAM (XGBoost and Label-prop use 2 cores and 8 GB).

ELPAC fits the full 7,501-subject AD cohort in ∼385\sim385 s on a single GPU, ∼77×\sim77\times faster than SuStaIn and ∼2.4×\sim2.4\times faster than HEALNet, and returns a posterior over subtype, stage, trajectories, and stage-varying coordination. Two implementation choices keep the cost in this range: the structured low-rank guide of equation (17) makes the global-parameter cost linear in rg=10r_g=10, and the Sylvester–Woodbury reduction of equation (29) keeps each per-stage likelihood evaluation at O(RK2+K3)O(RK^2+K^3) regardless of the missingness pattern. The 187 s gap between the diagonal-covariance variant and ELPAC (full) buys the held-out NLL and masked reconstruction gains in Table 5.

Metric definitions

We define the non-standard metrics here. Standard ones (BAcc, Macro-F1, AUC, RMSE) follow conventional usage. NLL/cell is the held-out negative log-likelihood per observed coordinate, normalized by the average number of observed cells per subject for cross-model comparability. Masked NLL averages cross-modal predictive log-likelihood across four leave-one-modality-out rotations. Stage-score ρ\rho is the sign-aware Spearman correlation between the recovered stage scalar and the simulator stage, while ∣ρ∣|\rho| vs. MMSE uses the absolute value to be sign-agnostic across methods. Cog Pearson rr is the held-out Pearson correlation between observed cognition CcogC_{\mathrm{cog}} and a regression of CcogC_{\mathrm{cog}} on (S^i,onehot⁡(c^i))(\hat{S}_i,\operatorname{onehot}(\hat{c}_i)) fit on training anchors, with absolute-value variants reported when subtype-conditional sign conventions differ across methods. Stage-binned PPC is the cross-pair correlation between the model-implied pc(r,r′;s)p_c(r,r';s) and the empirical p^c(s)\hat{p}_c(s) binned over five stage bins. P%P\% PI coverage is the empirical fraction of held-out biomarker observations inside their nominal P%P\% posterior predictive interval. AUC paired bootstraps use 200 resamples, while all other paired-bootstrap CIs use 1,000.

Synthetic recovery: subtype trajectories and stage-varying coordination

Figure 5 probes the two parameter blocks targeted by Constructions I and II separately, against the simulator truth, on 100 replicate cohorts at N=1,000N=1,000. Construction I is summarized through the recovered subtype mean trajectory θc(s)\theta_c(s) on a representative biomarker per subtype (top row), and Construction II through the stage-varying activation νc(s)\nu_c(s) for the factors retained by the multiplicative-gamma prior (bottom row).

Figure 5. Subtype trajectories θc(s)\theta_c(s) and stage-varying activations νc(s)\nu_c(s) are recovered against simulator truth. Top row: representative θc(s)\theta_c(s), one biomarker per subtype, amplitude-normalized; truth dashed, ELPAC solid; shaded band is the across-replicate 95% CI of the mean over 100 replicates. Bottom row: νc(s)\nu_c(s) for the two factors retained by the multiplicative-gamma prior; per-factor color and marker; truth dashed, ELPAC solid; shaded interquartile range over 100 replicates.

ELPAC’s recovered subtype trajectories overlay the simulator truth across the full stage range (top row), and the across-replicate 95% CI on the posterior mean stays tight in the unsupervised middle region between the boundary anchors. The endpoint-anchored backward recursion equation (3) therefore propagates the boundary supervision inward and preserves amplitude at intermediate stages. The retained activation profiles νc(s)\nu_c(s) (bottom row) recover stage-localized peaks per subtype that match the simulator-truth dashed curves, and the multiplicative-gamma cascade shrinks the third loading column of AcA_c toward zero on every replicate. Construction I (mean trajectory) and Construction II (factor activations) are jointly recovered under the variational family of equation (17), matching the conditional identifiability claim of theorem 1.

Sensitivity analysis

Figure 6 and Figure 7 report the hyperparameter and sample-size sweeps that support the sensitivity claims in § 3.1. Each sweep is paired across replicate cohorts, so the reported standard errors absorb cohort-level variability and isolate the marginal effect of the hyperparameter under variation.

Figure 6 sweeps the factor rank KK, the activation-spline basis dimension PP, the trajectory shell count JJ, the activation-prior scale στ\sigma_\tau, the multiplicative-gamma cascade strength a2a_2, and the log-noise mean mDm_D one axis at a time around the canonical configuration. ELPAC’s held-out log-likelihood per subject stays inside the ±1.96\pm1.96 SE band of the canonical value on every panel, so the per-construction attribution in Table 3 and Table 5 is robust to the hyperparameter choice.

We have also validated on synthetic data that the coordination structure is not driven by the priors: the informative NIA-AA prior acts on the mean-trajectory onset centers alone and does not act directly on the coordination block, and relaxing the priors that shape it leaves the factorization essentially unchanged (Tucker congruence of matched loading columns ϕ=0.967\phi=0.967 across the a2a_2 and στ\sigma_\tau sweeps of Figure 6, against 0.29 between fits on different simulated cohorts under the same prior). It follows the data instead—there the model-implied stage-varying correlations track the empirically binned ones (Table 3), and qualitatively so on the real cohort (Figure 10c).

Subtype biomarker discriminability, endpoint pathology, and cross-modal correlation trajectories

Figure 10. Each subtype separates biomarkers along its dominant pathology channel. (a) Stage discriminability (Cohen’s dd, tertile contrast) by subtype and pathology block. (b) Endpoint pathology heatmap: NC-anchored θc(s=1)\theta_c(s=1) (±SE, 20 splits). (c) Two LOAD cross-modal correlation trajectories ρc(r,r′;s)\rho_c(r,r';s): model-implied curve vs. empirical-binned ρ^c(s)\hat{\rho}_c(s).

ELPAC’s four recovery metrics in Figure 7 (held-out log-likelihood, reconstruction RMSE, subtype BAcc, stage Spearman ρ\rho) are stable across N∈{1,000,2,000,5,000}N \in\{1{,}000, 2{,}000, 5{,}000\}, so the N=1,000N=1{,}000 numbers in Table 2 hold across the full sample-size range we test.

Robustness to anchor corruption

The monotonicity constraint applies to the latent group-mean trajectory, not to individual observations, which are noisy realizations of it, with subject-wise heterogeneity in the residual factor layer. A subject whose measurements stabilize or reverse is variation about the mean, not a constraint on its shape. On that mean, equation (6) fixes the sign of the shell-endpoint velocities, and so the direction of shell-to-shell progression, leaving magnitude free; the cubic Hermite interpolation retains limited freedom for between-shell overshoot. It also admits flat segments, all three within equation (6): the onset sigmoid holds a marker at rest before onset, the spline amplitude Fc,rF_{c,r} can fall arbitrarily close to zero over any stage range, and δc,r=0\delta_{c,r}=0 drops a marker outright—so temporary stabilization, plateaus and saturation all sit inside the family, as the biology of these markers requires. That direction is established for them [2] and is the inductive bias event-based staging relies on [5, 6]. Thus the only shape excluded is a sustained reversal of a group mean—which we inject deliberately below.

We corrupt anchor correctness at graded levels along four axes: subtype mislabeling, both uniform-random and under a clinical confusion scheme that concentrates errors on the EOAD/LOAD boundary where diagnostic ambiguity actually falls; the anchor’s true stage redrawn; an inverted group-mean direction; and a localized non-monotone bump. We refit at each level. Synthetic replicates run against known truth, and the mislabeling arms are mirrored on the real cohort (Table 11).

ScenarioDataMetricΔ\Delta 5%Δ\Delta 10%Δ\Delta 20%
Mislabel, clinical confusionSyntheticSubtype acc−0.2±0.1-0.2 \pm0.1−0.6±0.1-0.6 \pm0.1−1.3±0.1-1.3 \pm0.1
Mislabel, clinical confusionSyntheticStage ρ\rho−0.5±0.2-0.5 \pm0.2−1.0±0.2-1.0 \pm0.2−1.9±0.3-1.9 \pm0.3
Mislabel, clinical confusionRealSubtype BAcc−1.7±0.7-1.7 \pm0.7−4.2±1.2-4.2 \pm1.2−6.4±1.3-6.4 \pm1.3
Mislabel, clinical confusionRealMacro-F1+1.8±1.5+1.8 \pm1.5+1.0±2.5+1.0 \pm2.5+0.6±2.8+0.6 \pm2.8
Mislabel, clinical confusionRealHeld-out LL−0.02±0.01-0.02 \pm0.01−0.02±0.01-0.02 \pm0.01−0.05±0.02-0.05 \pm0.02
Mislabel, uniform-randomSyntheticSubtype acc−0.1±0.1-0.1 \pm0.1−0.6±0.2-0.6 \pm0.2−3.4±0.6-3.4 \pm0.6
Mislabel, uniform-randomSyntheticStage ρ\rho−0.7±0.2-0.7 \pm0.2−1.7±0.2-1.7 \pm0.2−5.7±0.4-5.7 \pm0.4
Mislabel, uniform-randomRealSubtype BAcc−2.2±0.8-2.2 \pm0.8−5.1±1.0-5.1 \pm1.0−7.0±1.2-7.0 \pm1.2
Mislabel, uniform-randomRealMacro-F1−0.8±1.4-0.8 \pm1.4−0.8±1.9-0.8 \pm1.9+1.3±2.5+1.3 \pm2.5
Mislabel, uniform-randomRealHeld-out LL−0.02±0.02-0.02 \pm0.02−0.06±0.02-0.06 \pm0.02−0.09±0.02-0.09 \pm0.02
Stage redrawn U(0,1)U(0, 1)SyntheticStage ρ\rho−2.2±0.2-2.2 \pm0.2−2.9±0.3-2.9 \pm0.3−3.3±0.3-3.3 \pm0.3
Stage redrawn U(0,1)U(0, 1)SyntheticSubtype acc+0.0±0.1+0.0 \pm0.1−0.0±0.1-0.0 \pm0.1−0.0±0.1-0.0 \pm0.1
Inverted group-mean directionSyntheticStage ρ\rho−0.2±0.1-0.2 \pm0.1−0.6±0.2-0.6 \pm0.2−1.3±0.3-1.3 \pm0.3
Inverted group-mean directionSyntheticSubtype acc−0.0±0.1-0.0 \pm0.1−0.1±0.2-0.1 \pm0.2−1.3±0.5-1.3 \pm0.5
Localized non-monotone bumpSyntheticStage ρ\rho−0.0±0.1-0.0 \pm0.1−0.0±0.1-0.0 \pm0.1−0.0±0.1-0.0 \pm0.1
Localized non-monotone bumpSyntheticSubtype acc−0.0±0.0-0.0 \pm0.0−0.0±0.1-0.0 \pm0.1−0.1±0.1-0.1 \pm0.1

Table 11. Paired change from clean anchors (pp, or nats/subject for LL; mean±\pmSE). Real-cohort changes are paired against each split’s own clean-anchor refit.

Across the four targeted corruptions, ELPAC retains stage ordering and subtype separation. Anchor mislabeling degrades subtype and stage recovery smoothly as the labels get noisier, with clinical confusion the gentler of the two arms at 20%; the stage redraw affects staging while leaving subtype recovery unchanged; and the two mean-shape perturbations have the smallest stage-ordering effects—inverting a marker’s direction is milder in stage ordering than any mislabeling, and a localized non-monotone bump produces no detectable loss in stage ordering. The losses are also small: on the real cohort, held-out likelihood stays well inside the 0.84-nat full-vs-static-factor margin of Table 5, and Macro-F1 shows no monotone degradation.

Test-time refinement

Subject-specific refinement is a drop-in extension of the amortized inference path of equations (17) to (21). The mechanism is the local-refinement step of semi-amortized inference [48, 49]: with the fitted globals frozen at their posterior medians, each subject’s subtype-conditional stage posteriors are warm-started from the encoder pass and optimized on that subject’s own data—no labels, no retraining, no global update. Subtype remains exactly enumerated; during refinement its posterior is computed from the per-subtype terms of the local bound, which approach equation (20) as those stage posteriors sharpen; the factor scores remain analytically integrated. The local objective is a variational lower bound on that subject’s evidence under the same frozen globals and G=19G=19 grid. The step ladder T∈{1,2,5,10,20,50}T \in\{1, 2, 5, 10, 20, 50\} (Adam steps) and learning rate 0.05 were fixed in advance.

Across the tested budgets the per-subject objective improves and stage ρ\rho rises above the encoder pass (Table 12); the gain at T=50T=50 holds in every synthetic replicate and persists when results are averaged over 20 global-posterior draws. Subtype inference stays stable, matching the frozen-global exact-grid reference on synthetic data and approaching it from below on the real cohort. The measured gain is therefore in staging, with subtype inference stable, giving an optional per-patient accuracy-for-compute tradeoff.

TT Adam steps125102050
Synthetic (100 replicates)+0.5%+1.0%+2.5%+4.7%+8.3%+13.0±0.5%
Real cohort (20 splits)+1.6%+2.9%+7.1%+10.9%+13.1%+13.6±2.7%

Table 12. Per-subject refinement sharpens held-out staging at every step budget. Relative change vs. the single encoder pass (T=0T=0), globals at their posterior medians; mean over replicates (synthetic) or splits (real), ±SE at T=50T=50. Synthetic: stage ρ\rho against the true stage; real: ∣ρ∣|\rho| of the path-aggregated severity score GpathG^{\mathrm{path}} (section E.2) against MMSE on all refined held-out subjects.

Real-data validation and biology

Leave-one-cohort-out validation

Figure 8 compares the pooled fit with leave-ADNI (train on NACC, evaluate on ADNI) and leave-NACC (train on ADNI, evaluate on NACC). ADNI and NACC differ in scanner pool, plasma availability (58% vs. 0%, Table 9), and recruitment composition, so the leave-one-cohort folds test cross-source transfer of the constructions.

Figure 8. Stage and subtype recovery transfer across cohorts. Leave-one-cohort-out validation. (a) Fit error (NLL/cell, RMSE). (b) Stage quality (∣ρ∣|\rho| vs. MMSE, AUC of GpathG^{\mathrm{path}} vs. diagnosis). (c) Subtype recovery (BAcc, Macro-F1). Lines connect pooled, leave-ADNI, and leave-NACC folds; bands are ±1.96 SE over 20 splits.

The stage-quality and subtype-recovery panels (Figure 8b,Figure 8c) overlap across the three folds within their ±1.96 SE bands, so the anchored stage axis and its subtype mapping transfer across acquisition sources. The small NLL/RMSE increase under leave-NACC (panel a) tracks the smaller ADNI-only training pool (∼1.7k vs. ∼5.8k subjects) and does not propagate into the stage-quality or subtype-recovery panels.

Figure 9. The recovered stage tracks longitudinal progression and predicts MCI→AD conversion at the top of the external-baseline set. (a) Annual stage advance per subtype. (b) Held-out cognition correlation across the Table 4 comparison set. (c) Three-year MCI→AD conversion AUC across the same set. ELPAC highlighted, with bars at ±1.96 SE.

Longitudinal validation: stage velocity, cognition, and MCI conversion

Fig. 9 reports three longitudinal probes of the cross-sectional stage axis on subjects with follow-up visits: per-subject annual stage advance by subtype (panel a), held-out cognition correlation across the Table 4 comparison set (panel b), and three-year MCI-to-AD conversion AUC on the same set (panel c). Panels a and c target signals absent from the training likelihood, so they read out longitudinal behavior of the recovered stage axis. The annual stage advance orders the subtypes EOAD>LOAD>HA along a temporal axis unobserved at training, matching the clinical expectation that early-onset disease progresses fastest and healthy aging is approximately stable [2]. ELPAC leads panel b, so the inferred stage is the strongest single predictor of cognition among the methods evaluated. The path-aggregated severity score GipathG_i^{\mathrm{path}}, defined as the integrated mean-trajectory pathology up to subject ii’s posterior stage, leads panel c, ranking short-horizon conversion risk on subjects unseen at training.

Subtype biology and coordination programs

Fig. 10 reports three biological summaries of the recovered subtype structure. The discriminability heatmap (panel a) localizes the largest effect sizes to the tau pathology block in EOAD, structural atrophy in LOAD, and structural-only signal in HA, mirroring the modality-direction pattern in Figure 3. The endpoint pathology heatmap (panel b) shows HA at the healthy reference on amyloid while EOAD and LOAD reach pathological endpoints on every modality, so the inferred trajectories terminate at the biologically expected magnitudes per subtype.

Panel c overlays the model-implied stage-dependent correlation ρc(r,r′;s)\rho_c(r,r';s) from equation (30) on the empirical-binned ρ^c(s)\hat{\rho}_c(s) for two representative LOAD biomarker pairs, and the two curves track each other across the inferred stage axis on both pairs. The fit captures the stage shape, not only the stage-marginal value, consistent with the stage-binned PPC ablation gain in Table 3.

Per-factor multimodal mixture (cross-modal coupling). Figure 11 resolves the residual coordination structure into per-factor variance shares and modality decompositions of loading energy, addressing which biomarkers couple in each subtype, and when each coalition strengthens or attenuates. EOAD engages a three-way amyloid, tau, and structural coalition (across-modality) with mid-stage peak. LOAD instead exhibits an amyloid-dominant leading factor (within-modality) that peaks earlier on the stage axis, with a smaller late-emerging tau-dominant factor (within-modality), consistent with the sequential amyloid-then-tau cascade reported in late-onset disease. HA is omitted: its leading factors are atrophy-dominant within-modality axes (section 3.2) carrying no pathology-discriminative signal, as expected for an amyloid-negative endpoint.

Stage-varying Fisher modality weights. A complementary view targets which modality is most informative about stage at a given stage, derived from the mean-trajectory derivative θc′(s)\theta'_c(s) and the inverse covariance (equations (31) and (32)). Fig. 12 plots the per-subtype Fisher modality weights wc,mFI(sc)w^{\mathrm{FI}}_{c,m}(s_c) on the 5-modality split (plasma AβA\beta ratio and p-tau181 separated). In EOAD, tau-PET and structural MRI jointly carry the bulk of the stage information across mid-to-late stage, indicating that tau and structural readouts are the most informative modalities in early-onset disease. In LOAD, plasma p-tau181 reaches a mid-stage informativeness peak before tau-PET takes over near the endpoint, consistent with reports that plasma p-tau leads PET-detectable tau in amyloid-positive individuals [50], so plasma readouts are the most stage-informative biomarkers earlier in late-onset disease. In HA, structural MRI dominates throughout, indicating that healthy aging is a structural-only progression direction without informative amyloid or tau signal.

NeurIPS Paper Checklist

  1. Claims

Question: Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?

Answer: [Yes]

Justification: The abstract and the three numbered contributions in § 1 (asymmetric endpoint supervision, conditional identifiability of stage-varying coordination, validation on synthetic and harmonized AD cohorts) match the experimental claims of § 3.1 and § 3.2 and the conditional-identifiability claim of Theorem 1 in § 2.5.

Guidelines:

  • The answer [N/A] means that the abstract and introduction do not include the claims made in the paper.

  • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations. A [No] or [N/A] answer to this question will not be perceived well by the reviewers.

  • The claims made should match theoretical and experimental results, and reflect how much the results can be expected to generalize to other settings.

  • It is fine to include aspirational goals as motivation as long as it is clear that these goals are not attained by the paper.

  1. Limitations

Question: Does the paper discuss the limitations of the work performed by the authors?

Answer: [Yes]

Justification: §4 Discussion contains an explicit Limitations paragraph covering four items: the stage axis is pseudo-temporal, so the coordination factors describe co-variation along it rather than mechanism; the Gaussian dependency layer captures only second-order coordination; the full-model identifiability proposition (section C.4) is conditional on a Gaussian mixing-family hypothesis; and variational inference is an approximation to the true posterior. Each of the last three is paired with a natural extension path.

Guidelines:

  • The answer [N/A] means that the paper has no limitation while the answer [No] means that the paper has limitations, but those are not discussed in the paper.

  • The authors are encouraged to create a separate “Limitations” section in their paper.

  • The paper should point out any strong assumptions and how robust the results are to violations of these assumptions (e.g., independence assumptions, noiseless settings, model well-specification, asymptotic approximations only holding locally). The authors should reflect on how these assumptions might be violated in practice and what the implications would be.

  • The authors should reflect on the scope of the claims made, e.g., if the approach was only tested on a few datasets or with a few runs. In general, empirical results often depend on implicit assumptions, which should be articulated.

  • The authors should reflect on the factors that influence the performance of the approach. For example, a facial recognition algorithm may perform poorly when image resolution is low or images are taken in low lighting. Or a speech-to-text system might not be used reliably to provide closed captions for online lectures because it fails to handle technical jargon.

  • The authors should discuss the computational efficiency of the proposed algorithms and how they scale with dataset size.

  • If applicable, the authors should discuss possible limitations of their approach to address problems of privacy and fairness.

  • While the authors might fear that complete honesty about limitations might be used by reviewers as grounds for rejection, a worse outcome might be that reviewers discover limitations that aren’t acknowledged in the paper. The authors should use their best

judgment and recognize that individual actions in favor of transparency play an important role in developing norms that preserve the integrity of the community. Reviewers will be specifically instructed to not penalize honesty concerning limitations.

Theory assumptions and proofs

Question: For each theoretical result, does the paper provide the full set of assumptions and a complete (and correct) proof?

Answer: [Yes]

Justification: Theorem 1 is stated in § 2.5 with conditions and a four-step proof sketch; the full proof appears in section C.2. Proposition 1 (full-model identifiability) is stated and proved in section C.4. All theorems are numbered and cross-referenced, and rely on properly cited prior results (Anderson–Rubin [27], Geweke [30], multiplicative-gamma cascade [28, 29]).

Guidelines:

  • The answer [N/A] means that the paper does not include theoretical results.

  • All theorems, formulas, and proofs in the paper should be numbered and cross-referenced.

  • All assumptions should be clearly stated or referenced in the statement of any theorems.

  • The proofs can either appear in the main paper or the supplemental material, but if they appear in the supplemental material, the authors are encouraged to provide a short proof sketch to provide intuition.

  • Inversely, any informal proof provided in the core of the paper should be complemented by formal proofs provided in appendix or supplemental material.

  • Theorems and Lemmas that the proof relies upon should be properly referenced.

Experimental result reproducibility

Question: Does the paper fully disclose all the information needed to reproduce the main experimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and data are provided or not)?

Answer: [Yes]

Justification: section B documents the full joint likelihood, ELBO, encoder architecture, two-phase optimizer schedule, Concrete relaxation of the region-inclusion gates, Sylvester–Woodbury closed forms, and test-time inference details. section D documents the cohort, informative priors, baseline configurations, runtime, and metric definitions; algorithm 1 provides pseudocode.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • If the paper includes experiments, a [No] answer to this question will not be perceived well by the reviewers: Making the paper reproducible is important, regardless of whether the code and data are provided or not.

  • If the contribution is a dataset and/or model, the authors should describe the steps taken to make their results reproducible or verifiable.

  • Depending on the contribution, reproducibility can be accomplished in various ways. For example, if the contribution is a novel architecture, describing the architecture fully might suffice, or if the contribution is a specific model and empirical evaluation, it may be necessary to either make it possible for others to replicate the model with the same dataset, or provide access to the model. In general, releasing code and data is often one good way to accomplish this, but reproducibility can also be provided via detailed instructions for how to replicate the results, access to a hosted model (e.g., in the case of a large language model), releasing of a model checkpoint, or other means that are appropriate to the research performed.

  • While NeurIPS does not require releasing code, the conference does require all submissions to provide some reasonable avenue for reproducibility, which may depend on the nature of the contribution. For example (a) If the contribution is primarily a new algorithm, the paper should make it clear how to reproduce that algorithm.

(b) If the contribution is primarily a new model architecture, the paper should describe the architecture clearly and fully.

(c) If the contribution is a new model (e.g., a large language model), then there should either be a way to access this model for reproducing the results or a way to reproduce the model (e.g., with an open-source dataset or instructions for how to construct the dataset).

(d) We recognize that reproducibility may be tricky in some cases, in which case authors are welcome to describe the particular way they provide for reproducibility. In the case of closed-source models, it may be that access to the model is limited in some way (e.g., to registered users), but it should be possible for other researchers to have some path to reproducing or verifying the results.

Open access to data and code

Question: Does the paper provide open access to the data and code, with sufficient instructions to faithfully reproduce the main experimental results, as described in supplemental material?

Answer: [Yes]

Justification: Code is available at https://github.com/Naomi-Ding/ELPAC, with a self-contained synthetic-experiment reproduction (single command, ∼\sim4 min on CPU per seed) covering the headline recovery metrics in Table 2 and Table 3. ADNI and NACC require institutional data-access agreements (NIH/NACC policy) and cannot be redistributed by the authors; researchers may apply directly through ADNI and NACC.

Guidelines:

  • The answer [N/A] means that paper does not include experiments requiring code.

  • Please see the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • While we encourage the release of code and data, we understand that this might not be possible, so [No] is an acceptable answer. Papers cannot be rejected simply for not including code, unless this is central to the contribution (e.g., for a new open-source benchmark).

  • The instructions should contain the exact command and environment needed to run to reproduce the results. See the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • The authors should provide instructions on data access and preparation, including how to access the raw data, preprocessed data, intermediate data, and generated data, etc.

  • The authors should provide scripts to reproduce all experimental results for the new proposed method and baselines. If only a subset of experiments are reproducible, they should state which ones are omitted from the script and why.

  • At submission time, to preserve anonymity, the authors should release anonymized versions (if applicable).

  • Providing as much information as possible in supplemental material (appended to the paper) is recommended, but including URLs to data and code is permitted.

Experimental setting/details

Question: Does the paper specify all the training and test details (e.g., data splits, hyperparameters, how they were chosen, type of optimizer) necessary to understand the results?

Answer: [Yes]

Justification: §3.1 specifies the synthetic-cohort composition (10% anchors per subtype, 10% healthy controls, 60% unlabeled), 100 paired replicates at three sample sizes, and stratified 80/20 splits. §3.2 specifies the harmonized AD cohort, 20 stratified 80/20 splits, and the stratification criterion. section B.2 details the optimizer (Adam with two-phase learning-rate schedule, gradient clipping, minibatch size), and section D.2 details the AD-specific informative priors.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them.

  • The full details can be provided either with the code, in appendix, or as supplemental material.

Experiment statistical significance

Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments?

Answer: [Yes]

Justification: The main result tables (Table 2 to Table 5 and Table 10) and figures report mean ±\pm standard error of the mean, with variability source stated: 100 paired synthetic replicates or 20 AD train/test splits. Paired-bootstrap confidence intervals use 1,000 resamples (200 for AUC); see section D.4.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The authors should answer [Yes] if the results are accompanied by error bars, confidence intervals, or statistical significance tests, at least for the experiments that support the main claims of the paper.

  • The factors of variability that the error bars are capturing should be clearly stated (for example, train/test split, initialization, random drawing of some parameter, or overall run with given experimental conditions).

  • The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.)

  • The assumptions made should be given (e.g., Normally distributed errors).

  • It should be clear whether the error bar is the standard deviation or the standard error of the mean.

  • It is OK to report 1-sigma error bars, but one should state it. The authors should preferably report a 2-sigma error bar than state that they have a 96% CI, if the hypothesis of Normality of errors is not verified.

  • For asymmetric distributions, the authors should be careful not to show in tables or figures symmetric error bars that would yield results that are out of range (e.g., negative error rates).

  • If error bars are reported in tables or plots, the authors should explain in the text how they were calculated and reference the corresponding figures or tables in the text.

Experiments compute resources

Question: For each experiment, does the paper provide sufficient information on the computer resources (type of compute workers, memory, time of execution) needed to reproduce the experiments?

Answer: [Yes]

Justification: section D.3 reports per-fit wall-clock for ELPAC and all baselines (Table 10); ELPAC is fit on a single NVIDIA RTX Pro 6000 GPU (48 GB VRAM), and CPU baselines run on shared partitions specified in the same section. The per-likelihood-evaluation complexity O(RK2+K3)O(RK^2+K^3) is stated in §2.5 and section B.3.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage.

  • The paper should provide the amount of compute required for each of the individual experimental runs as well as estimate the total compute.

  • The paper should disclose whether the full research project required more compute than the experiments reported in the paper (e.g., preliminary or failed experiments that didn’t make it into the paper).

Code of ethics

Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines?

Answer: [Yes]

Justification: All human-subject data are pre-existing harmonized cohorts (ADNI [37], NACC [38]) governed by the source institutions’ IRB/REB approvals; no new human-subject collection or crowdsourcing in this work.

Guidelines:

  • The answer [N/A] means that the authors have not reviewed the NeurIPS Code of Ethics.

  • If the authors answer [No], they should explain the special circumstances that require a deviation from the Code of Ethics.

  • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction).

Broader impacts

Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?

Answer: [Yes]

Justification: ELPAC is a research tool for cohort-scale neurodegeneration analysis: the recovered stage axis is intended for population-level statistics (drug-trial enrichment, biomarker-coalition discovery), does not produce individual clinical recommendations, and clinical deployment would require prospective validation. The model neither generates nor releases identifiable individual data and poses no obvious dual-use risk.

Guidelines:

  • The answer [N/A] means that there is no societal impact of the work performed.

  • If the authors answer [N/A] or [No], they should explain why their work has no societal impact or why the paper does not address societal impact.

  • Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations.

  • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate Deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster.

  • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology.

  • If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML).

Safeguards

Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pre-trained language models, image generators, or scraped datasets)?

Answer: [N/A]

Justification: ELPAC releases neither a generative model with misuse risk nor scraped data; the underlying ADNI/NACC data are governed by their existing access policies.

Guidelines:

  • The answer [N/A] means that the paper poses no such risks.

  • Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters.

  • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images.

  • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.

Licenses for existing assets

Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?

Answer: [Yes]

Justification: ADNI [37], NACC [38], SCAN [39], and all baseline methods (SuStaIn [6], DEBM [7], Static-FA [27, 47], MoPoE-VAE [22], HEALNet [23], XGBoost [35], label propagation [36], ComBat [46]) are cited at first use in §3 and section D. The inference framework NumPyro [40] is Apache 2.0; cohort access follows ADNI/NACC data-use agreements.

Guidelines:

  • The answer [N/A] means that the paper does not use existing assets.

  • The authors should cite the original paper that produced the code package or dataset.

  • The authors should state which version of the asset is used and, if possible, include a URL.

  • The name of the license (e.g., CC-BY 4.0) should be included for each asset.

  • For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided.

  • If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset.

  • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided.

  • If this information is not available online, the authors are encouraged to reach out to the asset’s creators.

New assets

Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets?

Answer: [Yes]

Justification: The paper releases the ELPAC reference implementation as a package at https://github.com/Naomi-Ding/ELPAC, accompanied by a README (setup instructions, run command, expected outputs, paper-section-to-module mapping), an environment.yaml conda specification with pinned versions, and the per-seed reproduction script. The package is released under the MIT license (see LICENSE). No new datasets are released; ELPAC consumes pre-existing harmonized cohort data.

Guidelines:

  • The answer [N/A] means that the paper does not release new assets.

  • Researchers should communicate the details of the dataset/code/model as part of their submissions via structured templates. This includes details about training, license, limitations, etc.

  • The paper should discuss whether and how consent was obtained from people whose asset is used.

  • At submission time, remember to anonymize your assets (if applicable). You can either create an anonymized URL or include an anonymized zip file.

14. Crowdsourcing and research with human subjects

Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)?

Answer: [N/A]

Justification: This work uses pre-existing harmonized cohort data (ADNI, NACC); no crowdsourcing or new human-subject collection was conducted.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Including this information in the supplemental material is fine, but if the main contribution of the paper involves human subjects, then as much detail as possible should be included in the main paper.

  • According to the NeurIPS Code of Ethics, workers involved in data collection, curation, or other labor should be paid at least the minimum wage in the country of the data collector.

15. Institutional review board (IRB) approvals or equivalent for research with human subjects

Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals (or an equivalent approval/review based on the requirements of your country or institution) were obtained?

Answer: [N/A]

Justification: This work uses pre-existing harmonized cohort data; original IRB/REB approvals are held at the contributing ADNI and NACC sites, predating this work.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research. If you obtained IRB approval, you should clearly state this in the paper.

  • We recognize that the procedures for this may vary significantly between institutions and locations, and we expect authors to adhere to the NeurIPS Code of Ethics and the guidelines for their institution.

  • For initial submissions, do not include any information that would break anonymity (if applicable), such as the institution conducting the review.

16. Declaration of LLM usage

Question: Does the paper describe the usage of LLMs if it is an important, original, or non-standard component of the core methods in this research? Note that if the LLM is used only for writing, editing, or formatting purposes and does not impact the core methodology, scientific rigor, or originality of the research, declaration is not required.

Answer: [N/A]

Justification: The core methodology contains no LLM components; ELPAC is a Bayesian variational-inference model implemented in NumPyro/JAX.

Guidelines:

  • The answer [N/A] means that the core method development in this research does not involve LLMs as any important, original, or non-standard components.

  • Please refer to our LLM policy in the NeurIPS handbook for what should or should not be described.

References

  1. [1]Alexandra L. Young, Neil P. Oxtoby, Sara Garbarino, Nick C. Fox, Frederik Barkhof, Jonathan M. Schott, and Daniel C. Alexander. Data-driven modelling of neurodegenerative disease progression: thinking outside the black box. Nature Reviews Neuroscience, 25(2):111–130, 2024. ISSN 1471-003X.
  2. [2]Jr. Jack, Clifford R., J. Scott Andrews, Thomas G. Beach, Teresa Buracchio, Billy Dunn, Ana Graf, Oskar Hansson, Carole Ho, William Jagust, Eric McDade, José Luis Molinuevo, Ozioma C. Okonkwo, Luca Pani, Michael S. Rafii, Philip Scheltens, Eric Siemers, Heathen M. Snyder, Reisa Sperling, Charlotte E. Teunissen, and Maria C. Carrillo. Revised criteria for diagnosis and staging of Alzheimer’s disease: Alzheimer’s association workgroup. Alzheimer’s & Dementia, 20(8):5143–5169, 2024. ISSN 1552-5260.
  3. [3]Gemma Salvadó, Kanta Horie, Nicolas R. Barthélemy, Jacob W. Vogel, Alexa Pichet Binette, Charles D. Chen, Andrew J. Aschenbrenner, Brian A. Gordon, Tammie L. S. Benzinger, David M. Holtzman, John C. Morris, Sebastian Palmqvist, Erik Stomrud, Shorena Janelidze, Rik Ossenkoppele, Suzanne E. Schindler, Randall J. Bateman, and Oskar Hansson. Disease staging of Alzheimer’s disease using a CSF-based biomarker model. Nature Aging, 4(5):694–708, 2024. ISSN 2662-8465.DOI
  4. [4]Sebastian Palmqvist, Noëlle Warmenhoven, Federica Anastasi, Andrea Pilotto, Shorena Janelidze, Pontus Tidemann, Erik Stomrud, Niklas Mattsson-Carlgren, Ruben Smith, Rik Ossenkoppele, Kübra Tan, Anna Dittrich, Ingmar Skoog, Henrik Zetterberg, Virginia Quaresima, Chiara Tolassi, Kina Höglund, Duilio Brugnoni, Albert Puig-Pijoan, Aida Fernández-Lebrero, José Contador, Alessandro Padovani, Mark Monane, Philip B. Verghese, Joel B. Braunstein, Silke Kern, Kaj Blennow, Nicholas J. Ashton, Marc Suárez-Calvet, and Oskar Hansson. Plasma phospho-tau217 for Alzheimer’s disease diagnosis in primary and secondary care using a fully automated platform. Nature Medicine, 31(6):2036–2043, 2025. ISSN 1078-8956.DOI
  5. [5]Hubert M. Fonteijn, Marc Modat, Matthew J. Clarkson, Josephine Barnes, Manja Lehmann, Nicola Z. Hobbs, Rachael I. Scahill, Sarah J. Tabrizi, Sebastien Ourselin, Nick C. Fox, and Daniel C. Alexander. An event-based model for disease progression and its application in familial Alzheimer’s disease and Huntington’s disease. NeuroImage, 60(3):1880–1889, 2012. ISSN 1053-8119.DOI
  6. [6]Alexandra L. Young, Razvan V. Marinescu, Neil P. Oxtoby, Martina Bocchetta, Keir Yong, Nicholas C. Firth, David M. Cash, David L. Thomas, Katrina M. Dick, Jorge Cardoso, John van Swieten, Barbara Borroni, Daniela Galimberti, Mario Masellis, Maria Carmela Tartaglia, James B. Rowe, Caroline Graff, Fabrizio Tagliavini, Giovanni B. Frisoni, Robert Laforce, Jr., Elizabeth Finger, Alexandre de Mendonça, Sandro Sorbi, Jason D. Warren, The Genetic FTD Initiative (GENFI), and The Alzheimer’s Disease Neuroimaging Initiative (ADNI). Uncovering the heterogeneity and temporal complexity of neurodegenerative diseases with subtype and stage inference. Nature Communications, 9(1):4273, 2018. ISSN 2041-1723.
  7. [7]Vikram Venkat raghavan, Esther E. Bron, Wiro J. Niessen, and Stefan Klein. Disease progression timeline estimation for Alzheimer’s disease using discriminative event based modeling. NeuroImage, 186:518–532, 2019. ISSN 1053-8119.arxiv.org/abs/1808.03604
  8. [8]Peter A. Wijeratne and Daniel C. Alexander. Unscrambling disease progression at scale: fast inference of event permutations with optimal transport. In Advances in Neural Information Processing Systems 37, pages 63316–63341. Neural Information Processing Systems Foundation, 2024.arxiv.org/abs/2410.14388
  9. [9]Igor Koval, Alexandre Bône, Maxime Louis, Thomas Lartigue, Simona Bottani, Arnaud Marcoux, Jorge Samper-González, Ninon Burgos, Benjamin Charlier, Anne Bertrand, Stéphane Epelbaum, Olivier Colliot, Stéphanie Allassonnière, and Stanley Durrleman. AD Course Map charts Alzheimer’s disease progression. Scientific Reports, 11(1):8020, 2021. ISSN 2045-2322.DOI
  10. [10]Jean-Baptiste Schiratti, Stéphanie Allassonnière, Olivier Colliot, and Stanley Durrleman. A Bayesian mixed-effects model to learn trajectories of changes from repeated manifold-valued observations. Journal of Machine Learning Research, 18(133):1–33, 2017.
  11. [11]Jérémie Lespinasse, Carole Dufouil, and Cécile Proust-Lima. Disease progression model anchored around clinical diagnosis in longitudinal cohorts: example of Alzheimer’s disease and related dementia. BMC Medical Research Methodology, 23(1):199, 2023. ISSN 1471-2288.
  12. [12]Alessandro Viani, Anna Custo, Emile d’Angremont, Valentina Garibotto, Giovanni B. Frisoni, Boris A. Gutman, and Marco Lorenzi. Disease progression modeling and stratification for detecting sub-trajectories in the natural history of pathologies: Application to Alzheimer’s disease trajectory modeling. Imaging Neuroscience, 3:IMAG.a.954, 2025. ISSN 2837-6056.DOI
  13. [13]Xi Zhang, Yuan Pu, Yuki Kawamura, Andrew Loza, Yoshua Bengio, Dennis L. Shung, and Alexander Tong. Trajectory flow matching with applications to clinical time series modelling. In Advances in Neural Information Processing Systems 37, pages 107198–107224. Neural Information Processing Systems Foundation, 2024.
  14. [14]Chen Liu, Wenfang Yao, Kejing Yin, William K. Cheung, and Jing Qin. Multimodal disease progression modeling via spatio-temporal disentanglement and multiscale alignment. In Advances in Neural Information Processing Systems 38. Neural Information Processing Systems Foundation, 2025.DOI
  15. [15]Andrew Gordon Wilson and Zoubin Ghahramani. Generalised Wishart processes. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, pages 736–744. AUAI Press, 2011.arxiv.org/abs/1101.0240
  16. [16]Peter D. Hoff and Xiaoyue Niu. A covariance regression model. Statistica Sinica, 22(2):729–753, 2012. ISSN 1017-0405.arxiv.org/abs/1102.5721
  17. [17]Amin Nejatbakhsh, Isabel Garon, and Alex H. Williams. Estimating noise correlations across continuous conditions with Wishart processes. In Advances in Neural Information Processing Systems 36, pages 54032–54045. Neural Information Processing Systems Foundation, 2023.arxiv.org/abs/2308.11824
  18. [18]Danni Tu, Bridget Mahony, Tyler M. Moore, Maxwell A. Bertolero, Aaron F. Alexander-Bloch, Ruben Gur, Dani S. Bassett, Theodore D. Satterthwaite, Armin Raznahan, and Russell T. Shinohara. CoCoA: conditional correlation models with association size. Biostatistics, 25(1):154–170, 2024. ISSN 1465-4644.
  19. [19]Richard J. Chen, Ming Y. Lu, Wei-Hung Weng, Tiffany Y. Chen, Drew F. K. Williamson, Trevor Manz, Maha Shady, and Faisal Mahmood. Multimodal co-attention transformer for survival prediction in gigapixel whole slide images. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 4015–4025. IEEE, 2021.DOI
  20. [20]Richard J. Chen, Ming Y. Lu, Jingwen Wang, Drew F. K. Williamson, Scott J. Rodig, Neal I. Lindeman, and Faisal Mahmood. Pathomic fusion: An integrated framework for fusing histopathology and genomic features for cancer diagnosis and prognosis. IEEE Transactions on Medical Imaging, 41(4):757–770, 2022. ISSN 0278-0062.
  21. [21]Mike Wu and Noah D. Goodman. Multimodal generative models for scalable weakly-supervised learning. In Advances in Neural Information Processing Systems 31, 2018.
  22. [22]Thomas M. Sutter, Imant Daunhawer, and Julia E. Vogt. Generalized multimodal ELBO. In International Conference on Learning Representations (ICLR), 2021.arxiv.org/abs/2105.02470
  23. [23]Konstantin Hemker, Nikola Simidjievski, and Mateja Jamnik. HEALNet: Multimodal fusion for heterogeneous biomedical data. In Advances in Neural Information Processing Systems 37, pages 64479–64498. Neural Information Processing Systems Foundation, 2024.
  24. [24]Aapo Hyvärinen and Hiroshi Morioka. Unsupervised feature extraction by time-contrastive learning and nonlinear ica. In Advances in Neural Information Processing Systems, volume 29, 2016.arxiv.org/abs/1605.06336
  25. [25]Yujia Zheng and Kun Zhang. Generalizing nonlinear ICA beyond structural sparsity. In Advances in Neural Information Processing Systems 36, pages 13326–13355. Neural Information Processing Systems Foundation, 2023.arxiv.org/abs/2311.00866
  26. [26]Julius von Kügelgen, Michel Beserve, Liang Wendong, Luigi Gresele, Armin Kekić, Elias Bareinboim, David M. Blei, and Bernhard Schölkopf. Nonparametric identifiability of causal representations from unknown interventions. In Advances in Neural Information Processing Systems 36, pages 48603–48638. Neural Information Processing Systems Foundation, 2023.arxiv.org/abs/2306.00542
  27. [27]Theodore W. Anderson and Herman Rubin. Statistical inference in factor analysis. In Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, volume 5, pages 111–150. University of California Press, 1956.
  28. [28]Anirban Bhattacharya and David B. Dunson. Sparse Bayesian infinite factor models. Biometrika, 98(2):291–306, 2011. ISSN 0006-3444.pubmed.ncbi.nlm.nih.gov/23049129
  29. [29]Debdeep Pati, Anirban Bhattacharya, Natesh S. Pillai, and David B. Dunson. Posterior contraction in sparse Bayesian factor models for massive covariance matrices. The Annals of Statistics, 42(3):1102–1130, 2014. ISSN 0090-5364.
  30. [30]John Geweke and Guofu Zhou. Measuring the pricing error of the arbitrage pricing theory. Review of Financial Studies, 9(2):557–587, 1996. ISSN 0893-9454.
  31. [31]Diederik P. Kingma and Max Welling. Auto-encoding variational Bayes. In International Conference on Learning Representations (ICLR), 2014.arxiv.org/abs/1312.6114
  32. [32]Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. Stochastic backpropagation and approximate inference in deep generative models. In International Conference on Machine Learning (ICML), 2014.arxiv.org/abs/1401.4082
  33. [33]Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In International Conference on Learning Representations (ICLR), 2015.arxiv.org/abs/1412.6980
  34. [34]Harold V. Henderson and Shayle R. Searle. On deriving the inverse of a sum of matrices. SIAM Review, 23(1):53–60, 1981. ISSN 0036-1445.DOI
  35. [35]Tianqi Chen and Carlos Guestrin. XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 785–794. ACM, 2016.DOI
  36. [36]Xiaojin Zhu and Zoubin Ghahramani. Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University, 2002.
  37. [37]Michael W. Weiner, Shaveta Kanoria, Melanie J. Miller, Paul S. Aisen, Laurel A. Beckett, Catherine Conti, Adam Diaz, Derek Flenmiken, Robert C. Green, Danielle J. Harvey, Clifford R. Jack, William Jagust, Edward B. Lee, John C. Morris, Kwangsik Nho, Rachel Nush, Ozioma C. Okonkwo, Richard J. Perrin, Ronald C. Petersen, Monica Rivera-Mindt, Andrew J. Saykin, Leslie M. Shaw, Arthur W. Toga, Duygu Tosun, and Dallas P. Veitch. Overview of Alzheimer’s Disease Neuroimaging Initiative and future clinical trials. Alzheimer’s & Dementia, 21(1):e14321, 2025. ISSN 1552-5260.DOI
  38. [38]Duane L. Beekly, Erin M. Ramos, William W. Lee, Woodrow D. Deitrich, Mary E. Jacka, Joylee Wu, Janene L. Hubbard, Thomas D. Koepsell, John C. Morris, Walter A. Kukull, and NIA Alzheimer’s Disease Centers. The National Alzheimer’s Coordinating Center (NACC) database: the Uniform Data Set. Alzheimer Disease & Associated Disorders, 21(3):249–258, 2007. ISSN 0893-0341.pubmed.ncbi.nlm.nih.gov/17804958
  39. [39]Karly A. Cody, Andrzej Sokolowski, Lucah Medina Guerra, Philip S. Insel, William J. Jagust, Theresa M. Harrison, and Elizabeth C. Mormino. Comparison of amyloid PET acquired through standardized and unstandardized protocols. Alzheimer’s & Dementia, 21(9):e70697, 2025. ISSN 1552-5260. SCAN: Standardized Centralized Alzheimer’s & Related Dementias Neuroimaging, NIH/NIA U24-AG067418.DOI
  40. [40]Du Phan, Neeraj Pradhan, and Martin Jankowiak. Composable effects for flexible and accelerated probabilistic programming in NumPyro. In NeurIPS 2019 Workshop on Program Transformations for Machine Learning, 2019.
  41. [41]Chris J. Maddison, Andriy Mnih, and Yee Whye Teh. The concrete distribution: A continuous relaxation of discrete random variables. In International Conference on Learning Representations (ICLR), 2017.arxiv.org/abs/1611.00712
  42. [42]Eric Jang, Shixiang Gu, and Ben Poole. Categorical reparameterization with Gumbel-softmax. In International Conference on Learning Representations (ICLR), 2017.arxiv.org/abs/1611.01144
  43. [43]Henry Teicher. On the mixture of distributions. Annals of Mathematical Statistics, 31(1):55–73, 1960. ISSN 0003-4851.DOI
  44. [44]Ole Barndorff-Nielsen. Identifiability of mixtures of exponential families. Journal of Mathematical Analysis and Applications, 12(1):115–121, 1965. ISSN 0022-247X.
  45. [45]Carlo Bruni and Giorgio Koch. Identifiability of Continuous Mixtures of Unknown Gaussian Distributions. The Annals of Probability, 13(4):1341–1357, 1985. doi: 10.1214/aop/1176992817.DOI
  46. [46]Jean-Philippe Fortin, Nicholas Cullen, Yvette I. Sheline, William D. Taylor, Ibrahim A. Alescioğlu, Philip A. Cook, Patricia Adams, Crystal Cooper, Maurizio Fava, Patrick J. McGrath, Melvin McInnis, Mary L. Phillips, Madhukar H. Trivedi, Myrna M. Weissman, and Russell T. Shinohara. Harmonization of cortical thickness measurements across scanners and sites. NeuroImage, 167:104–120, 2018. ISSN 1053-8119.DOI
  47. [47]Kanti V. Mardia, John T. Kent, and John M. Bibby. Multivariate Analysis. Academic Press, London, 1979. ISBN 978-0-12-471252-2.
  48. [48]Yoon Kim, Sam Wiseman, Andrew Miller, David Sontag, and Alexander Rush. Semi-Amortized Variational Autoencoders. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 2678–2687. PMLR, 10–15 Jul 2018. URL https://proceedings.mlr.press/v80/kim18e.html.arxiv.org/abs/1802.02550
  49. [49]Joe Marino, Yisong Yue, and Stephan Mandt. Iterative Amortized Inference. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 3403–3412. PMLR, 10–15 Jul 2018. URL https://proceedings.mlr.press/v80/marino18a.html.arxiv.org/abs/1807.09356
  50. [50]Shorena Janelidze, David Berron, Ruben Smith, Olof Strandberg, Nicholas K. Proctor, Jeffrey L. Dage, Erik Stomrud, Sebastian Palmqvist, Niklas Mattsson-Carlgren, and Oskar Hansson. Associations of plasma phospho-tau217 levels with tau positron emission tomography in early Alzheimer disease. JAMA Neurology, 78(2):149–156, 2021. ISSN 2168-6149.DOI

Paper details

vlnc:W_jzk7jts7
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents