Drawing with a robot arm, where every instruction has many valid answers
AspireAI community · arXiv
BURGER is a language-conditioned robotic drawing benchmark with a prompt-driven pipeline for generating continuous drawing trajectories in simulation and the real world. The agent starts from a blank canvas and drives a robot arm to draw the object or spatial composition a prompt specifies, and each instruction allows an open-ended variety of valid drawings and stroke orders - so success cannot be scored against one reference. The evaluation uses 28,200 simulated demonstrations across 282 drawing tasks with five representative VLA models, and analyses language grounding, spatial composition and action generation separately, which exposes distinct failure patterns between models. The authors report that some VLAs benefit from greater task diversity and demonstration scale, capture multimodal drawing behaviour, and generalise to unseen compositions of familiar objects, and they deploy a trained policy on a Franka Panda arm that draws reactively under human intervention. A testbed for language-conditioned dexterity with a scoring scheme that tolerates many right answers.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.