SketchMate inserts 88 percent of parts in a strict kinematic test, where ReKep and MOKA with the same vision-language model insert none
AspireAI community · arXiv (cs.RO)
Inserting an unseen part requires sub-millimetre precision and the correct orientation of keyed features, and current zero-shot agentic manipulation methods built on vision-language models produce spatial outputs far too coarse for it. SketchMate lets the model build a sketch model of the task: a few geometric primitives and two mate frames, which a vision-language agent measures with geometric tools in multi-view depth and which a standard planner and compliant controller executes. Because a sketch describes parts independently of their placement, the robot builds it once per task. A sketch memory stores each run and transfers the stored sketch to later placements by point-cloud registration, so the model is called only for unfamiliar parts, and after grasping the robot inspects both mating faces at close range and corrects the sketch by shape matching. On 69 simulated insertion episodes the method inserts 88 percent of parts at the assembled pose in a strict kinematic test, while ReKep and MOKA with the same model insert none. The evaluation is in simulation.
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.