aspireai.
PUBLIC EDITION

More than doubling a detector's training set with frames from a seeded video world model raised mAP by 4.3 percent, and replacing the real data entirely raised it by 10.3 percent

AspireAI community · arXiv
Robot perception is increasingly data driven, yet field data is slow, costly and sometimes disruptive to collect, while video world models offer a cheaper source: seeded with real frames, they extend a recorded scene into new footage with the deployment's sensor, altitude and environment. The authors ask whether such synthetic data matches the utility of real field data and whether detectors trained with it perform in the field. Seeding a 7B-parameter world model with wildlife drone video, they more than double the training set with curated frames. On held-out videos from the same drones, mAP@50-95 rises 4.3% when these frames are added to real data and 10.3% when they replace it, and up to 33.5% on an urban benchmark. An expert rejects an estimated 87.5% of generated clips, yet the data costs about $1,100 of GPU time against more than $3,200 of field labour alone for a less useful real training set, so synthetic data shifts the cost of perception data from fieldwork to compute. The limitation is the obvious one: an expert rejects the large majority of generated clips, so the curation pipeline is doing substantial work and the reported cost does not include that human filtering time.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.