UPDF AI

Trust but Verify: Programmatic VLM Evaluation in the Wild

Viraj Prabhu,Senthil Purushwalkam,2 Authors,Ran Xu

2024 · DOI: 10.1109/ICCV51701.2025.00312
IEEE International Conference on Computer Vision · 2 Citations

TLDR

This work proposes Programmatic VLM Evaluation (PROVE), a new benchmarking paradigm for evaluating VLM responses to open-ended queries that serves as a foundation for developing nextgeneration VLMs that balance helpfulness with truthfulness.

Abstract

Vision-Language Models (VLMs) frequently hallucinate responses to visual queries, undermining their reliability for critical applications. However, quantifying the effect of such hallucinations in free-form responses to open-ended queries requires visually verifying each claim within the response, which is highly challenging. We propose Programmatic VLM Evaluation (PROVE), a new benchmarking paradigm for evaluating VLM responses to open-ended queries. To construct PROVE, we provide a large language model with a high-fidelity scene-graph representation constructed from a detailed image caption, and prompt it to generate i) diverse and challenging question-answer (QA) pairs that test a range of image understanding capabilities, and ii) programs that can be executed over the scene graph object to verify each QA pair. We thus construct a benchmark of 10.6k challenging but grounded visual QA pairs. Next, we propose a scene graph-based evaluation framework to programmatically measure both the helpfulness and truthfulness of free-form VLM responses to questions from our benchmark that does not rely on subjective LLM judgments. We extensively benchmark a range of VLMs on PROVE, and uncover a concerning tradeoff where models that provide more helpful responses often hallucinate more, whereas truthful models tend to be less informative. PROVE serves as a foundation for developing nextgeneration VLMs that balance helpfulness with truthfulness. Project page: prove-explorer.netlify.app