MétaCan
Menu
Back to cohort
Record W7131095609 · doi:10.1109/iccvw69036.2025.00782

DIVE-Doc: Downscaling Foundational Image Visual Encoder into Hierarchical Architecture for DocVQA

2025· article· W7131095609 on OpenAlexaff
Rayane Bencharef, Abderrahmane Rahiche, M. Cheriet

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicMultimodal Machine Learning Applications
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsEncoderDistillationImage (mathematics)Code (set theory)ArchitectureForcing (mathematics)Visualization

Abstract

fetched live from OpenAlex

In the DocVQA context, current end-to-end models ei-ther use lightweight architectures that run efficiently on small devices but have limited performance or rely on LVLMs that achieve high performance at significant computational cost. Thus, we present DIVE-Doc, an end-to-end model that bridges this gap by distilling a 400M-parameter SigLIP visual encoder into a small hierarchical Swin transformer, preserving LVLM performance with only one-fifth of the visual encoder's parameters. We investi-gate two distillation strategies: Fixed-Resolution Distillation (FRD), which matches teacher-student patch counts by forcing student input resolution, and Adaptive-Resolution Distillation (ARD), which aligns mismatched sequences via parameter-free interpolation, enabling various input reso-lutions. Fine-tuned with QLoRA, DIVE-Doc attains 82.7% ANLS, outperforming lightweight models and sitting within 2 ANLS of its teacher PaliGEMMA on DocVQA, while halving the teacher visual encoder's latency and supporting higher input resolutions. Analysis on RVL-CDIP and Do-cLayNet shows that the visual encoder captures document-level structure but delegates fine-grained layout reasoning to the language model decoder. The code is available at https://github.com/JayRay5/DIVE-Doc.

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.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.015
Threshold uncertainty score0.051

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0150.006

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.009
GPT teacher head0.339
Teacher spread0.331 · 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 designBench or experimental
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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicMultimodal Machine Learning ApplicationsFrench-language works237,207