Large language model validity via enhanced conformal prediction methods

We develop new conformal inference methods for obtaining validity guarantees on the output of large language models (LLMs). Prior work in conformal language modeling identifies a subset of the text that satisfies a high-probability guarantee of correctness. These methods work by filtering claims from the LLM's original response if a scoring function evaluated on the claim fails to exceed a threshold calibrated via split conformal prediction. Existing methods in this area suffer from two deficiencies. First, the guarantee stated is not conditionally valid. The trustworthiness of the filtering step may vary based on the topic of the response. Second, because the scoring function is imperfect, the filtering step can remove many valuable and accurate claims. We address both of these challenges via two new conformal methods. First, we generalize the conditional conformal procedure of Gibbs et al. (2023) in order to adaptively issue weaker guarantees when they are required to preserve the utility of the output. Second, we show how to systematically improve the quality of the scoring function via a novel algorithm for differentiating through the conditional conformal procedure. We demonstrate the efficacy of our approach on biography and medical question-answering datasets.

Paper

References (36)

Scroll for more · 24 remaining

Similar papers

Peer review

Reviewer tBPp5/10 · confidence 5/52024-07-12

Summary

The paper proposes a new way to filter out LLM generations such that the resulting text only contains a set number of invalid claims with a certain probability. To do so, the authors adapt a new conformal mechanism to be level adaptive i.e. conditioned on the prompts rarity for example. They also propose a boosted version which additionally reduces the number of wrongly removed items in the generations set of claims. They then conduct experiments on synthetic and wikipedia data to confirm they claims.

Strengths

- The paper proposes a level adaptive CP algorithm which to the best of my knowledge has not been done before in the LLM setting. - The paper is clearly written (for someone who has published in CP before it was easy to follow) - The paper tackles an important problem of hallucinations in LLMs which is timely and crucial for trustworthy LLMs - The paper also proposes a boosted CP version and elegantly solves the new challenges albeit the main ideas were already introduced in Stutz. There is nonetheless novelty in the additional challenges to make it conditional. Prop 3.1 in particular is an interesting observation given the linearity - The experiments overall show the superiority of the proposed methods compared to the current baselines. (there seems to be only one)

Weaknesses

- The paper starts off unfairly in figure 1, where the authors fixed a level of 90% for the baseline and 76% for the proposed method. This is misleading as one could easily also pick a lower coverage rate for the baseline and it would potentially look much less bad. This is concerning as it misleads the reader quite drastically until one reads the caption. Could you please explain why you chose 90% for the baseline but then only 80% for yours? Maybe i misunderstood your intentions with this figure. - Secondly, I would like to note that the original conformal guarantees are finite sample however, if i understood correctly, this is no longer the case here eq (3), thm2.1. Hence my question is that are there any other baselines to compare against that are not conformal? I believe that this paper misses a substantial related works section. - Thirdly, the experiments in the wikipedia dataset were choses with at most 3 wrong claims. Why did you choose 3 and not 0, 1 or 2 ? The fact that these experiments werent added in the appendix as ablation makes me question that 3 was chosen specifically to show the benefits of this paper. Please add these additional experiments for completeness as this number 3 was chosen out of nowhere. This also leads me to my next concern which is that of, even if we have at most 3 wrong claims, we can still not point to which one is wrong ... Could the authors please elaborate on the usefulness of this in the first place? Shouldnt you set the threshold to 0 wrong claims? This is a major concern from my side as this guarantee doesnt allow me to do anything useful in practice. - Fourthly, I also agree with the authors that the exchangeable assumption is a big drawback of this method in practice. The method that needs to be trained with the conditional boosting, is fixed for a given type data. This can be quite limiting. - Lastly, there are not sufficient experimental results to support your claims. You have a single toy experiment with some Wiki dataset. Additional experiments or at least extensive ablation studies would be needed to convince me about the usefulness of this method.

Questions

Please see above. I am more than happy to raise my score if the above have been addressed.

Rating

5

Confidence

5

Soundness

3

Presentation

3

Contribution

2

Limitations

Yes

Reviewer R2Vh7/10 · confidence 3/52024-07-12

Summary

