MétaCan
Menu
Back to cohort
Record W2963651499 · doi:10.48550/arxiv.1707.03017

Learning Visual Reasoning Without Strong Priors

2017· preprint· en· W2963651499 on OpenAlexaff
Ethan Perez, H. de Vries, Florian Strub, Vincent Dumoulin

Bibliographic record

VenueHAL (Le Centre pour la Communication Scientifique Directe) · 2017
Typepreprint
Languageen
FieldComputer Science
TopicMultimodal Machine Learning Applications
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer scienceArtificial intelligenceVisual reasoningExploitMachine learningNormalization (sociology)Benchmark (surveying)Process (computing)Deep learningNatural language processing

Abstract

fetched live from OpenAlex

Achieving artificial visual reasoning - the ability to answer image-related questions which require a multi-step, high-level process - is an important step towards artificial general intelligence. This multi-modal task requires learning a question-dependent, structured reasoning process over images from language. Standard deep learning approaches tend to exploit biases in the data rather than learn this underlying structure, while leading methods learn to visually reason successfully but are hand-crafted for reasoning. We show that a general-purpose, Conditional Batch Normalization approach achieves state-of-the-art results on the CLEVR Visual Reasoning benchmark with a 2.4% error rate. We outperform the next best end-to-end method (4.5%) and even methods that use extra supervision (3.1%). We probe our model to shed light on how it reasons, showing it has learned a question-dependent, multi-step process. Previous work has operated under the assumption that visual reasoning calls for a specialized architecture, but we show that a general architecture with proper conditioning can learn to visually reason effectively.

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.001
metaresearch head score (Gemma)0.008
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.008
Threshold uncertainty score0.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0020.005
Open science0.0030.002
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0080.003

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.014
GPT teacher head0.282
Teacher spread0.268 · 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

Citations23
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueHAL (Le Centre pour la Communication Scientifique Directe)Same topicMultimodal Machine Learning ApplicationsFrench-language works237,207