- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The conditional minimum volume problem (minimizing Lebesgue measure for lower-bounded coverage), has a known solution: the highest density region. The key idea of this paper is to realize that the conditional density can only be estimated up to a constant (which is enough to preserve the level-set geometry), if a proper correction to obtain correct quantiles is performed. Then classical split conformal prediction is used. The unnormalized conditional density estimation is performed using an adaptation of a contrastive loss, while the traditional pinball loss is used for quantile regression. Theoretical results based on existing statistical methodology accompany the results, as well as experiments validating the approach.
Critical strengths
- The idea of unnormalized density estimation is new and elegant and allows to use stable existing tools for such density estimation (the other step of correcting a score using pinball loss was already present in Plassier et al 2025).
Critical weaknesses
- Empirical results on real data in Table 2 are not really better than existing work (for example, C-PCP).
- Theoretical results are not very strong given existing proof technology (essentially, if there is a lot of data, it works). This is nice to have, but not particularly surprising given the method.
Questions for authors
- The algorithm has many hyperparameters. How would you adapt them in practice for a new problem?
- The section 3.4 on the residual refinement is a bit dense and results are almost the same in Table 2. Is it worth the effort?
- For synthetic data (Table 1), the proposed method works significantly better than others, but not for real data (Table 2). Any explanation?
3 comments
Response to Reviewer tJZ8 (2/2)
Q2. Clarity and practical value of Res-LECP
Thank you for pointing out that Section 3.4 was difficult to follow. We have rewritten it around a simpler boosting-like interpretation: each residual stage learns an additive correction to the remaining log-density discrepancy of the current score. Boundary-focused weighting emphasizes the provisional prediction contour while preserving the ideal density ordering.
We agree that refinement offers limited gains on the main benchmarks. In the updated twenty-split experiments, validation selects the unrefined base score in 18/20 House splits and 15/20 Spiral splits. This suggests that additional residual stages are often unnecessary when the base LECP score is already accurate.
To investigate when refinement becomes more valuable, we constructed a controlled experiment from the two-dimensional Spiral benchmark. We generate , where follows the underlying conditional Spiral distribution. Increasing makes the conditional response scale vary more sharply across covariate values while retaining the underlying generating mechanism.
The newly added Table 7 (Appendix D.5) reports the following paired improvements in IoU with the oracle 90% HDR over ten seeds:
| IoU gain (Res-LECP − LECP) | 95% CI | Holm-adjusted | |
|---|---|---|---|
| 0 | +0.004 | [-0.004, 0.012] | 0.299 |
| 1 | +0.067 | [0.019, 0.115] | 0.024 |
| 2 | +0.145 | [0.068, 0.221] | 0.00623 |
| 3 | +0.277 | [0.228, 0.325] | |
| 4 | +0.240 | [0.174, 0.305] |
The gains are statistically significant for . At , the base LECP region has approximately 3.2 times the oracle HDR volume, compared with less than 1.7 times for Res-LECP, with comparable conditional reliability. Figures 7–8 further illustrate how refinement recovers boundaries closer to the oracle under strong scale heterogeneity.
These findings clarify when the added computation is worthwhile: Res-LECP can substantially improve geometric recovery when the base score retains systematic contour errors, while remaining optional on benchmarks where the base fit is already accurate.
Q3. Why are improvements larger on synthetic data?
The synthetic benchmarks deliberately test disconnected components, annular gaps, and thin curved supports, where learning flexible conditional HDR geometry can offer particularly large advantages. Real-world data may involve more intricate covariate–response relationships and noise, making the underlying conditional density geometry harder to estimate. Since the oracle HDRs of real datasets are unknown, however, we cannot determine precisely how much these factors contribute to the smaller relative gains.
Nevertheless, the improvements on real data remain meaningful and consistent. At , LECP or Res-LECP attains the smallest mean root volume on all six real datasets, with statistically supported improvements as discussed above. Across , an LECP variant achieves lower mean root volume than SLS in 17 of 18 real dataset–coverage-level comparisons (Appendix D.1).
We also believe it is important to interpret region size alongside conditional reliability. For example, at on RF1 and RF2, PCP produces slightly smaller root volumes (0.28 on both datasets), but its worst-slab coverage drops to 0.23 and 0.24, respectively, compared with 0.63 for Res-LECP on both. This illustrates why smaller prediction regions are not necessarily preferable when accompanied by substantial conditional undercoverage.
We appreciate the reviewer's thoughtful suggestions, which have helped us strengthen both the empirical evaluation and the presentation of our work.
Dear Reviewer tJZ8,
As the discussion period is drawing to a close, we wanted to briefly follow up on our responses and the updated manuscript. We have expanded the empirical evaluation and added further analyses to clarify the theoretical contributions and the practical value of residual refinement.
We would be grateful for any further thoughts you might have on these revisions, especially if there are any remaining questions or concerns.
Thank you again for your time and constructive feedback.
Response to Reviewer tJZ8 (1/2)
We thank the reviewer for the encouraging assessment and constructive suggestions. We have expanded the main experiments to twenty shared splits, clarified the theoretical contributions, and improved the presentation of the empirical results and residual refinement.
W1. Improvements on real-world benchmarks
We appreciate the opportunity to clarify the real-data comparisons. LECP's main advantage is prediction-region efficiency, while its conditional-reliability diagnostics remain competitive rather than uniformly best.
We have expanded the main benchmark from ten to twenty shared splits. At α=0.10, the updated Table 2 gives the following root-volume comparisons between Res-LECP and C-PCP:
The reductions are calculated from the displayed means. Thus, the efficiency improvement is present across all six real datasets, although its magnitude varies.
We have also added Figure 2 to make the efficiency–reliability trade-off more transparent. Averaged equally across the six datasets, Res-LECP achieves mean root volume 1.23, compared with 1.64 for CP2-PCP and 1.67 for C-PCP. CP2-PCP and C-PCP obtain better average ERT and WSC, respectively, but with appreciably larger prediction regions. We have clarified this trade-off in Section 5 rather than suggesting that LECP is uniformly best on every metric.
The updated paired analysis over twenty shared splits further supports the efficiency gains (Appendix E.3, Table 10). At α=0.10, Res-LECP achieves significantly smaller root volume than all six baselines on all six real datasets, giving 36/36 significant comparisons after Holm correction.
W2. Strength of the theoretical contributions
Finite-sample marginal coverage follows from standard split conformal calibration, as stated in Theorem 1. The additional theoretical analysis concerns the geometry and conditional coverage of the learned regions.
Under the stated estimation-consistency and regularity conditions, Theorem 2 establishes asymptotic conditional coverage on high-probability covariate sets and convergence in symmetric difference to the oracle conditional minimum-volume HDR. Appendix B.6 further connects the required estimation conditions to contrastive excess risk and conditional pinball regret.
We have added empirical analyses that examine these conclusions more directly. Appendix E.1 (Tables 8–9; Figure 9) evaluates symmetric difference with the oracle HDRs on four synthetic benchmarks. Both LECP variants outperform all six baselines, with 48/48 Holm-adjusted paired comparisons yielding p<0.001. Appendix E.2 (Figure 10) further examines estimation and prediction-set errors at four sample sizes, showing decreasing mean errors between n=2500 and n=20000.
These results provide empirical support for the oracle-recovery mechanism established by the theory. Establishing finite-sample convergence rates for the practical neural training procedure remains an open problem.
Q1. Hyperparameter selection in practice
For a new dataset, we recommend starting with the two-scale local Gaussian proposal (relative standard deviations 0.5 and 1), M=1000, β=0.1, and λ=0.01. When tuning is needed, λ can be selected from 0.01,0.1,1 using validation-calibrated volume.
Appendix D.2 reports sensitivity analyses and a new five-dataset validation study supporting this selection procedure. Moderate hyperparameter variations have limited impact in the tested settings; the main observed failure mode is an excessively narrow proposal, which can increase root volume by 98–257%. The final conformal calibration set is kept separate from all hyperparameter decisions.