Skip to content
AI Atlas
PaperActive

REFACTOR-VLA: Unsupervised Library Learning of Typed Motor Programs

Applearxiv.org/pdf/2609.01215

quality84

Updated 5 h ago · first seen 11 Sept 2026

paper_01M294AHKW5WDXFV7XAS5NW72J

Published
2 Sept 2026
T1 · 5 h ago
arXiv
2609.01215
T1 · 5 h ago

As of

Rewind the record: see this entity's attributes exactly as AI Atlas knew them on a given day.

Claim history

6 claims · 6 properties

Paperpaper_url1

Claim history for Paper
ValueValid from → toStatusSourceConfidenceExtractor
https://machinelearning.apple.com/research/refactor-vla-motor-programscurrentcurrentApple Machine Learning ResearchT1highdeterministic

Abstractabstract1

Claim history for Abstract
ValueValid from → toStatusSourceConfidenceExtractor
Most current vision-language-action (VLA) models—such as OpenVLA, π0, RT-2, and RDT-1B—are “monolithic.” This means they generate raw motor commands or very short sequences of actions, without organizing behaviors into reusable, well-defined abstractions. As a result, these models perform poorly on long-horizon (multi-step) tasks, and it’s difficult to interpret what they have learned. Existing approaches for discovering skills often avoid the core problem of deciding when two action sequences are “behaviorally equivalent.” For example, AtomicVLA and AtomSkill group action sequences by…currentcurrentApple Machine Learning ResearchT1highdeterministic

arXiv idarxiv_id1

Claim history for arXiv id
ValueValid from → toStatusSourceConfidenceExtractor
2609.01215currentcurrentApple Machine Learning ResearchT1highdeterministic

Authorsauthors1

Claim history for Authors
ValueValid from → toStatusSourceConfidenceExtractor
Riyaaz Shaik, Chandru VenkataramancurrentcurrentApple Machine Learning ResearchT1highdeterministic

PDFpdf_url1

Claim history for PDF
ValueValid from → toStatusSourceConfidenceExtractor
https://arxiv.org/pdf/2609.01215currentcurrentApple Machine Learning ResearchT1highdeterministic

Publishedpublished_at1

Claim history for Published
ValueValid from → toStatusSourceConfidenceExtractor
2 Sept 2026currentcurrentApple Machine Learning ResearchT1highdeterministic

Claims are temporal and append-only: a new observation closes the previous claim (valid_to) instead of overwriting it. Conflicting claims from different sources are kept side by side and flagged — never averaged. Methodology →