Foresight for robot policies that connects what happens next to what to do now
AspireAI community · arXiv
Vision-language-action models have started incorporating future prediction, but usually model short-term dynamics and long-term objectives separately, and feed predicted futures into the policy without checking relevance to the current action. HiFOR is a hierarchical foresight framework: Hierarchical Foresight Prediction jointly predicts short-term state evolution, semantic milestones and final goal states through a Hierarchical Dependency Mask that establishes dependencies across temporal horizons; Structure-Aware Latent World Modeling organises future latent representations along horizon, view and spatial dimensions to support fine-grained retrieval; and Action-Guided Factorized World Retrieval pulls the relevant future information out of that structured latent world based on the action representation as it evolves during denoising. The authors report effectiveness on two simulation benchmarks and six real-world robotic manipulation tasks.
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.