paper-with-me

홈 › Papers

Log Probabilities Are a Reliable Estimate of Semantic Plausibility in Base and Instruction-Tuned Language Models

2024-03-21 · Carina Kauf, Emmanuele Chersoni, Alessandro Lenci, Evelina Fedorenko, Anna A. Ivanova

Semantic plausibility (e.g. knowing that "the actor won the award" is more likely than "the actor won the battle") serves as an effective proxy for general world knowledge. Language models (LMs) capture vast amounts of world knowledge by learning distributional patterns in text, accessible via log probabilities (LogProbs) they assign to plausible vs. implausible outputs. The new generation of instruction-tuned LMs can now also provide explicit estimates of plausibility via prompting. Here, we evaluate the effectiveness of LogProbs and basic prompting to measure semantic plausibility, both in single-sentence minimal pairs (Experiment 1) and short context-dependent scenarios (Experiment 2). We find that (i) in both base and instruction-tuned LMs, LogProbs offers a more reliable measure of semantic plausibility than direct zero-shot prompting, which yields inconsistent and often poor results; (ii) instruction-tuning generally does not alter the sensitivity of LogProbs to semantic plausibility (although sometimes decreases it); (iii) across models, context mostly modulates LogProbs in expected ways, as measured by three novel metrics of context-sensitive plausibility and their match to explicit human plausibility judgments. We conclude that, even in the era of prompt-based evaluations, LogProbs constitute a useful metric of semantic plausibility, both in base and instruction-tuned LMs.

📄 PDF Abstract BibTeX arXiv:2403.14859

Code (1)

carina-kauf/llm-plaus-prob 공식 구현

Tasks

SentenceWorld Knowledge

Methods 이 논문이 사용한 방법론

BASE 설명 없음

Similar Papers 제목 키워드 기반

A Classification Refinement Strategy for Semantic Segmentation

2018-01-23 · James W. Davis, Christopher Menart, Muhammad Akbar, Roman Ilin

Based on the observation that semantic segmentation errors are partially predictable, we propose a compact formulation using confusion statistics of the trained classifier to refine (re-estimate) the initial pixel label …

ClassificationGeneral ClassificationSegmentationSemantic Segmentation

A Bayesian baseline for belief in uncommon events

2016-02-25 · V. Palonen

The plausibility of uncommon events and miracles based on testimony of such an event has been much discussed. When analyzing the probabilities involved, it has mostly been assumed that the common events can be taken as d…

Plausibility-Driven Prioritization of Candidate Biomedical Annotations

2026-07-22 · Emanuele Cavalleri, Miad Alavinezhad, Dario Malchiodi, Marco Mesiti arxiv

The rapid growth of biomedical knowledge has made the validation of automatically generated biological annotations a major bottleneck in biomedical curation. While computational methods can rapidly produce large numbers …

Knowledge Graphs

An elementary belief function logic

2023-03-23 · Didier Dubois, Lluis Godo, Henri Prade

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, be…

Implicit Representations of Grammaticality in Language Models

2026-05-06 · Yingshan Susan Wang, Linlu Qiu, Zhaofeng Wu, Roger P. Levy 외 arxiv

Grammaticality and likelihood are distinct notions in human language. Pretrained language models (LMs), which are probabilistic models of language fitted to maximize corpus likelihood, generate grammatically well-formed …