The paper introduces two new conformal prediction methods aimed at enhancing the validity of large language models. The first method generalizes the conditional conformal procedure to issue weaker guarantees when necessary, thereby preserving utility. The second method improves the quality of the scoring function through a novel algorithm designed to differentiate the conditional conformal procedure. The proposed methods are validated using both synthetic and real-world datasets, addressing deficiencies in existing approaches by ensuring conditional validity and retaining valuable and accurate claims.

Strengths

- The introduction of generalized conditional conformal procedures and improved scoring functions addresses critical gaps in current approaches. - The paper is technically sound, with well-supported claims and robust experimental validation. The theoretical results, particularly Theorems 3.1 and 3.2, and Proposition 3.1, are well stated and proved. The methodology is well-developed, and the experimental design effectively demonstrates the efficacy of the proposed methods. - The methods are evaluated on both synthetic and real-world datasets, effectively showcasing their practical utility and robustness.

Weaknesses

- The methodology assumes the existence of an annotated calibration set of prompt-response-claim-annotation tuples, which may raise questions about the generalizability of the approach to different datasets or domains. - Some readers may not be familiar with the metrics used to evaluate the method. Providing additional explanations for these metrics would enhance clarity and understanding.

Questions

How sensitive is the methodology's performance to variations in the size and composition of the calibration set? How representative is this dataset of real-world large language model outputs?

Rating

7

Confidence

3

Soundness

3

Presentation

3

Contribution

4

Limitations

The authors adequately address the limitations of their work in Section 5.

Reviewer 9DaN7/10 · confidence 4/52024-07-13

Summary

The paper presents two new conformal inference methods for obtaining validity guarantees on large language model (LLM) outputs. The authors consider the task of filtering invalid claims from LLM responses to ensure high probability factuality guarantees on the filtered output. They discuss two limitations of existing approaches and how their methods improve upon them – (i) previous methods provide a marginal guarantee over a random test prompt instead of conditional validity, and (ii) existing methods may remove too many claims as the score function is imperfect. To improve upon these, the authors generalize the conditional conformal framework of [1] to adapt the filtering threshold that controls monotone risks and adjust the error rate adaptively (level-adaptive conformal prediction). The second method introduced in the paper termed conditional boosting enables automated discovery of superior claim scoring functions via differentiation through the conditional conformal algorithm i.e., finding conformity scores that allow retaining more claims in the LLM output while also ensuring validity. The authors perform experiments on synthetic and real-world datasets to demonstrate the performance of their methods and improvement upon existing approaches.     [1] I. Gibbs, J. J. Cherian, and E. J. Candès. Conformal prediction with conditional guarantees. arXiv preprint arXiv:2305.12616, 2023.

Strengths

**Originality**: The main novel contribution is the conditional boosting procedure that allows automatic discovery of new scoring functions that enable higher claim retention via differentiation through the conditional conformal algorithm. While the paper leverages the conditional conformal procedure in Gibbs et al [1] and conformal factuality framework from Mohri and Hashimoto [2], the generalization of [1] to incorporate general losses and adaptive error rate is a novel and important contribution. To add, the previous work is adequately cited in the paper. **Quality**: The submission is technically sound and the claims are well supported by theory. The experimental results empirically demonstrate the performance improvements of the methods introduced over previous approaches. **Clarity**: The submission is well-written and clear for the most part. I appreciate the introduction to conditional conformal procedure of Gibbs et al. [1] in section 2.1. It would be helpful to organize the empirical analysis better to understand the setup and make performance improvements offered by different methods more clear. **Significance**: The conformal inference methods proposed in the paper provide practically useful guarantees for LLM outputs. I believe the conditional validity formulation and evaluation are important contributions and the results will be of interest to the community. **References** [1] I. Gibbs, J. J. Cherian, and E. J. Candès. Conformal prediction with conditional guarantees. arXiv preprint arXiv:2305.12616, 2023.   [2] C. Mohri and T. Hashimoto. Language models with conformal factuality guarantees. arXiv preprint arXiv:2402.10978, 2024.

Weaknesses

