Skip to content

Runtime Uncertainty Monitoring for LLM-Based Multi-Agent Systems Using Bayesian Networks

Jul 2026 · Lecture notes in computer science · pp. 736-748 · 0 citations · 24 references
Computer Science

TL;DR

This paper investigates how multi-agent systems (MAS-based on large language models) can support actuarial risk modelling, with a particular focus on uncertainty quantification, and proposes a novel approach to uncertainty propagation using token-level log-probabilities and a Bayesian Network.

Abstract

This paper investigates how multi-agent systems (MAS)-based on large language models (LLMs) can support actuarial risk modelling, with a particular focus on uncertainty quantification. Actuarial workflows represent a high-stakes decision-support setting where unreliable outputs may lead to incorrect risk assessment, unfair pricing, and regulatory non-compliance. To address uncertainty introduced by the probabilistic nature of LLMs and dependencies between agents, a multi-agent framework is proposed in which specialised agents perform data preparation, modelling, review, and explanation tasks under a central hub. The main contribution is a novel approach to uncertainty propagation using token-level log-probabilities and a Bayesian Network. Importantly, log probabilities are not treated as direct probabilities of correctness or task success. Instead, length-normalised log-probability summaries are transformed into calibrated task-level confidence estimates before incorporation into the Bayesian Network. Results show that the framework reproduces baseline actuarial performance while providing additional insight into workflow stability and runtime uncertainty propagation.

View source

Similar papers

Preprint Aug 2026

Semantic Uncertainty-Guided Orchestration in Hierarchical Multi-Agent Systems

A semantic-uncertainty-guided orchestration approach, HASSUM is introduced as a general framework for uncertainty-aware coordination in multi-agent systems and suggests that semantic uncertainty is a practical and general-purpose signal for improving robustness and trustworthiness in agentic AI systems.

John Knowlton, Aritra Guha, Risto Miikkulainen · 0 citations
Preprint Jul 2026

Who Broke the System? Failure Localization in LLM-Based Multi-Agent Systems

Experimental results show that AgentLocate consistently outperforms existing failure localization methods in identifying both responsible agents and failure steps, while remaining efficient in terms of token usage and running time.

Yu Xia, Anjun Gao, Yueyang Quan et al. · 0 citations
Preprint Aug 2026

PropUQ-MAS: Propagation-Aware Uncertainty Quantification for LLM Multi-Agent Systems

PropUQ-MAS is proposed, an error propagation-aware UQ framework that represents MAS execution as a communication-structured graph and estimates each step's reliability by combining local uncertainty with uncertainty inherited from upstream messages.

Yao-Kun Liu, Yi-Fan Liu, D. Zhang et al. · 1 citation
Open access Aug 2026

A Bayesian composite risk approach for stochastic optimal control and Markov decision processes

The new modeling paradigm subsumes several classical SOC/MDP formulations, including risk-averse and distributionally robust SOC/MDPs as well as partially observed and Bayes-adaptive MDPs, and generates so-called preference robust SOC/MDP models.

Wen-Tao Ma, Zhi-Ping Chen, Huifu Xu · 1 citation
Jul 2026

Decision Making Needs Uncertainty Quantification [Lecture Notes]

This lecture note develops, from first principles and within a single decision-theoretic setting, the link between the decision objective and the knowledge of an agent and the form of uncertainty representation that is sufficient to act optimally.

Osvaldo Simeone · 3 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.