Zero-Shot Off-Policy Learning
Arip Asadulaev, Maksim Bobrin, Salem Lahlou, Dmitry V. Dylov, Fakhri Karray, Martin Takac
Abstract
Off-policy learning methods seek to derive an optimal policy directly from a fixed dataset of prior interactions. This objective presents significant challenges, primarily due to the inherent distributional shift and value function overestimation bias. These issues become even more noticeable in *zero-shot* reinforcement learning, where an agent trained on reward-free data must adapt to new tasks at test time without additional training. In this work, we address the off-policy problem in a zero-shot setting by discovering a theoretical connection of successor measures to stationary density ratios. Using this insight, our algorithm can infer optimal importance sampling ratios, effectively performing a stationary distribution correction with an optimal policy *for any task on the fly*. We benchmark our method in motion tracking tasks on SMPL Humanoid, continuous control on ExoRL, and for the long-horizon OGBench tasks. Our technique seamlessly integrates into forward-backward representation frameworks and enables *fast-adaptation* to new tasks in a *raining-free* regime. More broadly, this work bridges off-policy learning and zero-shot adaptation, offering benefits to both research areas.
BibTeX
@inproceedings{
asadulaev2026zeroshot,
title={Zero-Shot Off-Policy Learning},
author={Arip Asadulaev and Maksim Bobrin and Salem Lahlou and Dmitry V. Dylov and Fakhri Karray and Martin Tak{\'a}{\v{c}}},
booktitle={Forty-third International Conference on Machine Learning},
year={2026},
url={https://openreview.net/forum?id=HFpAMjHiZm}
}