The main weaknesses and scope for improvement are wrt the empirical evaluation: 1. Lack of ablations - While the experiments include comparison with the split conformal calibration method of Mohri and Hashimoto [2] for the Wikipedia biographies dataset, I did not see comparison of the level-adaptive method with the fixed level conditional conformal procedure in [1] (where $\mathcal{F}$ can probably just be a linear combination of group indicators?). I believe this would also help understand the contribution of the level-adaptive method. - How do different sub-claim scoring functions compare to each other in practice? 2. Lack of justification behind the choice of score functions and function class $\mathcal{F}$ - Why is the conformity score chosen as naive absolute score value in Fig 4, 7? How would the results change if a better score function is selected? While the validity will always hold true, the empirical performance can give better practical insights (as is the intended goal of the paper). 3. Additional comment on organization of results: In its current form, it is hard to understand the experimental setup and variations of the method used for different figures. The experiments section can be organized better for greater clarity. **References** [1] I. Gibbs, J. J. Cherian, and E. J. Candès. Conformal prediction with conditional guarantees. arXiv preprint arXiv:2305.12616, 2023.   [2] C. Mohri and T. Hashimoto. Language models with conformal factuality guarantees. arXiv preprint arXiv:2402.10978, 2024.

Questions

1. It seems that both methods require an additional step of data splitting. Would this introduce high variance if there are not enough samples in some subgroups? (it would also be helpful to mention the number of samples in each group e.g. in Fig 2, where there are just 381 total test points) 2. Is there any specific reason why experiments were not performed on other real datasets studied in Mohri and Hashimoto? 3. Typo: shouldn't it be $Y_{n+1}$ in Theorem 2.1?

Rating

7

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

The authors discuss limitations in the Limitations section.

Reviewer 9DaN2024-08-11

I thank the authors for addressing the questions and for sharing additional experiments. I look forward to the revision with suggested changes in future versions. I remain positive about the work and would like to keep my score as above.

Reviewer CDbE6/10 · confidence 4/52024-07-13

Summary

The paper provides a conformal prediction framework for the generation of hallucination risk-bound. The method can involve any loss function instead of the 0-1 loss as traditional conformal classification. They also provide a conditional (group) conformal prediction guarantee. They optimize the loss function with improved conformal prediction efficiency.

Strengths

1. The paper is well-structured and well-written. The background and related work in Sec 2 can be helpful for readers not familiar with the background. 2. Conformal prediction for LMs can provide statistical guarantee on the generation risk, which is important for universal deployment of diverse LLMs.

Weaknesses

1. [Generalization to alternative targets]: the rigorous proof is lacking about why the prediction set provided by lines 191 and 192 can lead to the conformal prediction guarantee. In line 181-187, the paper claims some assumptions on the loss function to be used. However, how these assumptions are used to derive the final valid conformal prediction guarantee is missing. 2. [Generalization to alternative targets]: conformal risk control methods [1] with a similar guarantee should be included in the discussion. [1] Angelopoulos A N, Bates S, Fisch A, et al. Conformal risk control[J]. arXiv preprint arXiv:2208.02814, 2022. 3. [Generalization to alternative targets]: missing related work [2,3] on risk control of LLMs with conformal prediction [2] Kang, Mintong, et al. "C-rag: Certified generation risks for retrieval-augmented language models." ICML 2024 [3] Quach, Victor, et al. "Conformal language modeling." ICLR 2024 4. [Level-adaptive conformal prediction]: Equation (8) use different $\alpha$ for the pinball loss (different $\alpha_i$), which can breaks the pinball loss formulation in Equation 4 and might also deteriorate the original conclusion of prediction coverage of $1-\alpha$. Do the authors have any justifications on it? 5. [Level-adaptive conformal prediction]: I think the designed level-adaptive conformal prediction is not that effective. If our goal is to use an adaptive level $\alpha$ for a particular example, why not directly do the conformal calibration with the particular $\alpha$ so that we can get the desired coverage? I am confused on the final goal of the method in Sec 3.2. What the adaptivity here different from what I am thinking? 6. [Conditional boosting]: The conformal training method (reference [18] in the paper) optimizes $\theta$ in an end-to-end way, but the paper claims that it is unclear how to backpropagate through the estimated cutoff in Line 236. What makes the difference in the scenario?

