- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper frames ICD coding as retrieval-augmented classification with 2 stages. Stage 1 retrieves at document, code and span levels with a Clinical-Longformer bi-encoder and FAISS. Stage 2 builds a per-note evidence graph and reranks candidates with an edge-weighted GAT and a learned fusion gate.
Critical strengths
The revewer can feel this paper is well-motivated option and treatment of long-tail and missing labels with traceable evidence, and the results show consistent gains on rare codes across MIMIC-III and MIMIC-IV.
Critical weaknesses
From the method discription part, the label completion and the PU guarantees are internally inconsistent? As described, label propagation uses a row-normalized graph matrix and starts unobserved codes at 0. Then under that setup, no unobserved code can receive a soft label above the propagation strength, am I understand it correctly? Table 6 reports good results for propagation strengths of 0.1 and 0.2 but the default propagation strength and soft-positive threshold both set to 0.3, which means no code can pass it?
Questions for authors
How can l exceed alpha in Fig. 5? What W/alpha/theta_soft are actually used? Is retrieval leave-one-out in training? Are Table 4 MIMIC-IV statistics and split protocols the same as those used for the copied baselines?
Thank you. Your reading of Equation 4 is correct and it exposed a typo.
W1. Propagation and the thresholds.
As printed, no unobserved code can exceed α, so with α=θsoft=0.3 nothing would be selected. The printed equation has a typo in one superscript. The second term should use the current value of the label, not the starting value, which is what our code does:
ℓi,c(t+1)=α∑c′Wcc′,ℓi,c′(t)+(1−α),ℓi,c(t)(c∈/Pi)
Under this rule soft labels can rise above α. On the 47,723 MIMIC-III training notes at the default settings, the average note receives 33.5 soft positives, and 99.7 percent of notes receive at least one.
This also explains Table 6. Under the implemented rule the sweep is meaningful:
Theorem 4 is restated for the implemented iteration in our answer to Reviewer qkWg, part 1.
Q. Figure 5, settings, leave-one-out and splits.
Figure 5 shows values above α because that is what the implemented rule produces. The settings are α=0.3, θsoft=0.3, T=20, with a fixed row-normalised weight matrix. None of these are learned.
Retrieval in training is not leave-one-out. A training note can appear in its own document index. This creates a training-time shortcut that does not exist at test time, where the test note is never in the index, so it cannot inflate the reported numbers. We disclose it and will fix it. During training all gold codes are also added to the candidate set so the reranker always sees them. At test time candidates come from retrieval alone, with recall at 50 of 94.1 percent.
On MIMIC-IV, MSMN and CoRelation (marked with a diamond) are copied from Nguyen et al. (2023) and use their splits.
Ethics flag.
MIMIC-III and MIMIC-IV are de-identified and released under the PhysioNet credentialed data-use agreement. We collected no new data and had no contact with patients. Figure 1 reproduces short excerpts with the surrogate identifiers as released.