English
Related papers

Related papers: The Quantified Boolean Bayesian Network: Theory an…

200 papers

A significant barrier to the widespread adoption of Bayesian inference is the specification of prior distributions and likelihoods, which often requires specialized statistical expertise. This paper investigates the feasibility of using a…

Artificial Intelligence · Computer Science 2025-08-13 Yongchao Huang

Large language models (LLMs) are increasingly used for conversational clinical decision support, yet they conflate next token prediction with probabilistic decision making. We argue that this conflation reflects an architectural limitation:…

Large Language Models (LLMs) often suffer from overconfidence during inference, particularly when adapted to downstream domain-specific tasks with limited data. Previous work addresses this issue by employing approximate Bayesian estimation…

Machine Learning · Computer Science 2025-01-28 Yibin Wang , Haizhou Shi , Ligong Han , Dimitris Metaxas , Hao Wang

Despite their powerful chat, coding, and reasoning abilities, Large Language Models (LLMs) frequently hallucinate. Conventional wisdom suggests that hallucinations are a consequence of a balance between creativity and factuality, which can…

Persuasion, a fundamental social capability for humans, remains a challenge for AI systems such as large language models (LLMs). Current studies often overlook the strategic use of information asymmetry in message design or rely on strong…

Computation and Language · Computer Science 2025-10-17 Buwei He , Yang Liu , Zhaowei Zhang , Zixia Jia , Huijia Wu , Zhaofeng He , Zilong Zheng , Yipeng Kang

This paper explores semi-qualitative probabilistic networks (SQPNs) that combine numeric and qualitative information. We first show that exact inferences with SQPNs are NPPP-Complete. We then show that existing qualitative relations in…

Artificial Intelligence · Computer Science 2012-12-21 Cassio Polpo de Campos , Fabio Gagliardi Cozman

Consider a Bayesian inference problem where a variable of interest does not take values in a Euclidean space. These "non-standard" data structures are in reality fairly common. They are frequently used in problems involving latent discrete…

Prob-solvable loops are probabilistic programs with polynomial assignments over random variables and parametrised distributions, for which the full automation of moment-based invariant generation is decidable. In this paper we extend…

Artificial Intelligence · Computer Science 2020-07-28 Ezio Bartocci , Laura Kovács , Miroslav Stankovič

Despite their impressive ability to generate high-quality and fluent text, generative large language models (LLMs) also produce hallucinations: statements that are misaligned with established world knowledge or provided input context.…

Computation and Language · Computer Science 2025-01-15 Abhilasha Ravichander , Shrusti Ghela , David Wadden , Yejin Choi

This study introduces a hypothesis-testing framework to assess whether large language models (LLMs) possess genuine reasoning abilities or primarily depend on token bias. We go beyond evaluating LLMs on accuracy; rather, we aim to…

Computation and Language · Computer Science 2024-10-07 Bowen Jiang , Yangxinyu Xie , Zhuoqun Hao , Xiaomeng Wang , Tanwi Mallick , Weijie J. Su , Camillo J. Taylor , Dan Roth

In this paper we present BayesLDM, a system for Bayesian longitudinal data modeling consisting of a high-level modeling language with specific features for modeling complex multivariate time series data coupled with a compiler that can…

Autoregressive Large Language Models (LLMs) trained for next-word prediction have demonstrated remarkable proficiency at producing coherent text. But are they equally adept at forming coherent probability judgments? We use probabilistic…

Computation and Language · Computer Science 2025-05-07 Jian-Qiao Zhu , Thomas L. Griffiths

Large Language Models (LLMs) are prone to factual hallucinations, risking their reliability in real-world applications. Existing hallucination detectors mainly extract micro-level intrinsic patterns for uncertainty quantification or elicit…

Computation and Language · Computer Science 2026-05-06 Hao Mi , Qiang Sheng , Shaofei Wang , Beizhe Hu , Yifan Sun , Zhengjia Wang , Hengqi Zeng , Yang Li , Danding Wang , Juan Cao

Large Language Models (LLMs) demonstrate strong few-shot generalization through in-context learning, yet their reasoning in dynamic and stochastic environments remains opaque. Prior studies mainly focus on static tasks and overlook the…

Artificial Intelligence · Computer Science 2025-12-23 Jensen Zhang , Jing Yang , Keze Wang

We propose a general-purpose approach for improving the ability of large language models (LLMs) to intelligently and adaptively gather information from a user or other external source using the framework of sequential Bayesian experimental…

Computation and Language · Computer Science 2026-04-22 Deepro Choudhury , Sinead Williamson , Adam Goliński , Ning Miao , Freddie Bickford Smith , Michael Kirchhof , Yizhe Zhang , Tom Rainforth

Large language models (LLMs) are able to generate human-like responses to user queries. However, LLMs exhibit inherent limitations, especially because they hallucinate. This paper introduces LP-LM, a system that grounds answers to questions…

Artificial Intelligence · Computer Science 2025-02-14 Katherine Wu , Yanhong A. Liu

Max-Linear Bayesian Networks (MLBNs) provide a powerful framework for causal inference in extreme-value settings; we consider MLBNs with noise parameters with a given topology in terms of the max-plus algebra by taking its logarithm. Then,…

Machine Learning · Statistics 2025-05-02 Mark Adams , Kamillo Ferry , Ruriko Yoshida

Effective Uncertainty Quantification (UQ) represents a key aspect for reliable deployment of Large Language Models (LLMs) in automated decision-making and beyond. Yet, for LLM generation with multiple choice structure, the state-of-the-art…

Machine Learning · Computer Science 2025-11-18 Ramzi Dakhmouche , Adrien Letellier , Hossein Gorji

Large language models (LLMs) demonstrate remarkable breadth of knowledge, yet their ability to reason about computational processes remains poorly understood. Closing this gap matters for practitioners who rely on LLMs to guide algorithm…

Computation and Language · Computer Science 2026-04-07 Sohan Venkatesh , Ashish Mahendran Kurapath , Tejas Melkote

The self-rationalising capabilities of LLMs are appealing because the generated explanations can give insights into the plausibility of the predictions. However, how faithful the explanations are to the predictions is questionable, raising…

Computation and Language · Computer Science 2024-12-18 Marc Braun , Jenny Kunz