Addressing Uncertainty in LLMs to Enhance Reliability in Generative AI

Ramneet Kaur, Colin Samplawski, Adam D. Cobb, Anirban Roy, Brian Matejek +6 more
11/4/2024
cs.AI

No confident code implementation found for this paper.

Abstract

In this paper, we present a dynamic semantic clustering approach inspired by the Chinese Restaurant Process, aimed at addressing uncertainty in the inference of Large Language Models (LLMs). We quantify uncertainty of an LLM on a given query by calculating entropy of the generated semantic clusters. Further, we propose leveraging the (negative) likelihood of these clusters as the (non)conformity score within Conformal Prediction framework, allowing the model to predict a set of responses instead of a single output, thereby accounting for uncertainty in its predictions. We demonstrate the effectiveness of our uncertainty quantification (UQ) technique on two well known question answering benchmarks, COQA and TriviaQA, utilizing two LLMs, Llama2 and Mistral. Our approach achieves SOTA performance in UQ, as assessed by metrics such as AUROC, AUARC, and AURAC. The proposed conformal predictor is also shown to produce smaller prediction sets while maintaining the same probabilistic guarantee of including the correct response, in comparison to existing SOTA conformal prediction baseline.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kaur2024addressing,
  title  = {Addressing Uncertainty in LLMs to Enhance Reliability in Generative AI},
  author = {Ramneet Kaur and Colin Samplawski and Adam D. Cobb and Anirban Roy and Brian Matejek and Manoj Acharya and Daniel Elenius and Alexander M. Berenbeim and John A. Pavlik and Nathaniel D. Bastian and Susmit Jha},
  year   = {2024},
  eprint = {2411.02381},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.02381v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.02381.svg)](https://codeofpaper.com/paper/2411.02381)

Discussion