arXiv cs.AI· Kevin Li, Marinka Zitnik·· 11 小时前AI 评分24
RADT:用后见重标注实现无奖励的 reach-avoid 离线强化学习
Hindsight Relabeling is All You Need for Reach-Avoid Learning
AI 导读
研究者提出 RADT,一种面向离线、无奖励、目标与避让区域条件化的决策 Transformer 强化学习方法,将目标与避让区域直接编码为提示词 token,评估时可指定任意数量、任意大小的避让区域。
正文 · 原文
Abstract:Offline goal-conditioned reinforcement learning methods have shown promise for reach-avoid tasks, where an agent must reach a target state while avoiding undesirable regions of the state space. Existing approaches typically encode avoid-region information into an augmented state space and cost function, which prevents flexible, dynamic specification of novel avoid-region information at evaluation time. They also rely heavily on meticulously designed reward and cost functions, limiting transferability to novel environments and specifications. We introduce RADT, a decision transformer approach for offline, reward-free, goal-conditioned, avoid-region-conditioned RL. RADT encodes goals and avoid-regions directly as prompt tokens, allowing any number of avoid-regions of arbitrary size to be specified at evaluation time. Using only suboptimal offline trajectories from a random policy, RADT can learn reach-avoid behavior in a completely data-driven manner using our novel avoid-region hindsight relabeling approach, without the need for reward/cost supervision. We benchmark RADT against existing offline goal-conditioned RL models across 17 tasks, environments, and experimental settings. RADT generalizes in a zero-shot manner to out-of-distribution avoid-region sizes and counts, outperforming baselines that require retraining. In one such zero-shot setting, RADT achieves 35.7% improvement in normalized cost over the best retrained baseline while maintaining high goal-reaching success. We also apply RADT to cell reprogramming in biology, demonstrating its versatility.
| Comments: | NeurIPS 2026 |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Quantitative Methods (q-bio.QM) |
| Cite as: | arXiv:2505.19337 [cs.LG] |
| (or arXiv:2505.19337v3 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2505.19337 arXiv-issued DOI via DataCite |
Submission history
From: Kevin Li [view email]
[v1]
Sun, 25 May 2025 22:00:38 UTC (1,504 KB)
[v2]
Tue, 27 May 2025 02:56:11 UTC (1,505 KB)
[v3]
Tue, 3 Nov 2026 19:58:21 UTC (1,672 KB)
来源:arXiv cs.AI · arxiv.org