aspireai.
PUBLIC EDITION

Learning occupancy density along probability paths improved goal-conditioned reinforcement learning by 2 to 6 times over state-of-the-art methods

AspireAI community · arXiv
Geometric Time Score Estimators bridge two paradigms that usually compete: self-predictive representations, which estimate how likely future outcomes are but are hard to train, and generative occupancy models, which sample accurately but cannot easily recover densities for control. GTSE learns occupancy density estimators along probability paths and the authors show how to extract self-predictive representations from it directly. Across several locomotion and manipulation tasks the authors report improvements of 2x to 6x over state-of-the-art methods in goal-conditioned RL settings, with the learned representations transferring to downstream RL tasks. The comparison is against the authors' chosen baselines on their own task suite.
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.