← Back to all news
arXiv AI By Kevin Li, Marinka Zitnik

Hindsight Relabeling is All You Need for Reach-Avoid Learning

Read the original on arXiv AI →

The paper introduces RADT, a decision transformer for offline, reward‑free, goal‑conditioned reinforcement learning that can handle arbitrary avoid‑regions specified at evaluation time. By encoding goals and avoid‑regions as prompt tokens and using an avoid‑region hindsight relabeling strategy, RADT learns reach‑avoid behavior from suboptimal random trajectories without reward or cost supervision. Across 17 tasks and environments, RADT outperforms existing offline goal‑conditioned RL models, achieving significant zero‑shot generalization to novel avoid‑region sizes and counts, and is also applied to a biological cell reprogramming task.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv Machine Learning
Oct 12

Cross-Behavior Policy Optimization: Unified Learning from Offline Demonstrations and On- and Off-Policy Rollouts via a Shared Regression Target

The paper introduces Cross-Behavior Policy Optimization (CBPO), a method that unifies offline demonstrations and policy-generated rollouts into a single regression loss using a fixed-reference target. CBPO eliminates the need for separate supervised fine‑tuning and reinforcement learning objectives, allowing positive and negative offline completions, reference responses, and current and historical rollouts to share a common reward‑labeled format and replay buffer. Experiments on two model scales and four mathematical reasoning benchmarks show that CBPO, especially the CBPO‑Unified variant, outperforms baseline methods in avg@32 and pass@32 metrics, with historical rollouts providing additional gains.

By Du Cheng, Junyu Lu, Jingfan Zhang, Yuzhuo Zhang, Haoxuan Jia, Shichao Weng
reinforcement-learningfine-tuningbenchmarks
More like this →
arXiv Machine Learning
Oct 8

An Informational Curse of Horizon in Goal-Conditioned Policy Learning

The paper identifies an informational curse of horizon in goal-conditioned policy learning, showing that longer goal relabeling horizons during training can hurt policy generalization and performance. Controlled experiments with oracle planners separate training horizons from test horizons, revealing that behavioral cloning policies degrade with longer horizons while reinforcement learning mitigates this effect. The authors attribute this to reduced conditional mutual information between actions and hindsight-relabeled goals, and demonstrate that distilling short-horizon policy Jacobians into long-horizon policies improves performance, especially in combinatorial manipulation tasks.

By John L. Zhou, Yuxuan Dong, Jonathan C. Kao
reinforcement-learningroboticssafety
More like this →