Skip to content
AI.info

Research

Temporally Detailed Hypergraph Neural ODEs for Disease Progression Modeling

Overview Research area: Artificial intelligence for healthcare — specifically continuous-time deep learning for disease progression modeling from longitudinal electronic health records (EHRs). Technic

arXiv
2510.17211
Published
2025-10-20
Authors
Tingsong Xiao, Yao An Lee, Zelin Xu, Yupu Zhang, Zibo Liu, Yu Huang, Jiang Bian, Jingchuan Guo, Zhe Jiang

AI summary

Overview

Research area: Artificial intelligence for healthcare — specifically continuous-time deep learning for disease progression modeling from longitudinal electronic health records (EHRs).

Technical level: Advanced. The paper combines neural ordinary differential equations, hypergraph neural networks, cross-attention, and clinically derived progression pathways.

Scope: The paper proposes TD-HNODE, a temporally detailed hypergraph neural ODE that predicts the next set of disease complication markers for a patient by learning continuous-time progression dynamics constrained by clinically verified progression trajectories.

What This Paper Is About

Patients with chronic diseases such as type 2 diabetes develop complications along recognizable clinical pathways (for example, hypertension leading to atrial fibrillation and then heart failure), but their records are collected at irregular hospital visits while the underlying disease evolves continuously. Existing mechanistic models are interpretable but inflexible, and existing deep learning models either ignore clinically validated pathways or reduce them to pairwise relations that miss high-order structure within a pathway. TD-HNODE addresses this by representing each clinically known progression trajectory as a hyperedge whose markers carry their own timestamps, and by learning the continuous-time dynamics of marker states through a neural ODE governed by that hypergraph.

Key Contributions

  1. A temporally detailed hypergraph representation of disease progression. Markers within a clinically recognized progression trajectory form a hyperedge, and each hyperedge records the timestamp at which each marker was first observed for a given patient (with a placeholder for markers not yet observed), so the hypergraph evolves as the patient progresses.

  2. A learnable TD-Hypergraph Laplacian with two components. An attention-based incidence matrix (replacing the binary incidence matrix) assigns time-aware, patient-specific importance to markers within a trajectory (intra-trajectory dynamics), and a learnable hyperedge weight matrix derived from trajectory embeddings captures dependencies between trajectories (inter-trajectory correlations).

  3. A knowledge-infused neural ODE formulation. The temporal gradient of the marker hidden state is driven by the negative of the learnable TD-Hypergraph Laplacian applied to the hidden state plus a risk-factor embedding, allowing multi-way message passing along clinical pathways while remaining continuous in time.

  4. Empirical validation on two real-world EHR datasets. Experiments on a University Hospital dataset and MIMIC-IV show consistent improvements over sequential, temporal graph, temporal hypergraph, and neural ODE baselines, plus an ablation study, sensitivity analysis, and a patient sub-phenotyping case study.

Main Findings

  • TD-HNODE achieves the best performance across all metrics on both datasets. On the University Hospital dataset it reached 79.4% accuracy, 14.3% precision, 79.3% recall, and 20.4% F1-score; on MIMIC-IV it reached 87.9% accuracy, 31.8% precision, 85.7% recall, and 42.9% F1-score.

  • Gains over the strongest baseline. Compared with ContiFormer, TD-HNODE improved accuracy by 2.2% and F1-score by 3.7% on University Hospital, and by 1.7% and 6.4% on MIMIC-IV.

  • Large recall advantage over non-structural models. TD-HNODE showed a +23.4% recall gain over NODE on MIMIC-IV, which the authors attribute to its trajectory-aware hypergraph structure.

  • Advantage over temporal graph models. TD-HNODE achieved 3.9% (University Hospital) and 12.9% (MIMIC-IV) recall improvements over TGNE, supporting the claim that hyperedges capture high-order multi-node interactions better than pairwise edges.

  • Both Laplacian components matter. In the ablation, removing the adaptive incidence matrix lowered F1 from 20.4% to 18.9% (University Hospital) and from 42.9% to 36.6% (MIMIC-IV); removing the learnable hyperedge weights lowered F1 to 18.7% and 38.5% respectively. Removing both dropped performance to 73.1% accuracy / 15.5% F1 on University Hospital and 83.0% / 30.8% on MIMIC-IV. Enabling the learnable hyperedge weights with a static incidence matrix improved recall from 76.1% to 77.0% and F1 from 15.5% to 18.9%, with 5.4%/5.8% recall/F1 gains on MIMIC-IV.

  • Sensitivity to embedding dimension and ODE steps. Increasing the embedding dimension from 64 to 128 improved recall from 0.747 to 0.857 on MIMIC-IV, with diminishing returns or overfitting beyond that; the authors selected d = 128. Varying RK4 solver steps from 4 to 12 showed underfitting at 4 or 6 steps, with performance stabilizing around 10 steps.

  • Three patient sub-phenotypes emerge. A t-SNE projection of embeddings from 1,690 University Hospital patients produced three clear clusters. Mean onset times of the 21 complication markers show Cluster 3 progressing slowest, followed by Cluster 1, then Cluster 2 with the most rapid progression. (The paper content provided is truncated mid-sentence in this part of the case study.)

Methodology in Plain English

