- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work proposes a modification to existing LLM architectures based on random set theories, outputting belief functions instead of token probabilities. A hierarchical clustering mechanism is developed to decide the set size for good scalability. The new architecture is expected to provide better uncertainty quantifications and prediction performances based on empirical studies.
Critical strengths
The main idea of incorporating random sets and belief function prediction into LLMs is interesting and inspiring. The scalable hierarchical clustering also makes the approach practical to implement.
Critical weaknesses
- The tasks and base models tested are still limited: only QA tasks are tested, and the base models are a bit outdated. The generalizability of the approach to other task types and more SOTA models is not clear.
- The uncertainty quantification is only measured qualitatively (Figure 4). A more thorough quantitative comparison of uncertainty quantification performances among different baselines are needed.
Questions for authors
- Can you provide a training cost comparison before and after applying the random-set modifications to LLM architectures? The additional cost of the new architecture is unclear.
- The uncertainty estimation of the approach is response-wise instead of prompt-wise, right? Response-wise uncertainty/confidence has unique advantages, and it would be interesting to compare or discuss its connection to other SOTA response-wise uncertainty/confidence metrics, e.g., semantic density [1].
[1] “Semantic Density: Uncertainty Quantification for Large Language Models through Confidence Measurement in Semantic Space”, NeurIPS 2024.