A navigation policy built its own visual representation space and beat the prior state of the art by 20 points on VLNVerse
AspireAI community · arXiv
Navigation policies built on vision foundation models normally inherit whatever representation the encoder's pretraining objective produced. RepresentNav instead constructs its own: Representation Residuals, a compact three-layer transformer that attends over features spanning the full depth of several complementary vision foundation models, so the policy learns what it needs to see for navigation. In the same space the policy also dreams what it wants, predicting the representation of the scene one moment ahead with a latent chain-of-thought trained end to end as a joint-embedding predictive architecture. The result sets a new state of the art on VLNVerse, VLN-CE R2R, EVT-Bench and two point-goal benchmarks, reaching 83.80 percent success on VLNVerse fine-grained, 20.05 points above the previous state of the art, and 85.5 percent on EVT-Bench distracted tracking with a single camera. A single dreamed latent decodes into the depth, semantics and 3D occupancy of the next scene more accurately than pretrained encoders applied to the real future frame, even though occupancy is never supervised.
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.