content.raw: Pretty novel idea on how to estimate *semantic* uncertainty. 🤔
content.type: text
content.value: Pretty novel idea on how to estimate *semantic* uncertainty. 🤔
content.type: new_line
content.type: new_line
content.raw: Text generation tasks are challenging because a sentence can be written in multiple ways but still preserve its meaning.
content.type: text
content.value: Text generation tasks are challenging because a sentence can be written in multiple ways but still preserve its meaning.
content.type: new_line
content.type: new_line
content.raw: For instance, "France's capital is Paris" means the same as "Paris is France's capital." 🇫🇷
content.type: text
content.value: For instance, "France's capital is Paris" means the same as "Paris is France's capital." 🇫🇷
content.type: new_line
content.type: new_line
content.raw: In uncertainty quantification, we often look at token-level probabilities to quantify how "confident" an LLM is about its output. However, in this paper, the authors look at uncertainty at a meaning level.
content.type: text
content.value: In uncertainty quantification, we often look at token-level probabilities to quantify how "confident" an LLM is about its output. However, in this paper, the authors look at uncertainty at a meaning level.
content.type: new_line
content.type: new_line
content.raw: Their motivation is that meanings are especially important for LLMs' trustworthiness; a system can be reliable even with many different ways to say the same thing, but answering with inconsistent meanings shows poor reliability.
content.type: text
content.value: Their motivation is that meanings are especially important for LLMs' trustworthiness; a system can be reliable even with many different ways to say the same thing, but answering with inconsistent meanings shows poor reliability.
content.type: new_line
content.type: new_line
content.raw: To estimate semantic uncertainty, they introduce an algorithm for clustering sequences that mean the same thing, based on the principle that two sentences mean the same thing if we can infer one from the other. 🔄🤝
content.type: text
content.value: To estimate semantic uncertainty, they introduce an algorithm for clustering sequences that mean the same thing, based on the principle that two sentences mean the same thing if we can infer one from the other. 🔄🤝
content.type: new_line
content.type: new_line
content.raw: Then, they determine the likelihood of each meaning and estimate the semantic entropy by summing probabilities that share a meaning.
content.type: text
content.value: Then, they determine the likelihood of each meaning and estimate the semantic entropy by summing probabilities that share a meaning.
content.type: new_line
content.type: new_line
content.raw: There's a lot more to it, but their results look quite nice when compared with non-semantic approaches.
content.type: text
content.value: There's a lot more to it, but their results look quite nice when compared with non-semantic approaches.
content.type: new_line
content.type: new_line
content.raw: Paper: 
content.type: text
content.value: Paper: 
content.label: Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation
    in Natural Language Generation (2302.09664)
content.raw: https://huggingface.co/papers/2302.09664
content.id: 2302.09664
content.type: paper
content.type: resource
content.url: https://huggingface.co/papers/2302.09664
content.type: new_line
rawContent: Pretty novel idea on how to estimate *semantic* uncertainty. 🤔
  
  Text generation tasks are challenging because a sentence can be written in multiple ways but still preserve its meaning.
  
  For instance, "France's capital is Paris" means the same as "Paris is France's capital." 🇫🇷
  
  In uncertainty quantification, we often look at token-level probabilities to quantify how "confident" an LLM is about its output. However, in this paper, the authors look at uncertainty at a meaning level.
  
  Their motivation is that meanings are especially important for LLMs' trustworthiness; a system can be reliable even with many different ways to say the same thing, but answering with inconsistent meanings shows poor reliability.
  
  To estimate semantic uncertainty, they introduce an algorithm for clustering sequences that mean the same thing, based on the principle that two sentences mean the same thing if we can infer one from the other. 🔄🤝
  
  Then, they determine the likelihood of each meaning and estimate the semantic entropy by summing probabilities that share a meaning.
  
  There's a lot more to it, but their results look quite nice when compared with non-semantic approaches.
  
  Paper: https://huggingface.co/papers/2302.09664
  
reactions.reaction: 👍
reactions.users: osanseviero victor gsarti merve clem Citaman
reactions.reaction: ❤️
reactions.users: gsarti merve clem