Inferring Transition Dynamics from Value Functions

Jacob Adamczyk
1/15/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

In reinforcement learning, the value function is typically trained to solve the Bellman equation, which connects the current value to future values. This temporal dependency hints that the value function may contain implicit information about the environment's transition dynamics. By rearranging the Bellman equation, we show that a converged value function encodes a model of the underlying dynamics of the environment. We build on this insight to propose a simple method for inferring dynamics models directly from the value function, potentially mitigating the need for explicit model learning. Furthermore, we explore the challenges of next-state identifiability, discussing conditions under which the inferred dynamics model is well-defined. Our work provides a theoretical foundation for leveraging value functions in dynamics modeling and opens a new avenue for bridging model-free and model-based reinforcement learning.

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. Any repos shown below are weak matches — 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{adamczyk2025inferring,
  title  = {Inferring Transition Dynamics from Value Functions},
  author = {Jacob Adamczyk},
  year   = {2025},
  eprint = {2501.09081},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.09081v1}
}

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.09081.svg)](https://codeofpaper.com/paper/2501.09081)

Discussion