Disentangling Exploration of Large Language Models by Optimal Exploitation

Tim Grams, Patrick Betz, Sascha Marton, Stefan Lüdtke, Christian Bartelt
1/15/2025
cs.LGcs.AIcs.CL

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Exploration is a crucial skill for in-context reinforcement learning in unknown environments. However, it remains unclear if large language models can effectively explore a partially hidden state space. This work isolates exploration as the sole objective, tasking an agent with gathering information that enhances future returns. Within this framework, we argue that measuring agent returns is not sufficient for a fair evaluation. Hence, we decompose missing rewards into their exploration and exploitation components based on the optimal achievable return. Experiments with various models reveal that most struggle to explore the state space, and weak exploration is insufficient. Nevertheless, we found a positive correlation between exploration performance and reasoning capabilities. Our decomposition can provide insights into differences in behaviors driven by prompt engineering, offering a valuable tool for refining performance in exploratory tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{grams2025disentangling,
  title  = {Disentangling Exploration of Large Language Models by Optimal Exploitation},
  author = {Tim Grams and Patrick Betz and Sascha Marton and Stefan Lüdtke and Christian Bartelt},
  year   = {2025},
  eprint = {2501.08925},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.08925v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.08925.svg)](https://codeofpaper.com/paper/2501.08925)

Discussion