7 papers
From Gameplay Traces to Game Mechanics: Causal Induction with Large Language Models
Mohit Jiwatode, Alexander Dockhorn, Bodo Rosenhahn
Deep learning agents can achieve high performance in complex game domains without often understanding the underlying causal game mechanics. To address this, we investigate Causal I…
Multi-Object Tracking Retrieval with LLaVA-Video: A Training-Free Solution to MOT25-StAG Challenge
Yi Yang, Yiming Xu, Timo Kaiser +3
In this report, we present our solution to the MOT25-Spatiotemporal Action Grounding (MOT25-StAG) Challenge. The aim of this challenge is to accurately localize and track multiple…
Discovering State Equivalences in UCT Search Trees By Action Pruning
Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn
One approach to enhance Monte Carlo Tree Search (MCTS) is to improve its sample efficiency by grouping/abstracting states or state-action pairs and sharing statistics within a grou…
Grouping Nodes With Known Value Differences: A Lossless UCT-based Abstraction Algorithm
Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn
A core challenge of Monte Carlo Tree Search (MCTS) is its sample efficiency, which can be improved by grouping state-action pairs and using their aggregate statistics instead of si…
Investigating Intra-Abstraction Policies For Non-exact Abstraction Algorithms
Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn
One weakness of Monte Carlo Tree Search (MCTS) is its sample efficiency which can be addressed by building and using state and/or action abstractions in parallel to the tree search…
AUPO -- Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm
Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn
We introduce a novel, drop-in modification to Monte Carlo Tree Search's (MCTS) decision policy that we call AUPO. Comparisons based on a range of IPPC benchmark problems show that…