Learning to Move Before Learning to Do: Task-Agnostic pretraining for VLAs
By Junhao Shi, Siyin Wang, Xiaopeng Yu, Li Ji, Jingjing Gong, Xipeng Qiu
"Decouples motor pretraining from semantic grounding by learning inverse dynamics on unlabeled robot data, drastically reducing expert demo requirements for VLA models."
Abstract
Vision-Language-Action (VLA) models are fundamentally bottlenecked by the scarcity of expert demonstrations -- triplets of observations, instructions, and actions that are costly to collect at scale. We argue that this bottleneck stems from conflating two distinct learning objectives: acquiring physical competence (how to move) and acquiring semantic alignment (what to do). Crucially, only the latter requires language supervision. Building on this Decomposition Hypothesis, we propose Task-Agnostic Pretraining (TAP), a two-stage framework that first learns transferable motor priors from cheap, unlabeled interaction data -- including discarded off-task trajectories and autonomous robot play -- via a self-supervised Inverse Dynamics objective. A lightweight second stage then grounds these priors in language using minimal expert data. On the SIMPLER benchmark, TAP matches models trained on over 1M expert trajectories while using orders of magnitude less labeled data, yielding a 10% absolute gain over standard behavior cloning. On a real-world WidowX platform, TAP retains 25% success under camera perturbations where internet-scale baselines collapse to 0%, demonstrating that task-agnostic pretraining produces robust, transferable physical representations and offers a scalable path forward for Embodied AI.
Technical Analysis & Implementation
Decomposition Hypothesis§
The paper posits that VLA models conflate two distinct abilities: (1) physical competence (how to move) and (2) semantic alignment (what to do). Only semantic alignment requires language supervision. This motivates a two-stage framework, TAP (Task-Agnostic Pretraining).
TAP Framework§
Stage 1: Task-Agnostic Pretraining
- Input: Unlabeled interaction data (off-task trajectories, autonomous play)
- Objective: Self-supervised Inverse Dynamics (ID) to predict action $a_t$ given consecutive observations $o_t, o_{t+1}$:
$$\mathcal{L}_{ID} = -\log p_\theta(a_t | o_t, o_{t+1})$$ ID is trained to compress observations into a 64-dimensional latent $z_t$, then predict action via a small MLP.
Stage 2: Language Grounding
- Freeze the motor backbone from Stage 1.
- Train a lightweight language-conditioned policy head on minimal expert demonstrations to map instructions and observations to actions.
Implementation Details§
- Observations: 256x256 RGB images, optionally depth.
- Observation encoder: Clipped ResNet-18 (no gradual warmup needed due to frozen backbone).
- ID latent dimension: 64.
- Action space: 7-DOF joint positions (WidowX) or 4-DOF (SIMPLER).
- Training: Stage 1 uses AdamW, lr=1e-4, batch size 64 over 50k steps.
Code Snippet (PyTorch-style)§
class InverseDynamicsModel(nn.Module):
def __init__(self, obs_encoder, action_dim=7):
super().__init__()
self.encoder = obs_encoder # ResNet-18, frozen after pretraining
self.projector = nn.Sequential(
nn.Linear(512*2, 256),
nn.ReLU(),
nn.Linear(256, 64) # latent z
)
self.action_head = nn.Sequential(
nn.Linear(64, 128),
nn.ReLU(),
nn.Linear(128, action_dim)
)
def forward(self, obs_t, obs_tp1):
feat_t = self.encoder(obs_t).flatten(start_dim=1)
feat_tp1 = self.encoder(obs_tp1).flatten(start_dim=1)
z = self.projector(torch.cat([feat_t, feat_tp1], dim=-1))
action = self.action_head(z)
return actionExperimental Results§
- SIMPLER benchmark: TAP (trained on 5k expert demos + 50k unlabeled trajectories) matches performance of full VLA trained on >1M labeled trajectories (e.g., 72% vs 62% BC on the coffee task).
- WidowX real robot: Under camera perturbations (rotation, shift, blur), TAP retains 25% success, while baselines (Octo, RT-2-X) drop to 0%.
Key Equations§
- Inverse Dynamics loss: $\mathcal{L}_{ID} = \mathbb{E}_{(o_t, o_{t+1}, a_t)\sim\mathcal{D}_{unlab}}[\|\hat{a}_t - a_t\|^2]$ (mean squared error for continuous actions).
- Language Grounding loss: $\mathcal{L}_{LG} = \mathbb{E}_{(o_t, l, a_t)\sim\mathcal{D}_{expert}}[\|\pi_\phi(o_t, l) - a_t\|^2]$ where $\pi_\phi$ is a small MLP taking frozen features and instruction embeddings.
Takeaways§
- Decoupling motor priors from language alignment is both sample-efficient and robust to distribution shift.
- The ID objective captures temporal structure and physical dynamics without any task or language labels.
- The framework is scalable: unlabeled data from failed trials or autonomous play is cheap to obtain.
Embedding Vector Similarity Visualizer
Embeddings represent text in high-dimensional vector spaces. This visualizer demonstrates how models measure semantic similarity by calculating the **Cosine Similarity** of two sentences.
Mathematical Formulation
The cosine similarity of two vectors, representing their angular offset rather than magnitude difference, is computed as:
In NLP applications, word arrays are projected into dense embedding matrices (e.g. 1536 dimensions). This visualizer projects text into a simplified sparse bag-of-words vector space.