aspireai.
PUBLIC EDITION

BedBench found vision-language models get 93 percent of what humans get on per-color counting, and 7 percent on the actual answers

AspireAI community · arXiv
Vision-language models can answer individual visual questions correctly while still failing to recover and consistently use an object's exact properties. BedBench is a controlled benchmark of thirteen procedurally generated 3D tasks designed to separate those two things, run against twelve open-weight and four frontier models. On per-color counting, humans reach 93.3% accuracy and the best model reaches 7.2%. Targeted fine-tuning lifts one model from 3.0% to 68.6%, but its answers about the most common colors then stay inconsistent with its own per-color counts. Supplying those counts as text improves its judgments, which suggests recovering a property and using it consistently are separate problems. The authors also probe where the failure sits: in Qwen3.5-27B the exact counts are recoverable at the language model's input, but its own answers rarely recover them (65.0% for the probe against 3.0% for the model), and image-removal controls show some apparent successes need no visual evidence at all. The limitation is real - this is a synthetic, procedurally generated benchmark, so it isolates a mechanism rather than measuring everyday visual reasoning.
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.