Each patient is represented as a sequence of hospital encounters. At every encounter the model receives two things: a vector of risk factors (such as medications, laboratory results, and vital signs) and a vector of complication markers (such as hypertension, atrial fibrillation, heart failure, cerebrovascular disease, and stroke) that can only switch from absent to present. The paper assumes markers are irreversible, which the authors argue fits chronic diseases like type 2 diabetes, Alzheimer's disease, and chronic kidney disease. Lab-derived markers use their first occurrence as the progression signal, while the raw fluctuating lab values enter through the risk factor features.

Clinically validated progression trajectories are turned into a hypergraph: markers are nodes, and each whole trajectory is a hyperedge that can connect many markers at once. Because each hyperedge stores the first-observation timestamp of each marker for that patient, it becomes a "temporally detailed" hyperedge that changes as the patient progresses.

The heart of the model is a neural ODE. Instead of predicting the next visit directly, the model learns how a hidden state for each marker changes continuously over time. That rate of change is computed by a hypergraph Laplacian applied to the current hidden state plus a risk factor embedding, scaled by a learnable matrix, which produces diffusion-like propagation of information among markers sharing a trajectory.

The standard hypergraph Laplacian has two weaknesses the paper fixes. First, its incidence matrix is binary, treating every marker in a trajectory as equally important; the paper replaces it with cross-attention weights that measure how much the patient's current progression point should attend to each other marker, using continuous-time positional encodings for markers already observed and discrete index-based encodings for markers that may develop in the future. Second, hyperedge weights are usually fixed; the paper derives trajectory-level embeddings by pooling self-attention-enhanced marker representations, projects them into a latent space, and computes a hyperedge weight matrix as the product of that projection with its transpose, so similar trajectories influence each other.

The two components are combined into a knowledge-infused TD-Hypergraph Laplacian, which is rebuilt from all encounters up to the most recent visit and held fixed during each ODE integration interval. The model is trained by minimizing binary cross-entropy loss between predicted and observed marker vectors at the next visit.

Why This Matters

Research impact. The paper argues that existing temporal hypergraph neural networks assign timestamps only at the level of entire hyperedges, missing fine-grained marker-level temporal detail, and that existing neural ODE or recurrent hypergraph methods still build discrete hypergraph snapshots with static hyperedges. TD-HNODE's marker-level timestamps inside hyperedges and its learnable Laplacian offer a different formulation of knowledge-infused continuous-time structure learning.

Real-world applications:

  • Early identification of patients likely to develop complications such as stroke or heart failure, when intervention is still possible.
  • Patient sub-phenotyping: grouping patients by progression speed and pathway so that treatments can target rapid progressors.
  • Treatment planning that follows clinically recognized pathways rather than purely statistical patterns, making model outputs easier for clinicians to interpret.
  • Monitoring of chronic disease cohorts in health systems that already hold longitudinal EHR data.

Industry relevance. Because the method consumes standard EHR encounter data and clinical pathways that health systems already maintain, it is compatible with existing clinical data infrastructure. The reported recall gains matter commercially and clinically, since missed early progressions (false negatives) are the costly error in screening and care management.

Future Directions

  • Beyond type 2 diabetes. The main comparisons focus on type 2 diabetes and its complications; the authors report additional cardiovascular disease experiments in an appendix, and broader validation across other progressive diseases is a natural extension.

  • Reproducing and explaining the sub-phenotypes. The case study separates patients into three clusters with different onset speeds, but the truncated content does not report the full characterization of Cluster 2 or clinical validation of the clusters, leaving room for follow-up analysis.

  • Scaling the hypergraph. The paper places computational complexity analysis in an appendix; how the approach scales with a larger number of markers and clinically defined trajectories remains an open question.

  • Which trajectories to include. The hypergraph is built from expert-validated pathways provided by clinical collaborators, so the model's behavior depends on the completeness and correctness of that clinical knowledge; learning or refining pathways from data is a logical next step.

Target Audience

This paper is most useful to machine learning researchers working on graph and hypergraph neural networks, neural ODEs, or temporal point processes applied to health data; clinical informatics researchers and biostatisticians interested in disease progression modeling and patient sub-phenotyping; and applied scientists in health systems or the pharmaceutical industry who need progression models that respect established clinical pathways. Readers should be comfortable with attention mechanisms, graph Laplacians, and continuous-time dynamical systems, since the methodology section is derivation-heavy.

Authors’ abstract

Disease progression modeling aims to characterize and predict how a patient's disease complications worsen over time based on longitudinal electronic health records (EHRs). For diseases such as type 2 diabetes, accurate progression modeling can enhance patient sub-phenotyping and inform effective and timely interventions. However, the problem is challenging due to the need to learn continuous-time progression dynamics from irregularly sampled clinical events amid patient heterogeneity (e.g., different progression rates and pathways). Existing mechanistic and data-driven methods either lack adaptability to learn from real-world data or fail to capture complex continuous-time dynamics on progression trajectories. To address these limitations, we propose Temporally Detailed Hypergraph Neural Ordinary Differential Equation (TD-HNODE), which represents disease progression on clinically recognized trajectories as a temporally detailed hypergraph and learns the continuous-time progression dynamics via a neural ODE framework. TD-HNODE contains a learnable TD-Hypergraph Laplacian that captures the interdependency of disease complication markers within both intra- and inter-progression trajectories. Experiments on two real-world clinical datasets demonstrate that TD-HNODE outperforms multiple baselines in modeling the progression of type 2 diabetes and related cardiovascular diseases.

Read the original paper