Shortcut Learning in Generalist Robot Policies: The Role of Dataset Diversity and Fragmentation
Youguang Xing, Xu Luo, Junlin Xie, Lianli Gao, Hengtao Shen, Jingkuan Song
TL;DR
This work identifies shortcut learning as a key obstacle to generalization in generalist robot policies and links it to dataset structure, specifically limited sub-dataset diversity and fragmentation across sub-datasets. It provides a formal framework relating task-relevant and task-irrelevant factors, supported by theoretical propositions and empirical validation on LIBERO and real-world setups. The authors show that increasing intra-subdataset diversity and reducing inter-subdataset disparity mitigate shortcuts, and demonstrate practical data-augmentation strategies—viewpoint and object augmentation—to enhance diversity and bridge distribution gaps in offline data. The findings offer actionable guidance for dataset collection and augmentation to improve both simulation and real-world generalization of Vision-Language-Action policies, especially when acquiring new large-scale data is impractical.
Abstract
Generalist robot policies trained on large-scale datasets such as Open X-Embodiment (OXE) demonstrate strong performance across a wide range of tasks. However, they often struggle to generalize beyond the distribution of their training data. In this paper, we investigate the underlying cause of this limited generalization capability. We identify shortcut learning -- the reliance on task-irrelevant features -- as a key impediment to generalization. Through comprehensive theoretical and empirical analysis, we uncover two primary contributors to shortcut learning: (1) limited diversity within individual sub-datasets, and (2) significant distributional disparities across sub-datasets, leading to dataset fragmentation. These issues arise from the inherent structure of large-scale datasets like OXE, which are typically composed of multiple sub-datasets collected independently across varied environments and embodiments. Our findings provide critical insights into dataset collection strategies that can reduce shortcut learning and enhance the generalization ability of generalist robot policies. Moreover, in scenarios where acquiring new large-scale data is impractical, we demonstrate that carefully selected robotic data augmentation strategies can effectively reduce shortcut learning in existing offline datasets, thereby improving generalization capabilities of generalist robot policies, e.g., $π_0$, in both simulation and real-world environments. More information at https://lucky-light-sun.github.io/proj/shortcut-learning-in-grps/.
