- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes NEAR, a modular regularizer that constructs a fixed graph from first-stage plug-in CATE similarity and penalizes differences between connected second-stage CATE predictions. The authors link plug-in estimation error to true CATE variation along selected edges, provide risk and bias–variance analyses, and demonstrate consistent improvements across six learners and three benchmarks. Remaining concerns include novelty relative to existing effect-aware pairing methods, the applicability of the theoretical analysis to practical training, and the incremental benefits over strong plug-in baselines.
Critical strengths
(1) The work motivatedly uses plug-in CATE similarity rather than covariate proximity alone, particularly when treatment effects change sharply between observations with similar covariates.
(2) NEAR constructs a fixed mutual top-K graph before second-stage training and applies pairwise regularization only to the final CATE predictions, leaving the learner-specific base loss unchanged. Moreover, plug-in CATE estimates define the neighborhood structure rather than serve as numerical anchors for the final predictions.
(3) The theoretical analysis and empirical results connect plug-in estimation error, true CATE variation along selected edges, and the cost of smoothing, providing an interpretable framework for understanding the method’s behavior.
Critical weaknesses
(1) Although the paper discusses related work on Pairwise and local structure in CATE learning and Graph and fusion regularization, and effect-aware pairing, the key methodological distinctions and incremental contributions could be articulated more clearly. A specific comparison with methods (such as HERMES and LITE) would help clarify the work's novelty.
(2) Although NEAR achieves lower mean estimation error than directly using the first-stage plug-in CATE estimates, it also introduces additional computational overhead that warrants further analysis.
Questions for authors
similar to Weakness
5 comments
Response to Reviewer X2CQ (2/2)
[W2] Computational cost relative to Direct
In the new runtime comparison, most of DR-NEAR's additional time over direct plug-in prediction (Direct) comes from the propensity fitting and second-stage learning required by the DR-learner without graph regularization (None). Adding NEAR to None increases total time by 20.9% to 23.4% across these four runs.
1. NEAR builds the graph once and computes the regularizer during training. Prediction does not need the graph.
Let be the number of training observations and the neighbor limit. The current implementation constructs the graph once using candidate pair evaluations. For large datasets, graph construction can be further optimized. Since similarity depends only on differences between scalar plug-in CATE estimates, sorting these estimates before radius filtering and neighbor selection can reduce the complexity of graph construction to for fixed . Table B reports measured times for the current implementation.
Mutual neighbor selection retains at most edges, requiring memory to store the retained edges and weights. Algorithm 2 evaluates the regularizer on sampled edges during training, with the graph held fixed.
2. At every sample size tested, the time increase from Direct to None exceeds the increase from None to DR-NEAR.
We conducted the new runtime comparison on Synthetic, with one run at each sample size. Table B includes the fitting and prediction steps required by each method.
Table B. Measured computation times for Direct, None, and DR-NEAR, in seconds.
| Total sample size | Direct total | None total | DR-NEAR graph construction | DR-NEAR second stage | DR-NEAR total |
|---|---|---|---|---|---|
| 1,000 | 3.09 | 11.17 | 0.02 | 8.43 | 13.52 |
| 2,000 | 6.31 | 22.45 | 0.08 | 17.00 | 27.15 |
| 5,000 | 15.97 | 57.79 | 0.51 | 43.40 | 69.88 |
| 10,000 | 32.76 | 117.84 | 2.33 | 89.65 | 145.37 |
DR-NEAR takes 4.30 to 4.44 times as long as Direct. At a sample size of 10,000, None adds 85.08 seconds over Direct, while DR-NEAR adds 27.53 seconds over None.
Thus, NEAR adds graph construction and regularizer evaluations to existing two-stage learning. Direct is faster, but Table 4 of the revised manuscript (Table 3 of the original submission) reports higher mean estimation error for Direct.
We again thank you for these valuable suggestions! In the revised manuscript, we have clarified the methodological distinctions in Section 2, added the method comparison in Table 2, and explained graph construction complexity and training costs in Section 6.3 and Appendix C.9. Your comments really helped us clarify NEAR's contribution and computational cost. We hope this addresses your concerns.
References
[1] Cohen, D., Talmon, R., & Shaham, U. (2025). Revisiting covariate and hypothesis roles in ITE estimation: A new approach using Laplacian regularization. OpenReview manuscript.
[2] Zaccagnino, R., Benevento, G., Malandrino, D., Telesca, D., & Ture, A. (2026). HERMES: Heterogeneous effects representation with matched embeddings using Siamese networks. Transactions on Machine Learning Research.
[3] van der Laan, L., Ulloa-Perez, E., Carone, M., & Luedtke, A. (2023). Causal isotonic calibration for heterogeneous treatment effects. ICML.
Response to Reviewer X2CQ (1/2)
Thank you for recognizing our use of effect similarity and the connection between plug-in errors and the cost of smoothing! We clarify the distinctions from HERMES and LITE and analyze the additional computational cost below.
[W1] Distinctions from HERMES and LITE
NEAR constructs fixed neighborhoods from first-stage effect estimates and directly regularizes final conditional average treatment effect (CATE) predictions. The differences are how we select pairs and what we regularize.
1. HERMES dynamically forms pairs from current effect predictions during training and regularizes their representations, while NEAR fixes its pairs before the second stage and directly regularizes CATE predictions.
HERMES (Zaccagnino et al., 2026) also uses estimated effect similarity. Its Siamese network encourages similar representations for similar effects and separates representations for dissimilar effects. NEAR determines its neighborhoods from existing first-stage estimates before second-stage training and holds them fixed throughout that stage. Its regularizer penalizes squared differences between final effect predictions over connected pairs.
2. LITE separately regularizes treatment and control outcome predictions, while NEAR directly regularizes CATE predictions without requiring similar treatment and control outcome levels.
The graph in LITE (Cohen et al.) is based on learned representation distances and changes during training. NEAR constructs a fixed graph from differences between scalar plug-in CATE estimates.
3. NEAR reuses existing first-stage estimates, retains the original learner's base loss and prediction model, and analyzes how first-stage estimation errors affect second-stage risk.
This design requires no additional model for neighbor selection. Our analysis further connects plug-in errors to true CATE variation along selected pairs and to second-stage CATE risk.
4. In the additional comparisons, the doubly robust learner with NEAR (DR-NEAR) has the lowest mean error on IHDP and ACIC, while LITE has the lowest mean error on Synthetic.
Table A compares the submitted DR-NEAR results with results for these methods and Causal Isotonic Calibration (CIC). For CIC, we use Algorithm 3 of van der Laan et al. (2023). All error tables report outcome-standardized root PEHE, consistent with the paper, as mean ± standard deviation. Lower is better.
Table A.Comparison with existing methods.The ACIC row includes all 77 settings. Excluding the three settings with extreme CIC errors gives 0.90 ± 0.44 for CIC on the remaining 74 settings.
Thus, NEAR selects fixed neighborhoods from existing first-stage effect estimates and regularizes final CATE predictions while retaining the original learner's base loss and prediction model.