Questions

Please refer to the weakness part for concrete questions and concerns.

Rating

6

Confidence

4

Soundness

2

Presentation

3

Contribution

2

Limitations

discussed in Sec 5

Reviewer CDbE2024-08-11

Thanks for rebuttal

I would like to thank the authors for the clarifications. My concerns 1,3,4,5 are addressed, but for Q2 and Q6, I appreciate additional clarifications: Q2: In conformal risk control paper, the conformal guarantee is valid for any risk function and any parameterized generation algorithm. Therefore, the method can be exactly tailored for the problem here. Concretely, the algorithm can be exactly cutting off claims with low scores with the parameter as the threshold. By running conformal risk control, we can identify the sets of parameters (i.e., thresholds for cutting off) which achieve valid hallucination risk. In this sense, the contribution in sec 3.1 is not the first trial in the conformal literature and I would like that the authors clarify more on the novelties for Sec 3.1. Q6: I do not understand why the objective leads to additional challenges. The difference that paper made compared to standard conformal prediction is to use another adaptive loss function as the conformity scores. Why this will lead to a non-differentiability challenge? In particular, why is this not resolved with differentiable sorting as conformal training paper?

Authorsrebuttal2024-08-12

Further clarification

We thank the reviewer for their considered response and hope that the clarifications below address both of their questions. 1) We will revise Section 3.1 to precisely describe the similarities and differences between our work and previous methods. In short, conformal risk control generalizes split conformal prediction to **marginally** control a monotone loss. Analogously, Section 3.1 shows how to generalize the conditional conformal method (Gibbs, Cherian, and Candes 2023) in order to obtain **conditional** control of a monotone loss. We agree that one could apply conformal risk control to this problem, but the resulting guarantee would not match the one provided in Section 3.1. 2) We believe that the reviewer has misunderstood our contribution. Our method is not equivalent to running split conformal prediction on some adaptive choice of conformity score. Instead, given any pre-defined conformity score, our paper shows how to compute a conditionally valid and calibrated estimate of its quantile. For context, because it only targets marginal validity, split conformal prediction uses the sample quantile (i.e., a particular sorted conformity score) in place of our more sophisticated estimator. Running a method analogous to conformal training requires us to differentiate our quantile estimator, but it is not obvious that this derivative exists. This is because our estimate is given by the solution to an optimization problem with a non-differentiable objective. Our contribution is to show that despite this challenge, our final quantile estimate is locally linear in the calibration scores.

Reviewer CDbE2024-08-13

Thanks for clarification

Thank the authors for clarification! After reading other reviews and thinking with the clarified points, I remain positive on the paper and raise score to 6.

Reviewer tBPp2024-08-08

Response

1. Thanks for the clarification, however in practice one could simply pick alpha based on a heuristic i.e. i want to retain x% of the sentence and hence i can simply pick that. This would simple require a few easy heuristic steps from the calibration data which is on par with your additional need for compute to do boosting. What i am saying is this is purposefully taken to make baseline methods look bad. In practice if someone were to take 90% and see that they only retain so little claims, they would simply lower alpha. From this perspective can the authors please explain how this is not a trivial heuristic to compare against? Happy to keep this discussion in case i missed something, but the fact that you simply use 90% and then the adaptive method uses mostly around 70-80 is just misleading to me. I could easily find a fixed heuristic that does pretty much the same. I want to see concrete experiments where this slight adaptation towards the test sample benefits the end user in a significant manner. 2. If it is truly finite sample, could the authors please tell me how the intervals scale with increased calibration data? The theorem has an expectation. 3. The authors did not address why 3 was chosen except to make the results look good. I see in the attached pdf that you have results on the medical data that have 0 errors. I agree in settings where the model is presumably decent, this is achievable. In the Wikipedia dataset i assume that using 0 errors will make the whole method somewhat useless at below 50% guarantees. My main question is, if you say you have at most 3 errors, and cant tell the user which ones are the errors, what can the user possibly do with that information? The only use case is the 0 errors. 4. Can the authors explain this covariate shift theory in more detail please. i might have missed that part. 5. I thank the reviewer for the additional experiments. However as mentioned previsouly a simple heuristic of trying to pick the desired alpha based on how many sentences to retain would be just as usable. and hence my main question here is what the concrete advantages of this adaptive nature is. Looking at the histograms the nominal values seems to be unimodal. I am not saying to use this as a guide but a separate computation (heuristic compared to your adaptive method) where given some calibration data, we go over alpha [10, 20, ... 90%] and then pick the alpha which fits the desired retention level seems like a basic baselines to me. Happy to keep this discussion going as there might be some parts i might have missed or misunderstood. but i believe the above is still valid and would like the hear the authors answers to them before increasing the score.

