paper-with-me

Papers

Look-ahead Reasoning with a Learned Model in Imperfect Information Games

2025-10-06 · Ondřej Kubíček, Viliam Lisý arxiv

Test-time reasoning significantly enhances pre-trained AI agents' performance. However, it requires an explicit environment model, often unavailable or overly complex in real-world scenarios. While MuZero enables effective model learning for search in perfect information games, extending this paradigm to imperfect information games presents substantial challenges due to more nuanced look-ahead reasoning techniques and large number of states relevant for individual decisions. This paper introduces an algorithm LAMIR that learns an abstracted model of an imperfect information game directly from the agent-environment interaction. During test time, this trained model is used to perform look-ahead reasoning. The learned abstraction limits the size of each subgame to a manageable size, making theoretically principled look-ahead reasoning tractable even in games where previous methods could not scale. We empirically demonstrate that with sufficient capacity, LAMIR learns the exact underlying game structure, and with limited capacity, it still learns a valuable abstraction, which improves game playing performance of the pre-trained agents even in large games.

📄 PDF Abstract BibTeX arXiv:2510.05048

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Limited Lookahead in Imperfect-Information Games

2019-02-17 · Christian Kroer, Tuomas Sandholm

Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach.…

Scaling Speculative Decoding with Lookahead Reasoning

2025-06-24 · Yichao Fu, Rui Ge, Zelei Shao, Zhijie Deng 외

Reasoning models excel by generating long chain-of-thoughts, but decoding the resulting thousands of tokens is slow. Token-level speculative decoding (SD) helps, but its benefit is capped, because the chance that an enti…

GPUGSM8K

Dynamic Lookahead Distance via Reinforcement Learning-Based Pure Pursuit for Autonomous Racing

2026-03-30 · Mohamed Elgouhary, Amr S. El-Wakeel arxiv

Pure Pursuit (PP) is a widely used path-tracking algorithm in autonomous vehicles due to its simplicity and real-time performance. However, its effectiveness is sensitive to the choice of lookahead distance: shorter valu…

Reinforcement LearningAutonomous Vehicles

Imagine-then-Plan: Agent Learning from Adaptive Lookahead with World Models

2026-01-13 · Youwei Liu, Jian Wang, Hanlin Wang, Beichen Guo 외 arxiv

Recent advances in world models have shown promise for modeling future dynamics of environmental states, enabling agents to reason and act without accessing real environments. Current methods mainly perform single-step o…

Forecasting With LLMs: Improved Generalization Through Feature Steering

2026-06-25 · Humzah Merchant, Bradford Levy arxiv

Successful forecasting involves identifying patterns between historical and future states of the world which generalize to future observations. We apply LLMs to a variety of forecasting tasks and inspect their internal s…