- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes a stepwise semantic uncertainty estimation method for long-form LLM generation. It distinguishes uncertainty across different attributes from uncertainty about conflicting meanings within the same attribute. The authors introduce an attribute-conditional kernel-based von Neumann entropy and use attribute-conditional risk to guide beam search. Experiments show improvements in hallucination detection and factual correctness.
Critical strengths
[S1] Meaningful problem formulation and methodology.
The paper distinguishes uncertainty about which attribute to generate from uncertainty about the meaning within an attribute. It proposes a method to measure it at each generation step. I believe this is a meaningful contribution because it allows semantic uncertainty to be used during generation.
[S2] Consistent empirical improvements.
The proposed method achieves the best token-level performance across all 12 settings and the best entity-level performance in 8 out of 12 settings (Table 2). It also improves factual correctness during decoding compared to the evaluated baselines (Table 3). These results show the practical value of the proposed method.
Critical weaknesses
[W1] Insufficient validation of the meaning and attribute encoders.
I understood the proposed method relies heavily on two fine-tuned encoders to distinguish meaning and attribute similarity. Even though the paper suggests some ablation, it does not provide direct evaluation of how accurately these encoders distinguish the two types of similarity on actual next-token continuations. It makes difficult to verify whether the proposed method works as intended.
[W2] Missing ablation study for the decoding method.
The decoding experiments do not include a baseline that uses a meaning-only risk penalty without attribute conditioning. Therefore, it is unclear whether the improvements come specifically from attribute conditioning or simply from adding a semantic disagreement penalty. This comparison is important to support the main contribution of the proposed decoding method.
Questions for authors
[Q1] Evaluation of the meaning and attribute encoders (W1)
The paper does not report quantitative evaluation results. Could you provide the held-out performance of each encoder, especially on generation-derived token pairs? I believe this would help verify whether the encoders can reliably distinguish meaning and attribute similarity, which is fundamental to the method.
[Q2] Effect of attribute conditioning on decoding (W2)
Table 3 shows improvements in factual correctness, but I think it is unclear how much of the improvement comes from attribute conditioning. I'd like to ask you to test an ablation that uses only meaning similarity in the decoding risk, without attribute conditioning (e.g., setting the attribute kernel to a constant in Eq. 10). This would help determine whether attribute conditioning is necessary for the reported improvements.
3 comments
Thank you for the rebuttal. I believe authors have adequately addressed my concerns. I will maintain my original score.
We thank the reviewer for engaging with our rebuttal and are glad that it addresses all raised concerns.
We thank the reviewer for their interest in our work. Below, we provide concise responses to each of the comments.
W1 and Q1: The fact that our uncertainty measure and our decoding method work in practice is already indirect evidence that the encoders work as intended. A direct evaluation is difficult in general, since there are no third-party datasets containing a ground truth for graded similarities on actual next-token continuations. However, we found this comment intriguing and decided to elaborate on it further. For this purpose, we use the test split of the labeled data that was constructed for fine-tuning the encoders (see Appendix C.1) to test whether the encoders work as intended. Ideally, the meaning (attribute) encoder should assign a high similarity to two alternatives with the same meaning (attribute) and a low similarity to two alternatives with different meanings (attributes). One caveat is that the labels in this data are binary (same or different meaning, same or different attribute) and not graded. However, this approximation should already be sufficient to see whether the encoders work as intended. We report the average similarity across pairs with the same and with different meaning (attribute) for both encoders in Table 8 and Table 9 of the updated manuscript. The results are in line with our expectations.
W2 and Q2: This is indeed also an interesting remark. To further highlight the importance of attribute conditioning, we added a baseline to our beam search experiments that uses a meaning-kernel risk without attribute conditioning (see Appendix A.2 for details). As shown in Table 3 of the updated manuscript, attribute-conditional beam search outperforms this meaning-only variant. This is in line with our expectations, since conceptually, a meaning-only risk also penalizes benign variation across attributes, which is exactly what the attribute kernel in Eq. 9 excludes. For further details, please refer to Section 5.2 and the corresponding Appendix A.2 of the updated manuscript.