Authorsrebuttal2024-08-09

Reply to 1-3

Thank you for the feedback and your openness to further discussion. We hope that these responses fully address your concerns. 1) One could certainly pick the fixed level of $1-\alpha$ based on a heuristic using the calibration data. For example, one may choose $1-\alpha$ to be the mean or median of the fitted function $1-\hat{\alpha}(X_{n+1})$. We will include these comparisons in the appendix. But as shown in the histograms attached to the global rebuttal, we find that $1-\hat{\alpha}(X_{n+1})$ takes on a large range of values (between 0.5-0.9 for the **MedLFQA** dataset and between 0.84-0.97 for the **FActscore** dataset). The only way to ensure good claim retention on all test examples would be to use the minimum value of $1-\hat{\alpha}(X_{n+1})$ (i.e. 0.5 for **MedLFQA** and 0.84 for **FActscore**). However, this would be needlessly liberal for many of the test points. Figure 6 on page 15 of the submission demonstrates that this level adaptivity is qualitatively important. The plotted points display the level at which 80\% of claims are retained; note that this level depends strongly on the number of views of the associated Wikipedia article. This figure shows that a single choice of level would not perform similarly to our method, and we will point the reader to this plot in order to emphasize this point in the main text. One may also envision a simple theoretical setting in which test-time level adaptivity is required. Consider a two-groups model in which we have systematically higher claim scores for one group vs. another. We cannot issue guarantees at a constant level *and* preserve an equal number of claims in both groups. Last, the goal of Figure 1 is to demonstrate that we cannot issue the typical "high probability" conformal guarantee while still retaining most claims. The final panel then shows what our method does. We prominently display the weaker guarantee of our method, so it is unclear to us what the reviewer means by misleading the reader. 2) The guarantee associated with conformal prediction holds in expectation over the calibration set (see: Proposition 1 in Shafer and Vovk's tutorial, Eq. 1 in Angelopoulos and Bates' Introduction). The previous work of Gibbs, Cherian, and Candes (2023), where the conditional targets we consider were originally introduced, shows that a larger calibration set allows the user to target a richer set of conditional guarantees, i.e. a richer function class $\mathcal{F}$. In particular, Figure 3 of that paper shows that if the calibration dataset is too small relative to the dimension of $\mathcal{F}$ the intervals (in a regression setting) or the number of filtered claims (in the LLM setting) will be quite large. Reviewer R2Vh also asked about this and in our revision we will look to update the article with a discussion that points readers to that reference. 3) The results look very similar (i.e., our methods are well-calibrated and give consistently above-target claim preservation) when the number of errors is chosen to be $0$. Unfortunately, OpenReview will not allow us to upload additional figures at this time, but we emphasize that we choose to display the $3$ error output primarily because we believe that a larger value for $1-\alpha$ would lead to a more interpretable statement for the reader. We disagree with the reviewer's claim that we chose this value because it makes our results look good. The guarantees of our method hold regardless; the low probability guarantee demonstrates that existing claim scoring functions are insufficiently accurate for this particular dataset, not that our method has significant flaws. In addition, there are many problems where we believe that such a guarantee is reasonable. Imagine we asked an LLM for a list of options, e.g., a list of $20$ restaurants suitable for a vegetarian. We are using the LLM to assemble a plausible list for further follow-up work, so some (though not too many) errors are tolerable. We do not intend for this example to be a prescriptive description of how our method must be used, but rather an example of one possible application and loss function. The contribution of our paper is a framework for filtering claims from LLMs with rigorous guarantees.

