MétaCan
Menu
Back to cohort

Decompose and Compare Consistency: Measuring VLMs’ Answer Reliability via Task-Decomposition Consistency Comparison

2024· article· en· W4404783705 on OpenAlexfundno aff
Qian Yang, Weixiang Yan, Aishwarya Agrawal

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsnot available
FundersCanadian Institute for Advanced Research
KeywordsConsistency (knowledge bases)Reliability (semiconductor)Computer scienceTask (project management)DecompositionReliability engineeringData miningArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Despite tremendous advancements, current state-of-the-art Vision-Language Models (VLMs) are still far from perfect.They tend to hallucinate and may generate biased responses.In such circumstances, having a way to assess the reliability of a given response generated by a VLM is quite useful.Existing methods, such as estimating uncertainty using answer likelihoods or prompt-based confidence generation, often suffer from overconfidence.Other methods use self-consistency comparison but are affected by confirmation biases.To alleviate these, we propose Decompose and Compare Consistency (DeCC) for reliability measurement.By comparing the consistency between the direct answer generated using the VLM's internal reasoning process, and the indirect answers obtained by decomposing the question into sub-questions and reasoning over the sub-answers produced by the VLM, DeCC measures the reliability of VLM's direct answer.Experiments across six vision-language tasks with three VLMs show DeCC's reliability estimation achieves better correlation with task accuracy compared to the existing methods.The code is publicly available at https: //github.com/MyLittleChange/DeCC.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.023
metaresearch head score (Gemma)0.195
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.023
Threshold uncertainty score0.120

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0230.195
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.002
Science and technology studies0.0010.001
Scholarly communication0.0030.004
Open science0.0010.004
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0030.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.032
GPT teacher head0.286
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicTopic ModelingFrench-language works237,207