pith. sign in

arxiv: 2411.00238 · v2 · pith:F5NYIVJAnew · submitted 2024-10-31 · 💻 cs.AI · cs.CV· cs.LG· q-bio.NC

Understanding the Limits of Vision Language Models Through the Lens of the Binding Problem

classification 💻 cs.AI cs.CVcs.LGq-bio.NC
keywords modelsproblembindingfailureslanguageprocessingpuzzlingrepresent
0
0 comments X
read the original abstract

Recent work has documented striking heterogeneity in the performance of state-of-the-art vision language models (VLMs), including both multimodal language models and text-to-image models. These models are able to describe and generate a diverse array of complex, naturalistic images, yet they exhibit surprising failures on basic multi-object reasoning tasks -- such as counting, localization, and simple forms of visual analogy -- that humans perform with near perfect accuracy. To better understand this puzzling pattern of successes and failures, we turn to theoretical accounts of the binding problem in cognitive science and neuroscience, a fundamental problem that arises when a shared set of representational resources must be used to represent distinct entities (e.g., to represent multiple objects in an image), necessitating the use of serial processing to avoid interference. We find that many of the puzzling failures of state-of-the-art VLMs can be explained as arising due to the binding problem, and that these failure modes are strikingly similar to the limitations exhibited by rapid, feedforward processing in the human brain.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Do vision-language models search like humans? Reasoning tokens as a reaction-time analog in classic visual-search paradigms

    cs.AI 2026-06 unverdicted novelty 7.0

    Vision-language models show some human-like patterns in visual search effort (flat for features, rising for conjunctions) but diverge on target-present vs absent slopes and enumeration accuracy when reasoning tokens p...

  2. TraversalBench: Challenging Paths to Follow for Vision Language Models

    cs.CV 2026-04 unverdicted novelty 7.0

    TraversalBench shows self-intersections cause the sharpest performance drops for VLMs on exact path traversal, with errors localized at the first crossing.