Defeasible Visual Entailment: Benchmark, Evaluator, and Reward-Driven Optimization
Yue Zhang, Liqiang Jing, Vibhav Gogate
TL;DR
This work defines Defeasible Visual Entailment (DVE), a task that allows textual updates to modify the entailment relationship between an image $I$ and a hypothesis $H$. It builds a first DVE benchmark by pairing Flickr30k premises with SNLI hypotheses and $ extit{delta-NLI}$ updates, introducing classification and generation sub-tasks. A novel inference-aware evaluator, trained with pairwise contrastive learning and categorical information loss, outputs an entailment-strength score $s$ reflecting how updates shift $H$'s truth likelihood given $I$, and is validated against human judgments. To further improve update quality, a reward-driven update optimization loop uses evaluator feedback to refine generated updates beyond baseline multimodal models. Experimental results on classification and generation demonstrate strong GPT-4o performance and show that the evaluator correlates better with human judgments than traditional metrics, with the optimization framework yielding higher-quality, more effective updates for defeasible multimodal reasoning.
Abstract
We introduce a new task called Defeasible Visual Entailment (DVE), where the goal is to allow the modification of the entailment relationship between an image premise and a text hypothesis based on an additional update. While this concept is well-established in Natural Language Inference, it remains unexplored in visual entailment. At a high level, DVE enables models to refine their initial interpretations, leading to improved accuracy and reliability in various applications such as detecting misleading information in images, enhancing visual question answering, and refining decision-making processes in autonomous systems. Existing metrics do not adequately capture the change in the entailment relationship brought by updates. To address this, we propose a novel inference-aware evaluator designed to capture changes in entailment strength induced by updates, using pairwise contrastive learning and categorical information learning. Additionally, we introduce a reward-driven update optimization method to further enhance the quality of updates generated by multimodal models. Experimental results demonstrate the effectiveness of our proposed evaluator and optimization method.
