Weaknesses
This paper puts emphasis on achieving conditional calibration (not marginal calibration), but the conditional calibration is known to be hard to achieve even for datasets without any censored data point. See, e.g.,
+ Lei, J. and Wasserman, L. (2014). Distribution-free prediction bands for non-parametric regression. Journal
of the Royal Statistical Society: Series B (Statistical Methodology), 76(1):71–96.
+ Rina Foygel Barber, Emmanuel J Candes, Aaditya Ramdas, Ryan J Tibshirani, The limits of distribution-free conditional predictive inference, Information and Inference: A Journal of the IMA, Volume 10, Issue 2, June 2021, Pages 455–482.
+ Zhao et al., Individual Calibration with Randomized Forecasting, ICML 2020.
This paper does not cite these papers, and this paper does not discuss the hardness of conditional calibration. Lack of extensive discussion on the hardness of conditional calibration is a serious problem of this paper.
Despite the hardness, this paper claims that the conditional calibration can be achieved in Theorem 3.2. However, this theorem actually shows nothing: it shows only that, if we have an estimator that achieves the conditional calibration (i.e., Eq. (10) is satisfied), the output of the proposed method achieves the conditional calibration, too. I think that if we have an estimator that achieves the conditional calibration, the proposed method is not required.
Furthermore, there are many other problems in this paper:
+ While $\Gamma_{M}$ should be a set of scalar values according to line 9 of Algorithm 1, $\Gamma_{M}$ is a set of pairs of scalar values according to line 11 of Algorithm 1.
+ According to lines 180-183, $R$ copies of comformity scores $\gamma_{i,M}$ are generated for each uncensored data point. If so, the equation between lines 537 and 538 is incorrect.
+ According to lines 180-183, $R$ copies of comformity scores $\gamma_{i,M}$ are generated for each uncensored data point. Neverthless, this paper assumes that the set $\Gamma_{M}$ does not have any tie in line 538.
+ The proof of Theorem C.1 are not fully described. Even though the goal of the proof is to prove equation (9) on $\rho_{1}$ and $\rho_{2}$, the proof for censored data points does not argue $\rho_{1}$ and $\rho_{2}$. An equation for censored data points analogous to the equation for uncensored data points (between lines 537-538) must be presented.
+ The proof of Theorem C.1 completely ignores $R$, even though Theorem C.1 does not hold if $R=1$. (I think that the main idea of the proposed method, CSD-iPOT, is to use a sufficiently large $R$ to "blur" the censored data points.)
+ The assumptions used in the proof of Theorem C.2 are not clearly stated before the proof: many implicit assumptions are used in lines 563 and 564. In particular, during the proof of (i), a statement (i.e., an implicit assumption) similar to (i) is used in line 563.
+ In the proof of Theorem C.2, the alleged proof of (i) on $x_{n+1}$ does not include any discussion on $x_{n+1}$.
------------------------
# Additional Comments
I submitted the following comments in the Author-Reviewer discussion period, but it accidentally did not visible to the authors (probably due to the complex system on comments visibility of OpenReview). I noticed this fact during the Reviewer-AC discussion period, and the AC allowed me to post the comments here.
==comments begin==
Thank you for your comments. I will keep my score.
This paper has several critial problems.
+ The authors' comments did not give any evidence that the proposed algorithm achieves conditional calibration (claimed in lines 47-48). Since the hardness of the conditional calibration is an important topic in machine learning as already studied by many researchers, the authors must pay careful attention when they discuss on this topic.
+ Huge discrepancy between the implemented algorithm (with R=1000) in the experimental section and the provided proof (valid only for R=1), even though the key idea of the proposed algorithm CSD-iPOT is to "blur" a censored subject with a large
.
Regarding the presentation, all the assumptions must be clearly presented before the proof. The assumption is stated at the end of the proof (in lines 546-548).
Minor thing:
The authors violated the rule on the 1-page pdf in the rebuttal phase: "Please use this PDF only for figures (including tables) and captions that describe the figure."
==comments end==