- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies longitudinal counterfactual outcome prediction under sequential treatemt interventions, an important problem in causal inference. In particular, it attempts to stabilize the prediction over long horizons by monitoring and selectively reconstructing generated intermediate states. The paper uses TSA for the standard g-computation-style sequential prediction and then uses an additional module, called TMA, to audit and correct the intermediate state. Finally, empirical validations suggest that the architecture could be effective.
Critical strengths
The paper identifies an important issue in longitudinal counterfactual outcome prediction: instability over long horizons. To address this challenge, it proposes a new architecture, which both predicts and corrects the intermediate states. The empirical validations are comprehensive and convincing. The proposed architecture could indeed be helpful in long-horizon settings.
Critical weaknesses
Weakness:
- The central contribution is a combination of existing techniques, with limited methodological novelty. In addition, one should not confuse "reconstruction ability" with "counterfactual correction ability". The reconstruction error which TAM optimizes, is misaligned with the counterfactual outcome prediction.
- No theoretical justification on why the proposed correction mechanism should really work.
- The paper does not use standard terminology, randomly replace words with other words, introduces new words without appropriate explaining.
Questions for authors
How can you justify, that by minimizing the reconstruction error, the TMA can be effective in correction of the counterfactual state?
5 comments
Rebuttal (2/2)
W3
W3. The paper does not use standard terminology, randomly replace words with other words, introduces new words without appropriate explaining.
Response to W3. We use TSA and TAM as module names for trajectory prediction and reconstruction-based state feedback, respectively. At each step, TSA predicts the next state and outcome and records the outcome. TAM uses a frozen monitor to check complete blocks of generated windows. If the gate triggers feedback, TAM updates the private adapter and writes selected reconstructed coordinates into the input for subsequent predictions (Figure 1, p. 2; §4, pp. 4–5).
The terms mean:
- Prototypes: memory vectors learned from observed training histories and frozen during prediction. TAM weights them by similarity to the encoded current block and uses their weighted combination for reconstruction.
- Gate: a threshold test performed by the frozen monitor to decide whether to adapt and write back.
- Session: one patient–continuation rollout. We retain private weights across triggers within that rollout and initialize them from offline weights for each new rollout.
- Continuation grouping: we assign training windows to branches according to treatment at the target time, retaining the recorded treatment history within each window (§4.2–4.4, pp. 4–5).
If our responses address your concerns, we would be grateful if you would consider raising your score in light of the clarifications and additional evidence.
Thank you for your response. However, I think my concerns, e.g. W1, W2, are not resolved. And I agree with reviewer 1qat that the presenting of the paper needs substantial revision. I will therefore keep my score.
Rebuttal (1/2)
Thank you for your constructive comments, which have helped us clarify the contribution and improve the presentation. Below, we explain how prediction and feedback work together, outline the supporting intuition and evidence, and clarify the workflow and terminology.
Critical Weaknesses and Questions For Authors
W1a
Response to W1a. The methodological contribution lies in how we couple trajectory generation with feedback under the information constraints of recursive counterfactual prediction. Our design intuition is to address local prediction error together with the propagation of error through generated inputs. With future observations unavailable, TSA advances the two prescribed treatment branches, while TAM uses historical reconstruction to selectively adjust generated inputs before they are reused. We preserve treatments, the observed prefix, and reported outcomes (§4, pp. 4–5).
Our experiments support the predictive value of this joint design. We observe lower mean NMAE with feedback across prediction depths using the same TSA checkpoints (Figure 2, p. 8). Full also yields lower mean NMAE than validation-selected clipping and prototype-L2 shrinkage in the equal-weight three-benchmark macro-average under both continuations (Table 8, p. 26). The complete system achieves lower mean NMAE than the listed external baselines over 150 steps (Table 2, p. 7).
W1b/W2/Q1
Response to W1b/W2/Q1. 1. Why reconstruction may help. Our intuition is that relationships learned from factual histories can help correct generated inputs when they remain informative under the prescribed continuation. We freeze the shared reconstruction modules and fit the private adapter to the current generated block for five updates before TSA reuses the corrected inputs.
2. Experimental support. We observe reductions in reference-window error and subsequent outcome error against references withheld from adaptation. Full reduces reference-window error at 67.3–72.7% of sampled positions across four synthetic settings (Table 9(b), p. 28). From a shared TSA-only state, we apply one correction and then disable TAM for 20 steps. Nonlinear all-zero NMAE is 0.803±0.116 without correction, 0.688±0.101 with calibrated Frozen, and 0.641±0.089 with Full (Tables 9(b) and 3(b), pp. 28 and 7; protocol: I.2, p. 27). Across 30 paired seeds, the paired NMAE difference (Full minus calibrated Frozen) is −0.047 (95% CI: [−0.073,−0.021]).
3. Auxiliary error analysis. We motivate LTTS through a design intuition and test its predictive value in controlled experiments. B.1 describes error propagation; it does not prove that minimizing reconstruction loss improves outcome prediction. For the synthetic window interface, under local Lipschitz and reference-window error conditions, it gives (p. 17, lines 877–900)
Eh+1≤(1+L)Eh+ϵh+1−Δh.
Here Eh is window error, ϵh+1 is reference-window prediction error, and Δh is the signed reduction in window error from writeback. The bound identifies where feedback acts in the recursion.