arXiv Computer Vision
Why VLMs Miss Small Objects, and When Zooming In Is Safe
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
arXiv AI
Oct 2
Not All Error Yields to Scale: Where Scaling Stops in Vision-Language Inference
The paper introduces the Separable Law, a framework that predicts how vision‑language model performance varies with language backbone size and visual token count. By fitting this law to 26 InternVL and QwenVL models across a range of backbone sizes (1B–72B) and image resolutions (224–8K pixels), the authors show that some question types scale predictably with model capacity while others do not. The law also provides a closed‑form rule for allocating compute between backbone size and visual tokens, helping to choose near‑optimal model and image sizes under a fixed budget.
arXiv Computation and Language
Aug 25
Learning to Look Again: Loss-Gap Supervision for Free-form Crop Routing in Vision-Language Models
arXiv:2608.21762v1 Announce Type: cross Abstract: Vision-language models (VLMs) fail many detail-centric questions for a concrete reason: the answer is visible in the image, yet lost after the image...
arXiv AI
Oct 15
Attention Sinks in VLMs Are Borrowed, Not Seen
arXiv:2610.15855v1 Announce Type: new Abstract: We study how to detect and mitigate visual attention sinks in vision-language models (VLMs). Visual attention sinks are image tokens that absorb a larg...
arXiv Computer Vision
Sep 1
Variable-Granularity Tokenization for High-Resolution Object Detection
arXiv:2608.28706v1 Announce Type: new Abstract: ViT detectors fix a uniform token grid before any learned stage. A native-resolution aerial detector must then choose between resolving few-pixel objec...
arXiv AI
Jul 15
Visual Access Boundaries in Vision-Language Model Reasoning
arXiv:2607. 12815v1 Announce Type: new Abstract: Chain-of-Thought (CoT) prompting is widely used as a test-time scaling strategy for Vision-Language Models (VLMs), but it remains unclear what is extended when VLMs generate longer reasoning traces.
arXiv Computer Vision
Sep 7
FAVE: Foveated Adaptive Visual Encoding for Efficient Fine-Grained Visual Understanding
FAVE (Foveated Adaptive Visual Encoding) is a lightweight, variable‑resolution Vision Transformer that encodes user‑selected image regions at high acuity while maintaining the image’s native geometry. In controlled experiments on small‑object ImageNet crops, FAVE outperforms a fixed‑resolution ViT by 9.4 top‑1 points while using 12.7× fewer FLOPs. When added as a local branch to FastVLM, FAVE improves TextVQA by 1.60 points and GQA attribute accuracy by 1.31 points, achieving a 3.3× speedup over SmolVLM2-2.2B with only 16 extra local tokens.