How to Solve Contextual Goal-Oriented Problems with Offline Datasets?
Ying Fan, Jingling Li, Adith Swaminathan, Aditya Modi, Ching-An Cheng

TL;DR
This paper introduces CODA, a new method leveraging unlabeled trajectories and context-goal pairs to solve complex goal-oriented problems offline, with theoretical guarantees and superior empirical performance.
Contribution
The paper proposes CODA, a novel data augmentation technique that constructs an action-augmented MDP to solve CGO problems without additional approximation errors.
Findings
CODA outperforms baseline methods across various CGO scenarios.
Theoretical analysis confirms CODA's capability to solve CGO problems offline.
Empirical results demonstrate CODA's effectiveness in diverse contexts.
Abstract
We present a novel method, Contextual goal-Oriented Data Augmentation (CODA), which uses commonly available unlabeled trajectories and context-goal pairs to solve Contextual Goal-Oriented (CGO) problems. By carefully constructing an action-augmented MDP that is equivalent to the original MDP, CODA creates a fully labeled transition dataset under training contexts without additional approximation error. We conduct a novel theoretical analysis to demonstrate CODA's capability to solve CGO problems in the offline data setup. Empirical results also showcase the effectiveness of CODA, which outperforms other baseline methods across various context-goal relationships of CGO problem. This approach offers a promising direction to solving CGO problems using offline datasets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsSoftware Engineering Techniques and Practices
