- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper applies the concept of credal sets and the decision-theoretic interval-dominance rule to obtain better answers and a more accurate confidence score in LLMs. As a basis, the authors propose using the output probability distributions over answers from different LoRA models and differently than in a classical Bayesian setting do not average them, but rather represent them as a credal set. The major contribution is the credal decoding algorithm, which decodes multiple sequences in parallel and selects which to pursue based on the interval-dominance rule. Secondly, the authors apply the interval-dominance rule both at the token level and at the semantic sequence level to map a credal set to a prediction set and, next, retrieve a confidence assigned to it. In experiments across multiple datasets, the retrieved confidence outperforms sampling-based methods and confidence scores derived from LoRA ensembles or Bayesian LoRA methods on multiple objectives, ranging from separating correct from incorrect predictions (AUROC) to calibration metrics such as ECE and NLL.
Critical strengths
Key Strength 1
Sound Theory & Good Translation into a Practical Method
Credal Set-based approaches have recently received more attention in the UQ literature. Using interval dominance to make decisions is an interesting approach that the authors translated well into an LLM setting. The idea of using interval dominance at the token or semantic level would have been interesting but small-scale, so I see the key contribution in the credal decoding algorithm, which I find well thought through and with nice properties.
Consequence for assessment: The method is theoretically motivated, and the theory is well translated into practice.
Not a key strength, but nonetheless, I want to highlight this:
Especially compared to other papers in my batch, this paper was significantly better written and, in my opinion, meets the bar for an A* conference (manuscript-wise).
Critical weaknesses
Key Weakness 1
Concern about short sequence bias in credal decoding
In Credal Decoding (3.3), the updates are an addition of log probabilities without length normalization. This inherently favors shorter sequences. The algorithm at every step (once at least one completed sequence has been generated) checks if a partial sequence (which is at least the same length?) has an upper mass greater than the lowest mass of the completed sequence. Naturally, as the partial sequence grows longer, its probability decreases; hence, at some point, it seems quite likely that every partial sequence will be pruned simply to the fact that a completed sequence is shorter. It seems that evidence for this is itself presented in Experiments ((iv) L410).
A simple fix would be to length-normalize the sequence probabilities, which is commonly used in decoding strategies. Unfortunately, I think that this would break the math regarding the unexplored mass, as, to my understanding, the formulation in equation (4) assumes that the whole distribution over all sequences sums to 1. This would unfortunately no longer be given with length normalization.
Consequence for assessment: As of now, it seems to me that the proposed method is unsuitable for generating longer sequences, and a straightforward fix would break the math. This limits the method's applicability to very short tasks.
Key Weakness 2
Ensemble baseline comparison
As L315/316 states, “ensemble methods rank the same answer, the CSC representative”, i.e., the prediction to which the confidence estimate is provided belongs to the candidate provided by the credal decoding method. Naturally, the credal decoding confidence estimate (the largest lower probability) is tailored to exactly this prediction, whereas this is not the case for the ensemble methods. As such, I am questioning whether this is an unfair advantage here. Moreover, as it seems (Appendix D.3), the LoRA Ensemble uses only the first token distribution to build predictive entropy and mutual information. Especially for multi-token predictions, this seems like a severe handicap that could be fixed by using a distribution over semantic classes, as in the credal decoding method.
Consequence for assessment: As of now, I am not confident in the comparison of numbers in Tab1 and Tab2 between CLLM and LoRA Ensembles.
Questions for authors
Q1: Key Weakness 1
Could you please comment on the short-sequence bias and (if feasible) present a small subset of results using length-normalized probabilities?
Q2: Key Weakness 2
Please evaluate the numbers in Tab1 and Tab2 for LoRA Ensembles and CLLM, both when greedy and when using, e.g., the MAP estimate of the LoRA predictive posterior distribution. Moreover, please comment on the implementation of the ensemble and the problem that they only use the first token distribution. Should this be the case, an extension to use the semantic distribution would be helpful.
Other Questions:
Q3: Compute: If correctly understood at every step, the algorithm has B partial sequences and M adapters. Hence, one step runs BxM forward passes (According to experiment setup D.4, this is then 8x5 = 40 forward passes). This seems like substantial compute and is not equivalent to M model passes (as stated in the limitations - this is only the case for 1 token prediction). Could you please clarify this and potentially revise the limitations?
Q4: Accuracy of Credal Decoding: For me, the core part of the paper is the credal decoding method, which can find different sequences than, e.g., beam search or greedy search. The paper's framing, however, emphasizes the uncertainty-confidence aspect. Do you have evidence that if
Q5: What is the sense of recording a truncation? This was mentioned in the algorithm but then never again.
Suggestions to the authors
- Overall, I am missing a bit of the red thread (beyond the theory) for the main goal. Is it creating better answers through credal decoding? Is it creating a good confidence score that outperforms existing ones (UQ literature)? Is it providing set-based prediction? All of these topics are discussed, and I think the paper would benefit from narrowing the story further and placing additional material in the appendix.
- Similar to the point above, I think one could bring CTC and CSC CLLMs together under the umbrella of interval dominance on credal sets. Then one could emphasize the section on credal decoding more.
- Minor Things:
- Tables on page 7 are very close to the text (overall, I feel the main text could be made a bit more concise)
- Figure 3: “The rule decides where a tuned threshold would, and withdraws when the evidence is corrupted” → Caption seems to be missing something
- Appendix E8 → blue color of text
While I am currently leaning toward a weak reject, I am very much open to raising my score if my points are addressed or clarified.
10 comments
W2, Q2: We thank you for these questions, which we have answered with the requested experiments. Scoring on the CSC representative does not favour CLLM: on its own MAP answer the LoRA Ensemble shows no systematic gain, and we have added the LoRA Ensemble over meanings you suggest.
In Tabs. 1 and 2 every method built on the adapters ranks the CSC representative, so only the score differs (L318-320). We now also score the LoRA Ensemble on its own MAP answer (the meaning with the largest mean-pooled probability) and on its own greedy answer (decoded token by token from the mean-pooled distribution of the five adapters). The MAP answer equals the CSC representative on 86-92% of open-ended prompts for Llama and Gemma and 73-86% for Qwen, and on 94-99.6% of four-option questions, where greedy and MAP coincide. It is less accurate than the CSC representative on TriviaQA with the passage (85, 80 and 75% against 86, 83 and 76%) and level or slightly more accurate on CoQA (75, 79 and 76% against 75, 78 and 74%; Tab. 11, k=1, and Tab. 3). The greedy answer of the base model is the Standard LLM in Tabs. 1 and 2 (§4.1, L308-310; §D.3, L1168-1169).
Table H: The LoRA Ensemble scored on its own answer. The paper's LoRA Ensemble (predictive entropy, five adapters mean-pooled): change when it is scored on its own MAP answer or its own greedy answer instead of the CSC representative, as in Tabs. 1 and 2; all three answers are scored in the same run. On the four-option datasets the greedy answer is the MAP letter.
| Setting | AUROC against own errors (Tab. 1): change on own MAP answer / own greedy answer | Acc@80% (Tab. 2), points: change on own MAP answer / own greedy answer |
|---|---|---|
| CoQA, Llama | -0.022 / -0.013 | +0.0 / -5.0 |
| CoQA, Gemma | -0.003 / +0.030 | +1.5 / -4.0 |
| CoQA, Qwen | -0.003 / -0.003 | +1.5 / -1.5 |
| TriviaQA with the passage, Llama | -0.009 / -0.001 | -0.5 / -2.5 |
| TriviaQA with the passage, Gemma | -0.002 / +0.007 | -1.5 / -10.0 |
| TriviaQA with the passage, Qwen | +0.011 / +0.004 | -1.5 / -2.5 |
| Closed-book TriviaQA, Llama | -0.004 / -0.014 | +1.5 / -3.0 |
| Closed-book TriviaQA, Gemma | +0.010 / +0.014 | -1.5 / -7.0 |
| Closed-book TriviaQA, Qwen | +0.019 / +0.025 | +1.0 / -4.5 |
| OpenBookQA, Llama | +0.020 / +0.020 | +1.0 / +1.0 |
| OpenBookQA, Gemma | -0.016 / -0.016 | +0.0 / +0.0 |
| OpenBookQA, Qwen | -0.004 / -0.004 | +0.0 / +0.0 |
| ARC-Challenge, Llama | +0.023 / +0.023 | -1.3 / -1.3 |
| ARC-Challenge, Gemma | +0.008 / +0.008 | +0.0 / +0.0 |
| ARC-Challenge, Qwen | -0.008 / -0.008 | +0.0 / +0.0 |
On its own MAP answer (Table H), the ensemble's AUROC against its own errors changes by at most 0.023 with predictive entropy (0.029 with mutual information) and its Acc@80% by at most 1.5 points (2.0), and the predictive-entropy AUROC is lower in 9 of the 15 settings and higher in 6. Its corrupted-context AUROC cannot change, because predictive entropy and mutual information do not depend on the answer returned. On its own greedy answer, the ensemble is less accurate than the CSC representative in all nine open-ended settings, by 1-13 points (Q4), its Acc@80% is lower in all nine, by 1.5-10.0 points, and its AUROC moves by at most 0.030. The comparison in Tabs. 1 and 2 is therefore not sensitive to which answer the ensemble is scored on.
The paper's LoRA Ensemble uses the first-token distributions, following the original code base (§D.3, L1175-1178; §4.1, L310-311). We added the extension you propose: the five adapters mean-pooled over the same meanings as CSC, from the same credal decoding run, scored by predictive entropy, mutual information and one minus the probability of its MAP meaning, each on its own MAP answer.
Table I: LoRA Ensemble over meanings. Corrupted-context detection, AUROC; each LoRA Ensemble score is computed on its own MAP answer.
| CoQA, Llama | CoQA, Gemma | CoQA, Qwen | TriviaQA with the passage, Llama | TriviaQA with the passage, Gemma | TriviaQA with the passage, Qwen | |
|---|---|---|---|---|---|---|
| LoRA Ensemble over meanings (best of its three scores) | 0.750 | 0.722 | 0.723 | 0.684 | 0.816 | 0.770 |
| CLLM (credal bound) | 0.867 | 0.873 | 0.793 | 0.844 | 0.882 | 0.791 |
The credal bound detects corrupted context better than every score of this ensemble in all six settings (Table I), by up to 0.16; scored on its own MAP answer rather than the CSC representative, its ECE changes by at most 0.031 and its NLL by at most 0.051. It is described in §D.3 (L1191) and evaluated in Tab. 9 (§E.2, L1404) and Tab. 10 (§E.3, L1439). Against the decision (kKu7, W2), CSC with no threshold is as accurate as the best thresholded ensemble on Gemma and within 1.5 and 3.7 points on Llama and Qwen, and it commits on 3.6-7.6% of corrupted prompts, against 2.8-34.0% for the LoRA Ensembles.
Q3: We agree with your count and have corrected the limitation; the B partial sequences of a step go through each adapter together, in one batched pass.
A step runs at most forward passes, fewer after pruning, so at most per prompt. The B partial sequences share the prompt and have equal length, so each adapter runs them in one batched pass with a key-value cache (§D.1, L1139-1142): M passes per step. §E.9 (L1935-1945) reports 68-89 decoding steps per prompt on CoQA and closed-book TriviaQA, at 7-12 s per prompt, plus 5-12 s for the equivalence judgements. "M times a single model" holds for CTC, which needs one forward pass per adapter (§3.4, L259), not for CSC, which adds the decoding and the equivalence judgements (L285). The limitation now reads: “CTC costs one forward pass per adapter, and credal decoding at most B forward passes per adapter per step (§E.9)” (L486-487).
Q4: Yes: the answers credal decoding finds are more accurate than greedy decoding, both of the base model and of the same five adapters, in every open-ended setting.
Credal decoding follows every partial sequence that no completed sequence dominates, up to the width B (§3.3, L227-238), and produces the completion set on which CSC decides; the paper is framed around that decision (see Suggestions). As the question is cut off, we answer whether credal decoding finds better answers: the CSC representative is more accurate than the Standard LLM's greedy answer in all nine open-ended settings (CoQA, TriviaQA with the passage and closed-book TriviaQA, three backbones), by 3-21 points, e.g. 83 vs 62.0% on TriviaQA with the passage on Gemma. We also decode greedily from the same five adapters, mean-pooled at every token (Table J).
Table J: Greedy decoding against credal decoding. Accuracy of the answer on all clean test prompts (%), 250 per cell. CSC representative: Acc (rep.) of Tab. 3. LoRA Ensemble greedy: the five adapters mean-pooled at every token, decoded greedily on the same prompts.
| Setting | Standard LLM, greedy | LoRA Ensemble, greedy | CSC representative (Tab. 3) |
|---|---|---|---|
| CoQA, Llama | 69.2 | 68.8 | 75 |
| CoQA, Gemma | 71.2 | 72.4 | 78 |
| CoQA, Qwen | 70.4 | 72.8 | 74 |
| TriviaQA with the passage, Llama | 76.8 | 80.8 | 86 |
| TriviaQA with the passage, Gemma | 62.0 | 70.4 | 83 |
| TriviaQA with the passage, Qwen | 67.2 | 74.0 | 76 |
| Closed-book TriviaQA, Llama | 72.8 | 72.8 | 77 |
| Closed-book TriviaQA, Gemma | 67.2 | 68.8 | 76 |
| Closed-book TriviaQA, Qwen | 52.8 | 51.6 | 56 |
Decoded greedily from the same five adapters, the answer is 1-13 points less accurate than the CSC representative in all nine settings. We are happy to answer the full question.
Q5 A truncation separates what the width B left out from what dominance ruled out, and the revised §3.3 now says so (L234-236).
It records (step 3, L234-235; worked example in §C.2, L1061-1063) that the width, not dominance, stopped partial sequences from being followed. Their mass is in either way (L247-252), so the bounds stay valid, and B itself is ablated in §E.7.2 (L252).
Suggestions and minor points
S1, S2: We agree: the thread is the decision of when to commit and what to return otherwise, and the paper is built as one interval-dominance rule at two depths, with credal decoding in its own section.
The goal is the decision: when the model should commit to an answer, and what it should return when it should not (Eq. (3), L205-207). Credal decoding produces the candidates, which are also more accurate than the base model's greedy answer (Q4); the lower bound of the committed answer is its confidence, tested in Tabs. 1 and 2; and the set is what the rule returns when it does not commit, the answers no plausible predictor rules out (L207). This is already the structure of the paper: the abstract derives one commitment rule applied at two depths (L16-19); the contributions define CTC and CSC as that rule on answer tokens and on meanings (L80-92); Fig. 2 applies one interval-dominance test, Eq. (3), in both spaces (L176); §3.4 states that CTC and CSC are the same rule on two candidate sets (L286); and credal decoding is a contribution of its own (L84-88) with its own section (§3.3, L221-254). Using the extra page, the decision results (Tab. 12 of the submission) are now Tab. 3 in the main text (L432), which keeps the paper centred on the decision.
Minor: We have fixed all three: the Fig. 3 caption now reads “The rule chooses the same operating point as a tuned threshold, and withdraws when the evidence is corrupted” (L386); the spacing around Tabs. 1 and 2 on page 7 is restored; and the text of §E.8 is no longer blue.
Thank you again for a review whose questions have made the paper clearer and its comparisons stronger. We hope these answers address your points, and that you will take them into account in your assessment. We would be glad to clarify anything further.
Dear Reviewer,
Thank you for your detailed review, for your interest in credal decoding, and for being open to revisiting your score. We ran the experiments you suggested, and answer each point below.
W1, Q1:
We thank you for the careful reading of §3.3. Joint probabilities do favour shorter sequences, but pruning does not remove a continuation for being long: it removes it only when, as a whole answer, it is less probable under every adapter than one already completed.
Each partial sequence carries every adapter's log-probability of its tokens (§3.3, L226-227). Whatever its length, it is compared with the largest lower mass q∗ of the completed sequences so far (L232-233), with no length condition, and pruned only when it is dominated as a sequence (L240-242): its upper mass, the most any adapter gives to it and to every completion of it, is below q∗. Every answer it could reach is then less probable than that completed sequence under every adapter. Long completions survive: on the CoQA development split the longest completion per prompt averages 13.1 tokens for Llama and 17.9 for Qwen, and only 1.9% of completions on CoQA with Llama are cut at L (§D.4, L1203-1205; L252).
L410 of the submission is in the four-option setting, where CTC decides from the first answer token alone, so the pruning of credal decoding plays no part in that result.
It is in §4.2 (iv) (L415 in the revised version), where CTC decides from one ensemble forward pass at the first answer token (L414-415), before any sequence is extended.
We have run the suggested length normalisation: it keeps the mass accounting of Eq. (4) exact, because the unexplored mass is computed from the joint probabilities of the completed sequences, and it barely changes the decisions on the CoQA development split.
The pruning test compares per-token geometric means; everything else is unchanged.
Table G: Length-normalised pruning. CoQA development split, 500 prompts, M=5, B=8, L=32.
Length-normalised pruning follows about twice as many completions (Table G), and longer ones, yet CSC commitment changes by 1.0-1.4 points, accuracy when committed by at most 0.7 points, and the completion with the largest lower probability on committed prompts keeps its length (4.55 vs 4.56 tokens on Llama, 4.41 vs 4.40 on Qwen). On these two settings the measured decisions are insensitive to the pruning score. This is now Tab. 20 in §E.7.2 (L1774), and §3.3 states that pruning depends on probability, not on length (L242).
Eq. (4) (L247-252) defines um from the completed sequences only, and whatever the decoder leaves out remains visible through um (L252-254). Length normalisation only changes which partial sequences are followed; completed sequences keep their joint probabilities pm(h∣x), so um(x)=1−∑hpm(h∣x) still holds and the completion set and the unexplored mass sum to 1 for every adapter, for any rule that chooses which continuations to follow. Nothing in the pruning restricts answer length: L=32 is a budget fixed on the development splits (L1203-1205), and B and L do not decide which completions exist (L252-254). Our evaluation covers short-answer QA.