Revisiting Multi-Task Visual Representation Learning

Shangzhe Di, Zhonghua Zhai, Weidi Xie
1/20/2026
cs.CV

No official code found. Best implementation: Becomebright/MTV (22 stars, Apache-2.0, last commit 2026-01-21).

Abstract

Current visual representation learning remains bifurcated: vision-language models (e.g., CLIP) excel at global semantic alignment but lack spatial precision, while self-supervised methods (e.g., MAE, DINO) capture intricate local structures yet struggle with high-level semantic context. We argue that these paradigms are fundamentally complementary and can be integrated into a principled multi-task framework, further enhanced by dense spatial supervision. We introduce MTV, a multi-task visual pretraining framework that jointly optimizes a shared backbone across vision-language contrastive, self-supervised, and dense spatial objectives. To mitigate the need for manual annotations, we leverage high-capacity "expert" models -- such as Depth Anything V2 and OWLv2 -- to synthesize dense, structured pseudo-labels at scale. Beyond the framework, we provide a systematic investigation into the mechanics of multi-task visual learning, analyzing: (i) the marginal gain of each objective, (ii) task synergies versus interference, and (iii) scaling behavior across varying data and model scales. Our results demonstrate that MTV achieves "best-of-both-worlds" performance, significantly enhancing fine-grained spatial reasoning without compromising global semantic understanding. Our findings suggest that multi-task learning, fueled by high-quality pseudo-supervision, is a scalable path toward more general visual encoders.

View on arXivView PDF

Code Implementations(1)

Becomebright/MTVCommunity64%
Apache-2.0

Revisiting Multi-Task Visual Representation Learning

220Jan 19, 20269 months agoApache-2.0

Similar Papers

Cite this paper

@article{di2026revisiting,
  title  = {Revisiting Multi-Task Visual Representation Learning},
  author = {Shangzhe Di and Zhonghua Zhai and Weidi Xie},
  year   = {2026},
  eprint = {2601.13886},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.13886v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.13886.svg)](https://codeofpaper.com/paper/2601.13886)

Discussion