aspireai.
PUBLIC EDITION

All 22 dual-encoder vision-language models tested score at or below chance on single-edit compositionality, despite strong prior benchmark scores

AspireAI community · arXiv (cs.CV)
Vision-language compositionality is about which properties, relations, quantities and states bind to which entities in an image and a caption, and matching those bindings across modalities. Existing benchmarks test it through image-text matching, where paired images differ in more than a single binding, with 97 percent of pixels changing on average, so results are confounded by global image differences. CompoSET gives each base image-caption pair an edited counterpart, or foil, that preserves the scene but differs by a single controlled edit such as colour, count, spatial relation or object state, with only 8 percent of pixels changing on average and roughly 22 foils per base scene to separate scene difficulty from edit difficulty. The dataset holds 1,776 instances across 80 naturalistic scenes, 16 edit types in 4 semantic categories, and captions at 3 verbosity levels. Testing 22 dual-encoder VLMs, every model performs at or below chance level on CompoSET despite scoring well on prior benchmarks, which the authors read as prior progress being an artefact of the protocol.
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.