Authorsrebuttal2024-08-09

Reply to 4-5

4) In order to streamline the paper, we did not give an in-depth discussion of the connection between our guarantees and covariate shift. The work of Gibbs, Cherian, and Candes (2023), which introduces these conformal coverage targets extensively discusses the relationship between the conditional guarantees we consider and robustness to covariate shift. We will look to include information about this connection between our results and covariate shift robustness in our revision.\ For now, to understand this connection we remark that our method gives robustness to covariate shifts in which the training data $\\{(P_i,R_i,\\mathbf\{C\}\_i,\\mathbf\{W\}\_i)\\}\_{i=1}^n$ are sampled i.i.d. from a distribution $Q$, while the test point is sampled from the covariate shifted distribution $(P\_\{n+1\},R\_\{n+1\}) \sim f(P\_\{n+1\},R\_\{n+1\}) dQ\_\{(P,R)\}$ and $(\mathbf\{C\}\_\{n+1\},\mathbf\{W\}\_\{n+1\}) \sim Q_\{(\mathbf\{C\},\mathbf\{W\}) | (P,R)}$. Here, we use the notation $f(P\_\{n+1},R_{n+1\}) dQ\_\{(P,R\)}$ to refer to the distribution in which the covariate space is re-weighted by $f$. More precisely, using the subscript $f$ to denote the re-weighting, we have that for any set $A$, $$ \\mathbb\{P\}\_f((P\_\{n+1\},R\_\{n+1\}) \in A) = \\frac{\\mathbb{E}\_Q[f((P,R)) \\mathbf\{1\}[(P,R) \in A]]\}{\\mathbb\{E\}\_Q[f(P,R)]\}. $$ Using these definitions, our Theorem 3.1 has the immediate corollary that (under the assumptions and setting stated in the theorem), $$ \\mathbb\{P\}\_f(L(\\hat\{F\}(\\mathbf\{C\}\_\{n+1\} ; \\hat\{\tau\}\_\{\\text\{rand\}\}(X\_\{n+1\}) ), \\mathbf\{W\}\_\{n+1\}) \\leq \\lambda ) = 1-\\alpha, $$ for all non-negative functions $f \in \mathcal{F}$ with $0 <\mathbb{E}_Q[f(P,R)] < \infty$. This means that for all covariate shifts belonging to the class $\mathcal{F}$, the filtering procedure is guaranteed to control the loss with probability $1-\alpha$. 5) Following our response to point $1$, if we used e.g., the mode of the histogram, as a single fixed level for $\alpha$, the results would be unnecessarily liberal for many test points and would fail to retain a sufficient number of claims for others.

Reviewer tBPp2024-08-12

Response

1. I thank the authors for their explanations. So to be clear, alpha is adaptive per sample and hence each sample will have a difference guarantee. In that case, could the authors please clarify what the exact technical contributions are compared to [Gibbs, Cherian, and Candes 2023]. Please elaborate the exact technical contribution as to me it looks like a simple extension, but i might be wrong here. 2. The authors said "The theorems stated in our work are finite-sample exact guarantees that match the style and assumptions of those given in the conformal literature." If something holds in expectation it is not finite sample ? Finite sample means that the theoretical guarantee is dependent on the number of calibration datapoints. I am just confused how you can call this finite sample and also "holds in expectation"? What i mean by finite sample is that there is a term such as 1/n in the upper/lower bound, as is present in the original conformal guarantee. Did i misunderstand something? 3. Here i believe we have to agree to disagree. I do not disagree that the guarantee still holds, what i am saying is that even if a guarantee holds the resulting output can be useless. This is like having a relatively bad classifier for Cifar10 and then outputting all 10 labels in the conformal set. The guarantee still holds but the output is useless, which is what i am suspecting will happen when you choose error = 0 in the experiments in the paper. However if that is not true, i would encourage the authors to add these experiments in the final version of the paper. 4. I do not believe i understand this, in such a condensed manner and hope the authors will add a thorough discussion in the final version of the paper. 5. Agree, i do see the appeal of adaptive scores now. please clarify for my 1. in terms of relationship with existing work. The rebuttal has convinced me to some extend, however i would like the authors to add these additional experiments, mentioned above, in the final version of their paper if the paper indeed get accepted. However, if the results turn out significantly different than the authors claimed in "The results look very similar (i.e., our methods are well-calibrated and give consistently above-target claim preservation) when the number of errors is chosen to be " that the authors will retract their paper. Hence i am willing to increase my score and after careful discussion with other reviewers would consider raising the score more.

