- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies multivariate regression. The broader issue is that different functions used in conformal prediction can lead to substantial differences in the sizes and shapes of prediction regions. Within this setting, the paper focuses on constructing convex conformal prediction regions for multidimensional regression. Other approaches restrict the available regions to a small number of predefined geometric families, which constrains the resulting regions and may produce unnecessarily large prediction regions. To address this issue, the paper proposes CoCoNet (Convex Conformal Network) and reformulates the problem in terms of score functions. It develops variants based on different scoring schemes and conducts extensive experiments across regression tasks to demonstrate the effectiveness of the approach.
Critical strengths
• The logic of the method derivation is strict and complete, and the definition of the problem is clear. • The experimental results are rich and convincing, and the performance shown in the experiments is very good. • The achievements in this paper are rich, and the amount of work is large.
Critical weaknesses
• The structure of the article is severely unbalanced. The main body cannot support the whole logic of the research, especially because the “Related Work” section is included in the supplementary materials, which makes the importance of the contributions hard to evaluate and understand. Some concepts lack explanation in the main body; their explanations are all provided in the appendices, requiring readers to search for them themselves.
• The background and motivations are vague in the abstract and introduction, making it hard for me to evaluate the value of the work from the starting point.
• The abstract and introduction seem to consist of key points summarized from the appendices and “combined” into content in a sequential order rather than through logical connections. This makes me confused and harder to understand the content, especially because some main mechanism of the improvement is not illustrated in the main body.
• The logic of the reason why the method can handle the problem is weak: In Section 3, Eqs. (9)–(12) optimize the prediction-region size at the fixed training threshold of 1, whereas the final region is defined using a separately calibrated threshold. Reducing the former does not automatically reduce the latter at the target coverage level. The coverage and miss penalties may help bridge this gap, but the paper does not isolate their contribution: the ablation in Appendix E.1 focuses on input dependence and the contextual encoder. The reported post-calibration results provide empirical evidence of overall performance, but do not by themselves establish how the individual loss terms preserve the training-time gains after calibration. Reporting the calibration-induced change in region size and conducting a loss-term ablation would clarify this connection. This concern relates to the efficiency objective, not the validity of independent split-conformal calibration.
• The correlation between the definition and the capability of the network is weak : Proposition 3 establishes the existence of an admissible convex score representing a compact, full-dimensional convex region containing the point prediction in its interior. This is a result for the unrestricted admissible function class, not an approximation or learning guarantee for the particular networks used in the experiments. The Spline implementation still produces rotated hyperrectangles at a fixed threshold (Eq. (17)), and the ICNN implementation has finite width and depth and includes a positive quadratic term (Eq. (21); Table 5). Therefore, the existence result alone does not establish that these implementations can represent or learn arbitrary convex geometries. The paper should distinguish representation by the abstract score class, approximation by the chosen architecture, and recovery through training. The synthetic examples support specific geometric cases, but do not establish the unrestricted claim. An architecture-specific justification, or a narrower statement of the claim, is needed.
• The table in the experimental section is extremely unfriendly to human reviewers. The characters are too small, and the results are redundant, making it hard to find the key performance results.
Questions for authors
Question 1 : Could the authors provide clearer application contexts, background, and motivation, as well as clearer and more direct logical connections between the background, motivation, problem, and proposed method?
Question 2 : Could you provide a concise explanation of the methodological contribution relative to the closest prior approaches, and explain how the proposed volume-minimization objective is computed and differentiated? These points are central to evaluating the paper, but the main text does not sufficiently connect them, requiring the reader to reconstruct the explanation from material scattered across the manuscript and appendices.
6 comments
Response to Reviewer Usyg (2/3)
Regarding the training threshold and the coverage and miss penalties
"Reducing the former does not automatically reduce the latter at the target coverage level. The coverage and miss penalties may help bridge this gap, but the paper does not isolate their contribution."
Thank you for this careful observation. As you note, minimizing the size at τ = 1 does not by itself minimize the calibrated region. The revised Section 3 now states that the training threshold is fixed at τ = 1 to simplify the optimization: the coverage terms push the unit sublevel set towards coverage 1 − α, which keeps the size objective from shrinking the set far below the target coverage, and calibration then adjusts its level. The new Appendix E.4 (Table 13) reports the calibration-induced change in the threshold: over all tasks and seeds, the median q̂ is 1.68 for CoCoNet-ICNN, 1.80 for CoCoNet-Spline-ℓ∞ and 1.98 for CoCoNet-Spline-ℓ1. All reported sizes are those of the calibrated regions.
Following your suggestion, the new loss-term ablation (Appendix E.7, Table 20) isolates the two penalties: it compares the full objective with training after removing the aggregate coverage term L_cov or the instance-level miss term L_miss (the size term is kept in every variant, the remaining weight is selected on validation, five seeds). Calibrated size at 90% coverage (lower is better):
| Dataset | p | Full objective | Without L_cov | Without L_miss |
|---|---|---|---|---|
| ENB | 2 | 7.55 | 7.71 | 8.55 |
| Bias-Corr. Temp. | 2 | 3.88 | 3.91 | 4.02 |
| Online Retail II | 2 | 2.02 | 2.33 | 1.97 |
| SCPF | 3 | 5.16 | 5.89 | 6.50 |
| QM8 | 4 | 1.10 | 1.10 | 1.19 |
| Communities Crime | 6 | 5.94 | 6.04 | 6.42 |
| QM9-8D | 8 | 4.94 | 4.94 | 5.23 |
| Knee Contact Force | 12 | 6.65 | 6.73 | 7.24 |
| QM7b | 14 | 1.78 | 1.81 | 1.85 |
| OES97 | 16 | 2.87 | 3.65 | 7.62 |
| Mean rank ↓ | 1.20 | 2.00 | 2.80 |
The full objective gives the smallest calibrated region on eight of the ten datasets. Removing L_miss has the larger effect: the region grows on nine of the ten datasets, by 4–13% on most of them, 26% on SCPF and a factor of 2.7 on OES97. Removing L_cov costs less, but still up to 27% (OES97). The penalties therefore do not create the efficiency by themselves; they keep the trained set close to the target coverage, so that the training-time gains survive calibration.
Regarding the expressiveness claim
"The existence result alone does not establish that these implementations can represent or learn arbitrary convex geometries. An architecture-specific justification, or a narrower statement of the claim, is needed."
Thank you for this careful distinction; we have narrowed the claim accordingly. The revised Section 3 separates the abstract score class from the architectures: Proposition 3 shows that, within the unrestricted admissible score class, every compact, full-dimensional convex region containing the point prediction is a score sublevel set, but a given spline or ICNN represents only part of this class. The variants offer increasing flexibility:
- CoCoNet-Spline-ℓ∞: rotated, asymmetric boxes.
- CoCoNet-Spline-ℓ1 (new): rotated, asymmetric polytopes.
- CoCoNet-ICNN: smooth convex regions of flexible shape; its positive quadratic term and smooth activations make the regions smooth, so it rounds the corners of polygonal targets.
None of them represents every convex region, and the paper does not claim an approximation or recovery guarantee for the trained networks. The evidence at that level is empirical, through the synthetic targets with known optimal regions (Table 1, IoU and V/V*).
Response to Reviewer Usyg (3/3)
Regarding the contribution and the volume objective (Question 2)
"Could you provide a concise explanation of the methodological contribution relative to the closest prior approaches, and explain how the proposed volume-minimization objective is computed and differentiated?"
Contribution. Prior learned conformal regions for multivariate regression come in two kinds: a fixed convex family whose parameters are learned (boxes, ellipsoids, the norm balls of MVCS [1]), or sets that are not convex in general (OT-CP, CONTRA, JAPAN, PBS). CoCoNet learns the convex shape itself, as an input-dependent score whose sublevel sets are convex by construction, trained by directly minimizing their size and then calibrated by split conformal prediction. It is a framework with different degrees of flexibility and structure: the spline variants produce efficient structured sets (rotated asymmetric boxes and polytopes), and CoCoNet-ICNN produces smooth, flexible convex sets. Relative to the closest works:
- MVCS [1] also minimizes region volume, but over norm balls, so its input-adaptive regions are symmetric about the point prediction; its asymmetric multi-norm variant is used as one global shape. CoCoNet learns input-adaptive, asymmetric convex regions.
- Yeh et al. [2] also learn input-dependent convex sets with an input-convex network, but they train for the performance of one downstream decision problem, which must be known in advance, and their ReLU network gives polytopes. CoCoNet minimizes the region size directly, so the same regions serve any downstream problem, and it covers both polytopes and smoothly curved regions. It also works on top of any pretrained point predictor.
Volume computation (summarized in Section 3; full derivation in Appendices C.2–C.3). For CoCoNet-Spline-ℓ∞, the region is a rotated box whose volume is the product of its side lengths; the CoCoNet-Spline-ℓ1 polytope also has a closed-form volume. The CoCoNet-ICNN region is convex and contains the point prediction, so its volume follows from its radial boundary: V = vₚ · 𝔼ᵤ[ρ(u)ᵖ], where vₚ is the volume of the unit ball and ρ(u) is the radius at which the score reaches the threshold along direction u. Because the score is strongly convex and vanishes at zero residual, this radius exists and is unique, and it is found by a one-dimensional root search. The directions are equally spaced for p = 2 and scrambled Sobol points for p > 2; in higher dimensions they are drawn after a volume-preserving whitening (det A = 1), and the volume is evaluated in log space for numerical stability.
Differentiation. Gradients flow through the boundary radii by implicit differentiation of Sθ(x, ρu) = τ, which gives ∇θ ρ = −∇θ S / (uᵀ ∇ᵣ S) at the boundary point, so no gradient passes through the root solver. The spline volumes are differentiated in closed form.
We thank you again for reviewing our work. Please let us know if we misunderstood any of your questions; we are happy to provide any further clarification.
References. [1] Braun et al., Minimum Volume Conformal Sets for Multivariate Regression, JASA 2026. [2] Yeh et al., End-to-End Conformal Calibration for Optimization Under Uncertainty, TMLR 2025.
Response to Reviewer Usyg (1/3)
We appreciate your feedback, and we are glad that you found the derivation strict and complete and the experimental results rich and convincing. We provide point-by-point responses below (in three parts); all changes in the revised PDF are marked in blue.
Structure, background and motivation (Question 1)
Thank you for these suggestions. We revised the front of the paper along these lines:
The full related work remains in Appendix A because of the page limit, but its main contrast is now in the introduction. We would be grateful to know of any passage that remains unclear, so that we can expand it further in the main text.
Regarding the results table
"The table in the experimental section is extremely unfriendly to human reviewers. The characters are too small, and the results are redundant."
Thank you for pointing this out. Table 2 now has one number per cell, the size over ten seeds with its standard deviation; the best entry is in blue, the second underlined, and a mean-rank row is at the bottom. The sizes are dimension-normalized, (mean volume)1/p, which keeps tasks of different dimension on one scale. The empirical coverage, about 90% for every method, moved to Appendix Table 9, and the comparison with all 15 methods, including the non-convex baselines, is in Appendix Table 8, with a rank figure (Figure 4).