Test-Time Scaling for Small VLMs on Multilingual Visual MCQ
Summary
The study investigates test-time scaling (TTS) for small open vision-language models (VLMs) on the EXAMS-V multilingual visual multiple-choice benchmark, specifically using Qwen2.5-VL-7B-Instruct and Qwen3.5-4B. It finds that engineering details, such as parser format and decoding budget, are more critical than elaborate search or verification methods. A key discovery was that an early prompt format caused many chains to fail parsing, which was largely resolved by a standard answer cue and guided repair. Increasing the per-chain token limit from 1k to 2k tokens yielded a 3.7 percentage point (pp) accuracy gain, while sampling more chains (8 to 16) added only 0.15 pp. The largest improvement, +11.4 pp, came from switching to the newer Qwen3.5-4B policy. The best configuration achieved 84.1% on the ImageCLEF 2026 test split, ranking first on the Visual MCQ leaderboard.
Key takeaway
For Machine Learning Engineers optimizing small open-source VLMs for multilingual visual MCQ tasks, focus on foundational engineering aspects rather than complex inference-time scaling. You should prioritize increasing the per-chain token budget and implementing guided parse repair to address parse failures, as these yield greater accuracy gains than increasing chain counts or using elaborate search/selector methods. Critically, upgrading to a newer, more capable policy model like Qwen3.5-4B offers the most significant performance improvement.
Key insights
For small VLMs, engineering details like parsing and token budget are more impactful than complex search or selection methods.
Principles
- VLM parseability significantly impacts accuracy.
- Policy model upgrades yield larger gains than inference strategies.
- Prioritize token budget over chain count for small VLMs.
Method
The study evaluates describe-then-reason with PRM-guided beam search and flat self-consistency, using Qwen2.5-VL-7B-Instruct and Qwen3.5-4B. It includes guided parse repair for unparseable chains.
In practice
- Implement guided parse repair for VLM outputs.
- Increase per-chain token limits before sampling more chains.
- Prioritize newer VLM policies over complex inference methods.
Topics
- Test-Time Scaling
- Vision-Language Models
- Multilingual Reasoning
- Qwen3.5-4B
- ImageCLEF 2026
- Parseability
- Self-Consistency
Code references
Best for: Research Scientist, Computer Vision Engineer, AI Scientist, Machine Learning Engineer
Related on AIssential
See Counsel's argued verdicts on the open AI decisions leaders are weighing →
Editorial summary, takeaway, and curation by AIssential. Original article published by cs.CL updates on arXiv.org.