paper-with-me

Papers

Verifying Memoryless Sequential Decision-making of Large Language Models

2025-10-08 · Dennis Gross, Helge Spieker, Arnaud Gotlieb arxiv

We introduce a tool for rigorous and automated verification of large language model (LLM)- based policies in memoryless sequential decision-making tasks. Given a Markov decision process (MDP) representing the sequential decision-making task, an LLM policy, and a safety requirement expressed as a PCTL formula, our approach incrementally constructs only the reachable portion of the MDP guided by the LLM's chosen actions. Each state is encoded as a natural language prompt, the LLM's response is parsed into an action, and reachable successor states by the policy are expanded. The resulting formal model is checked with Storm to determine whether the policy satisfies the specified safety property. In experiments on standard grid world benchmarks, we show that open source LLMs accessed via Ollama can be verified when deterministically seeded, but generally underperform deep reinforcement learning baselines. Our tool natively integrates with Ollama and supports PRISM-specified tasks, enabling continuous benchmarking in user-specified sequential decision-making tasks and laying a practical foundation for formally verifying increasingly capable LLMs.

📄 PDF Abstract BibTeX arXiv:2510.06756

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Utility Theory for Sequential Decision Making

2022-06-27 · Mehran Shakerinava, Siamak Ravanbakhsh

The von Neumann-Morgenstern (VNM) utility theorem shows that under certain axioms of rationality, decision-making is reduced to maximizing the expectation of some utility function. We extend these axioms to increasingly …

Decision MakingSequential Decision Making

Scalable Verification of Markov Decision Processes

2013-10-14 · Axel Legay, Sean Sedwards, Louis-Marie Traonouez

Markov decision processes (MDP) are useful to model concurrent process optimisation problems, but verifying them with numerical methods is often intractable. Existing approximative approaches do not scale well and are li…

Open Problem: Approximate Planning of POMDPs in the class of Memoryless Policies

2016-08-17 · Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar

Planning plays an important role in the broad class of decision theory. Planning has drawn much attention in recent work in the robotics and sequential decision making areas. Recently, Reinforcement Learning (RL), as an …

Decision MakingReinforcement LearningReinforcement Learning (RL)Sequential Decision Making

Translating the Rashomon Effect to Sequential Decision-Making Tasks

2025-12-19 · Dennis Gross, Jørn Eirik Betten, Helge Spieker arxiv

The Rashomon effect describes the phenomenon where multiple models trained on the same data produce identical predictions while differing in which features they rely on internally. This effect has been studied extensivel…

Geometry and Determinism of Optimal Stationary Control in Partially Observable Markov Decision Processes

2015-03-24 · Guido Montufar, Keyan Ghazi-Zahedi, Nihat Ay

It is well known that for any finite state Markov decision process (MDP) there is a memoryless deterministic policy that maximizes the expected reward. For partially observable Markov decision processes (POMDPs), optimal…