AIarXiv

Ranked by formulaVerdict: Notable

Rethinking Projector Training in Multimodal LLMs

Multimodal LLMs are typically trained by first aligning a vision encoder with a language model via projector training on large image-caption datasets, followed by joint training of the full multimodal model.

By Gröger, Ouerghemi, Wen +1

Score████░░░░░░4.2

Key numbers

  • 20 % of the data for
  • 98 % of its score across

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Multimodal LLMs are typically trained by first aligning a vision encoder with a language model via projector training on large image-caption datasets, followed by joint training of the full multimodal model. Despite its widespread use, the role of the projector training stage remains poorly understood. We find that (i) using only $10$ to 20% of the data for training the projector already recovers most downstream performance gains, and (ii) projectors trained on different datasets can be linearly interpolated while largely preserving performance. These results suggest that projector training mainly performs a coarse alignment, which many different projectors achieve equally well. Motivated by these findings, we propose PORTAL, a training-free projector initialization that requires neither paired image-caption data nor gradient-based optimization, but only per-modality summary statistics. PORTAL computes an optimal-transport-based map between Gaussian approximations of the vision and language feature distributions on a shared principal subspace, so that the projector training stage can be skipped entirely. Without any paired data, PORTAL matches the standard pipeline trained on 558k image-caption pairs across six LLM backbones, two vision encoders, and 16 benchmarks. It outperforms that pipeline in $3$ of $7$ (vision encoder, LLM) settings and reaches an average 98% of its score across the other four.

Fabian Gröger, Naël Ouerghemi, Shuo Wen, Maria Brbić

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose, we report); breadth (many tasks); gains (outperforms); novelty (alternative to status quo); verification (multiple benchmarks); stakes (general AI).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.2

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.9 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.8 / 10
Shrunk toward the desk prior by editor confidence (44%).
Attention
30%
Citations, upvotes, points, mentions.
Freshness
26%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 17, 2026, 01:35 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 17, 2026, 01:35 UTC)
  • Hugging Face upvotes10 (reference 25, via hf-daily, Oct 17, 2026, 13:49 UTC)
  • GitHub stars3 (reference 250, via hf-daily, Oct 17, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v7 on Oct 18, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.CV, cs.AI, cs.CL
  • BRIEF, No.6 in the Artificial Intelligence edition of October 18, 2026.