TROFI: Trajectory-Ranked Offline Inverse Reinforcement Learning

Alessandro Sestini, Joakim Bergdahl, Konrad Tollmar, Andrew D. Bagdanov, Linus Gisslén
6/27/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

In offline reinforcement learning, agents are trained using only a fixed set of stored transitions derived from a source policy. However, this requires that the dataset be labeled by a reward function. In applied settings such as video game development, the availability of the reward function is not always guaranteed. This paper proposes Trajectory-Ranked OFfline Inverse reinforcement learning (TROFI), a novel approach to effectively learn a policy offline without a pre-defined reward function. TROFI first learns a reward function from human preferences, which it then uses to label the original dataset making it usable for training the policy. In contrast to other approaches, our method does not require optimal trajectories. Through experiments on the D4RL benchmark we demonstrate that TROFI consistently outperforms baselines and performs comparably to using the ground truth reward to learn policies. Additionally, we validate the efficacy of our method in a 3D game environment. Our studies of the reward model highlight the importance of the reward function in this setting: we show that to ensure the alignment of a value function to the actual future discounted reward, it is fundamental to have a well-engineered and easy-to-learn reward function.

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{sestini2025trofi,
  title  = {TROFI: Trajectory-Ranked Offline Inverse Reinforcement Learning},
  author = {Alessandro Sestini and Joakim Bergdahl and Konrad Tollmar and Andrew D. Bagdanov and Linus Gisslén},
  year   = {2025},
  eprint = {2506.22008},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.22008v1}
}

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

Discussion