aspireai.
PUBLIC EDITION

A JEPA world model that predicts relations no better than chance can be taught to ground them by reconstructing actions from its own latent state

AspireAI community · arXiv (cs.AI) — Australian Institute for Machine Learning
Joint-embedding predictive architectures learn world models in latent space, but their states are opaque vectors: a probe can often read out whether a cup is inside a bowl, yet no part of the state is actually committed to that relation. Inside-JEPA puts relational channels for ordered entity pairs inside the JEPA latent state and shows an inverse-dynamics loss grounds them without any relation labels, as long as the head reads those channels. On Something-Something V2, latent prediction alone performed no better than a random relation head, while inverse-dynamics supervision improved relational AUROC by 0.065 to 0.103 across ten annotated settings, by 0.081 on RH20T robot episodes with held-out tasks, and by 0.050 to 0.061 across five relations using off-the-shelf detection and tracking. The limitation is real: relations are geometric predicates computed from 2D bounding boxes, so 'inside' is an image-plane proxy for containment rather than true 3D containment.
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.