- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes a new model for modelling hospitalization risk for patients with regard to heart failure (HFpEF). The model is split into a propensity model and an outcome model. The models are trained using jointly with a loss that combines both individual losses with a regularizer. The authors especially highlight, that their model uses a hypergraph to encode multi-treatment effects.
Critical strengths
- The paper is well presented, clearly structured and easy to follow.
- The application of machine learning to heart failure treatment is relevant and of practical clinical interest.
- The paper adresses the fact that patients are usually treated with mutliple treatments simultaneously.
Critical weaknesses
- Higher-order modeling is not actually used. The proposed higher-order graph model is a clique expansion of the hypergraph. It is therefore equivalent to a standard GNN applied to a different (reweighted) pairwise graph. The ablation compares a GNN on the original pairwise graph with this reweighted GNN, but it does not compare against a genuine higher-order model, such as a hypergraph neural network or a simplicial or message-passing model operating on hyperedges. Because higher-orderedness is framed as the paper’s central contribution, this gap is significant. I would strongly encourage the authors to add an ablation with a true higher-order architecture.
- Marginal empirical improvements. The reported performance is very close to that of competing methods, with only about a 1% improvement. The paper offers no theoretical advances, and its individual components have all been used before, so its contribution rests entirely on empirical evaluation. Under these conditions, the small margin is not sufficient to demonstrate a clear benefit of the proposed approach.
- Missing runtime analysis. No runtimes or computational costs are reported. Given the small performance gains, a comparison of training and inference time against the baselines is needed to assess the practical trade-off. If this method is to aid in screening, it must be incredibly efficient and locally runnable (privacy constraints, limited compute capacity).
Questions for authors
-Since the clique expansion reduces the proposed model to a standard GNN on a reweighted pairwise graph, in what sense does the model capture higher-order interactions that a pairwise GNN cannot? Could you include a comparison with a genuine higher-order architecture, such as a hypergraph neural network operating directly on hyperedges? -What are the training and inference runtimes of the proposed method compared to the baselines? How does the computational overhead of the clique expansion scale with the size and number of hyperedges? Can you run your model on limited hardware (i.e. without a GPU)?
2 comments
I thank the authors for the detailed response. However, some things have remained unclear.
W1/Q1 Indeed the hyperedges are aggregated in a truly higher-order fashion. However, the message passing is not higher order. I thank the authors for conducting the ablation, but it is unclear to me what "direct hyperedge message passing" is. Could the authors provide a reference? Other than this model, the ablation seems to contain only pairwise models.
W2 I thank the authors for the clarification. However, I must maintain my stance that modest improvements on two real-world datasets does not demonstrate a clear benefit/justification of the approach.
W3 The runtime analysis and CPU evaluation has addressed this concern.
I maintain my score.
Response to Reviewer a5B4
We sincerely thank the reviewer for highlighting the clinical relevance of combination therapy in HFpEF.
W1/Q1. Higher-order interactions. We disagree that HyperDR models only pairwise dependencies. The weighted-graph equivalence applies to the node update in Eq. (1). HyperDR pools each prescribed regimen as a distinct hyperedge (§3.1), a design none of the seven baselines in Tables 1–2 uses. OneFlorida contains all eight combinations of β-blockers, loop diuretics, and MRAs on a RAAS-inhibitor background (Table 6). Eq. (2) allows the β-blocker–diuretic interaction to change when an MRA is added.
We tested direct hyperedge propagation by applying ReLU within each regimen before passing messages back to its drugs. Across 20 additional paired OneFlorida Polynomial runs with a shared evaluation propensity per run, this variant and Eq. (1) gave nearly identical mean errors. Eq. (1) reduced mean CATE RMSE by 8.1% versus the binary GCN.
W2/Q2. Effect recovery. HyperDR improved factual F1 by 1.7 percentage points on OneFlorida (80.5% to 82.2%) and 1.0 point on MIMIC-IV (82.0% to 83.0%) over the strongest baseline in each cohort (Table 1). Table 2 evaluates recovery of known treatment effects across all 378 regimen pairs on the OneFlorida Polynomial benchmark. Against NCoRE, the strongest baseline on both metrics, HyperDR reduced ATE RMSE by 36.7% (0.061 to 0.039) and CATE RMSE by 44.2% (0.149 to 0.083) across three runs.
W3/Q3. Time complexity and CPU runtime. We added a time-complexity analysis of the treatment encoder.
A regimen ej containing ∣ej∣ drug classes contributes (2∣ej∣) distinct drug pairs and ∣ej∣ diagonal entries to the weighted drug graph. Summing over the Kcomb regimens gives O(∑j=1Kcomb∣ej∣2) operations to rebuild the clique expansion when the learned hyperedge weights change.
Eq. (1) can also be evaluated directly from the sparse incidence matrix H. First, XW projects Kdrug drug embeddings from dimension d to dh, costing O(Kdrugddh). Next, H⊤ pools the drug features within each regimen, and H sends the weighted regimen features back to their member drugs. Each pass visits the ∑j∣ej∣ drug–regimen memberships once and processes dh features per membership. The resulting cost per layer is O(Kdrug⋅d⋅dh+dh∑j=1Kcomb∣ej∣). The drug–regimen incidence matrix is 6×28 in OneFlorida and 6×42 in MIMIC-IV. Summing co-membership weights across regimens gives a 6×6 drug–drug matrix in each cohort, with one row and one column per drug class. Thus, for a fixed regimen size, graph construction scales linearly with the number of regimens, while the matrix dimensions depend only on the number of drug classes.
As requested by the reviewer, we also ran CPU-only benchmarks for both training and inference on an Apple M5 Max using one PyTorch thread. Values are medians over three OneFlorida Polynomial runs (~3,900 training snapshots each, dh=32, batch size 256). Training time includes validation through early stopping and excludes preprocessing and any separate propensity fit. Inference time covers all 28 regimens for one patient without cached regimen embeddings.
We will include these measurements and additional training and inference benchmarks in the revised paper.