- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work introduces an image-adaptive nested boundary expansion path for calibrating conformal segmentation.
Critical strengths
The key novelty is constructing the segmentation prediction set as an image-adaptive nested expansion path, separating two aspects: the expansion mechanism and its extent. Expansion is guided by confidence and spatial-structure heuristics, and conformal calibration provides finite-sample coverage guarantees on how far expansion can proceed.
Critical weaknesses
The proposed method is simple and easy to understand. However, I doubt whether its performance can meet the bar for ICLR. Since the visualizations are not striking enough, I remain skeptical about the reported performance gains. Could the authors report key metrics including FNR and FPR (or Dice and IoU)? The current set of results is insufficient to convince me.
Questions for authors
Beyond the aforementioned weaknesses, I note that the paper is missing citations and comparisons with several closely related approaches:
- Conformal Risk Training: End-to-End Optimization of Conformal Risk Control
- Enhancing image-conditional coverage in segmentation: adaptive thresholding via differentiable miscoverage loss
- Automatically adaptive conformal risk control
We thank the reviewer for their feedback.
W1: Core Contribution Our primary contribution bridges conformal risk control with spatial boundary geometry, providing a principled mechanism to systematically control stretch and eliminate baseline over-coverage in multi-class segmentation.
W2 & Q2: Test-Time Rule You are entirely correct. The stopping rule (min{t:λt>q}) mathematically added a redundant step. We updated Theorem 1, its proof, and Algorithm 1 to use your exact optimal rule: Tq=max{t:λt≤q} (setting Tq=0 if λ0>q). Crucially, our Python code and all reported empirical results already utilized this optimal rule; the discrepancy was solely a notational error in the manuscript, now corrected. W3 & Q1, Q3: Baselines: (a) CRC Adaptation: We apply CRC using an indicator loss L=1{G(Y,C)<ρ}, where G(Y,C)=∣Y∩C∣/∣Y∣ represents the object coverage fraction. This indicator checks whether the coverage falls below the target ρ, and its expected value corresponds to the tail probability, aligning the risk bound directly with our target.
(b) Over-Coverage: The meaningful over-coverage observed in our experiments stems from its discretization. CPS relies on integer morphological dilations that add large, indivisible blocks of pixels at each step. In contrast, CPAS uses a highly granular path, halting much closer to the target. (c) Static Baseline: We implemented your suggested baseline f(x)−β⋅dist(x,Y^) and evaluated it on WBC and OASIS (β∈{0.01,0.05,0.1}). CPAS outperformed this static baseline, achieving strictly smaller mean stretch for the same coverages. (d) RW-CP/Davenport: RW-CP requires foundation models not assumed here. Davenport's outer prediction sets reduce to CRC (identity transformation) and CPS (distance transformation). (e) Multi-Class: Assigning a per-class threshold reduces the problem to K independent binary tasks, destroying the joint multi-class framework we aimed to achieve with a single global threshold. The catastrophic stretch (up to 168) of global CRC highlights why CPAS is effective: it manages varying class difficulties globally without splitting into binary problems. W4: Empirical Claims While averages can be influenced by outlier cells, CPAS's primary strength is consistency: across virtually all datasets and coverages, it matches or outperforms baselines without catastrophic failures. Significant improvements on complex structures (Polyps, Kvasir) highlight its effectiveness in high spatial ambiguity. We also included geometric mean of median Dice, Stretch and IoU scores.
W5: Ablation and Score Role
We agree that the structural path provides the performance gain; however, our ablation studies (Table 3) confirm that incorporating the full uncertainty-weighted score provides the optimal overall results. ∣C0∣: While constant per image, CP computes a single global threshold q. Normalizing aligns images with vastly different initial object sizes on a comparable scale before computing this quantile. ∣Δt∣: we did not mean the step-size hyperparameter k. Dividing by ∣Δt∣ computes average per-pixel uncertainty, normalizing scores between images with large vs. small boundaries. We clarified this in the text.
W6 & Q5, Q6: Protocol Tuning used a data partition strictly disjoint from the final evaluation/calibration splits. We evaluated on extreme settings (manuscript updated): setting r=0 turns off confidence exploitation entirely, relying purely on spatial adjacency. Conversely, pure confidence (r=1) results in noisy, fragmented growth and significantly higher stretch.
W7 & Q4: Edge Cases Empty Masks:
We can ensure the initial set is never empty. If a mask is empty, we initialize C0 using the single highest-confidence pixel. The ceiling function ensures at least one boundary pixel is added per iteration (∣Δt∣≥1), strictly preventing division by zero. Zero images hit these edge cases in our experiments. Reachability: Because CPAS uses morphological dilation, a single starting pixel guarantees eventual coverage of the entire image. Exploration: Refers to probability space: the score allows the path to step into low-probability regions to cross uncertain gaps.
W8 & Q7, Q8: Analysis & Scope "Adaptive" meant selecting a targeted subset of boundary pixels. To avoid confusion with conditional coverage, we removed it from the headings.M&Ms sample unit is 2D slices, split by patient (manuscript updated).Our guarantee is marginal and does not imply equal coverage per size subgroup.Distribution shifts are outside this foundational paper's scope.
W9: Presentation All presentation issues will be fixed.
Q9: 3D Volumes We did not evaluate 3D volumes (our focus is 2D slices). Extending to 3D is an exciting future direction.