Authorsrebuttal2024-08-12

Response

Thank you for your continued openness and engagement. We hope that these responses address your concerns. 1) The technical difference is that the previous method issues a fixed $1 - \alpha$ guarantee for each test point, while ours issues a data-dependent guarantee. We would first point out that this is itself a novel theoretical goal. It may be easiest to contextualize our contribution in the more canonical regression setting. Translating our results to this task, our work shows how to generate a calibrated prediction set whose size is consistently small. Independently of the LLM problem, our method presents a new approach to an active research area in conformal prediction: prediction set efficiency. Rather than designing conformity scores that we hope will lead to small prediction sets (which is not always possible), we can adjust the coverage guarantee to achieve this same goal. Second, we do not believe that it is obvious how to define and achieve a meaningful level-adaptive guarantee. For example, another reviewer asked why we cannot simply run the conditional calibration procedure at the fixed level given by the $\alpha(\cdot)$ function estimated using the first data split. Unfortunately, this approach subtly breaks the exchangeability argument underpinning the proof of Gibbs, Cherian, and Candes. Our procedure circumvents this obstacle by estimating a data-dependent quantile for each calibration point, thereby preserving the symmetry of the algorithm. Achieving the calibration result we present in this paper requires us to not only modify the quantile regression presented in Gibbs, Cherian, and Candes, but also to think carefully about how one might design the function class used in their procedure. In our experiments, for example, we show that it is possible to add polynomials and group-indicators in $\alpha(\cdot)$ to $\mathcal{F}$ in order to achieve so-called smooth and binned calibration error guarantees. 2) We believe that the reviewer has misunderstood. Finite-sample does not require that the theoretical guarantee depends on the number of data points or that it must not hold in expectation. In particular, finite-sample guarantees can be exact (i.e., there is no error depending on $n$) and any guarantee that is stated in terms of a probability can be rewritten as an expectation over an indicator function. The conformal guarantee that the reviewer refers to is $$1 - \alpha \leq \mathbb{P}(Y_{n + 1} \in \hat{C}(X_{n + 1})) \leq 1 - \alpha + \frac{1}{n + 1}.$$ Here the probability is taken over both the randomness in the test point and the calibration set used, i.e., it holds in expectation over both sets of random variables. However, a minor auxiliary randomization yields an exact finite-sample guarantee for conformal prediction, i.e., $\mathbb{P}(Y_{n + 1} \in \hat{C}\_\{\text\{rand.\}\}(X_{n + 1})) = 1 - \alpha$. Our procedure is also randomized to achieve an exact finite-sample guarantee (this is why you do not see any $1/n$ terms). It is possible to define a non-random construction for our quantile estimator, but we do not describe this method in the paper. Compared to the typical conformal guarantee, the upper bound would be modified from $1/(n + 1)$ to $\frac{d}{n + 1} \cdot \frac{1}{\mathbb{E}[\max_{i \in [n + 1]} f(X_{n + 1})]}$ where $d$ is the dimensionality of $\mathcal{F}$ (e.g., the number of groups). If $\mathcal{F}$ is chosen to be some collection of group-indicators, note that the second fraction in this upper bound is equal to $1$. 3) Though we agree that some users may not find the output of the $0$-error guarantee useful, we re-emphasize that the only degradation is in the nominal level offered (30-50\% instead of 80-95\%). Our method remains well-calibrated and retains ~70\% of the original claims. Even if the reviewer believes that relaxed error guarantees are not useful, we contend that there is value in honestly quantifying the high level of uncertainty inherent to issuing strong guarantees via deficient claim scoring methods. 4) We will do so. Apologies for any confusion.

Reviewer R2Vh2024-08-09

Thanks for the clarification. I remain positive about the work.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC