How to Provably Improve Return Conditioned Supervised Learning?
This addresses a key problem in offline reinforcement learning for sequential decision-making, though it appears incremental as it builds on existing RCSL methods.
The paper tackled the limitation of Return-Conditioned Supervised Learning (RCSL) lacking the stitching property by proposing Reinforced RCSL, which introduces an in-distribution optimal return-to-go mechanism and shows significant performance improvements in benchmarks.
In sequential decision-making problems, Return-Conditioned Supervised Learning (RCSL) has gained increasing recognition for its simplicity and stability in modern decision-making tasks. Unlike traditional offline reinforcement learning (RL) algorithms, RCSL frames policy learning as a supervised learning problem by taking both the state and return as input. This approach eliminates the instability often associated with temporal difference (TD) learning in offline RL. However, RCSL has been criticized for lacking the stitching property, meaning its performance is inherently limited by the quality of the policy used to generate the offline dataset. To address this limitation, we propose a principled and simple framework called Reinforced RCSL. The key innovation of our framework is the introduction of a concept we call the in-distribution optimal return-to-go. This mechanism leverages our policy to identify the best achievable in-dataset future return based on the current state, avoiding the need for complex return augmentation techniques. Our theoretical analysis demonstrates that Reinforced RCSL can consistently outperform the standard RCSL approach. Empirical results further validate our claims, showing significant performance improvements across a range of benchmarks.