paper-with-me

Papers

Zero, Finite, and Infinite Belief History of Theory of Mind Reasoning in Large Language Models

2024-06-07 · Weizhi Tang, Vaishak Belle

Large Language Models (LLMs) have recently shown a promise and emergence of Theory of Mind (ToM) ability and even outperform humans in certain ToM tasks. To evaluate and extend the boundaries of the ToM reasoning ability of LLMs, we propose a novel concept, taxonomy, and framework, the ToM reasoning with Zero, Finite, and Infinite Belief History and develop a multi-round text-based game, called $\textit{Pick the Right Stuff}$, as a benchmark. We have evaluated six LLMs with this game and found their performance on Zero Belief History is consistently better than on Finite Belief History. In addition, we have found two of the models with small parameter sizes outperform all the evaluated models with large parameter sizes. We expect this work to pave the way for future ToM benchmark development and also for the promotion and development of more complex AI agents or systems which are required to be equipped with more complex ToM reasoning ability.

📄 PDF Abstract BibTeX arXiv:2406.04800

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Best Response Convergence for Zero-sum Stochastic Dynamic Games with Partial and Asymmetric Information

2025-01-10 · Yuxiang Guan, Iman Shames, Tyler H. Summers

We analyze best response dynamics for finding a Nash equilibrium of an infinite horizon zero-sum stochastic linear quadratic dynamic game (LQDG) with partial and asymmetric information. We derive explicit expressions for…

Finite Memory Belief Approximation for Optimal Control in Partially Observable Markov Decision Processes

2026-01-06 · Mintae Kim arxiv

We study finite memory belief approximation for partially observable (PO) stochastic optimal control (SOC) problems. While belief states are sufficient for SOC in partially observable Markov decision processes (POMDPs), …

Multi-Agent Filtering with Infinitely Nested Beliefs

2008-12-01 · NeurIPS 2008 12 · Luke Zettlemoyer, Brian Milch, Leslie P. Kaelbling

In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agents. The multi-agent filtering problem is …

Infinite-Label Learning with Semantic Output Codes

2016-08-23 · Yang Zhang, Rupam Acharyya, Ji Liu, Boqing Gong

We develop a new statistical machine learning paradigm, named infinite-label learning, to annotate a data point with more than one relevant labels from a candidate set, which pools both the finite labels observed at trai…

Multi-Label LearningZero-Shot Learning

Value Under Ignorance in Universal Artificial Intelligence

2025-12-18 · Cole Wyeth, Marcus Hutter arxiv

We generalize the AIXI reinforcement learning agent to admit a wider class of utility functions. Assigning a utility to each possible interaction history forces us to confront the ambiguity that some hypotheses in the ag…

Reinforcement Learning