Papers › Multi-label Cluster Discrimination for Visual Representation Learning

Multi-label Cluster Discrimination for Visual Representation Learning

24 Jul 2024arXiv:2407.17331archive 2025-07-28

Xiang An, Kaicheng Yang, Xiangzi Dai, Ziyong Feng, Jiankang Deng

Contrastive Language Image Pre-training (CLIP) has recently demonstrated success across various tasks due to superior feature representation empowered by image-text contrastive learning. However, the instance discrimination method used by CLIP can hardly encode the semantic structure of training data. To handle this limitation, cluster discrimination has been proposed through iterative cluster assignment and classification. Nevertheless, most cluster discrimination approaches only define a single pseudo-label for each image, neglecting multi-label signals in the image. In this paper, we propose a novel Multi-Label Cluster Discrimination method named MLCD to enhance representation learning. In the clustering step, we first cluster the large-scale LAION-400M dataset into one million centers based on off-the-shelf embedding features. Considering that natural images frequently contain multiple visual objects or attributes, we select the multiple closest centers as auxiliary class labels. In the discrimination step, we design a novel multi-label classification loss, which elegantly separates losses from positive classes and negative classes, and alleviates ambiguity on decision boundary. We validate the proposed multi-label cluster discrimination method with experiments on different scales of models and pre-training datasets. Experimental results show that our method achieves state-of-the-art performance on multiple downstream tasks including linear probe, zero-shot classification, and image-text retrieval. Code and models have been released at https://github.com/deepglint/unicom .

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2407.17331")

Code

Syntology Ran 7 of 11 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

deepglint/unicom officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 7 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran
4unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from deepglint/unicom. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

MLCDEncoder deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · 7d1b1fa84c7948b6 · report
MLCDEncoderLayer deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · 1147651f76ba5063 · report
MLCDMLP deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · 0744bf53c4214b05 · report
MLCDSdpaAttention deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · 27eecf02ec652597 · report
MLCDVisionConfig deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · ff45de9afb241b5f · report
MLCDVisionEmbeddings deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran fingerprinted MIT (permissive) · 47857c277feef274 · report
VisionRotaryEmbedding deepglint/unicom/mlcd/vit_rope2d_hf.py official repository ran MIT (permissive) · a12357d48c1c9ffa · report
MLCDPreTrainedModel deepglint/unicom/mlcd/vit_rope2d_hf.py official repository unverified MIT (permissive) · 47b28dd1d00a8546 · report
MLCDVisionModel deepglint/unicom/mlcd/vit_rope2d_hf.py official repository unverified MIT (permissive) · b17ea9baa7a3c22c · report
MLCDVisionTransformer deepglint/unicom/mlcd/vit_rope2d_hf.py official repository unverified MIT (permissive) · 453f2f4154c6fa96 · report
apply_rotary_pos_emb_vision deepglint/unicom/mlcd/vit_rope2d_hf.py official repository unverified MIT (permissive) · 9cbc76fa9f2e80cb · report

Tasks

Contrastive LearningImage-text RetrievalMUlTI-LABEL-ClASSIFICATIONMulti-Label ClassificationPseudo LabelReferring Expression SegmentationRepresentation LearningSelf-Supervised Image ClassificationText RetrievalVisual Question Answering (VQA)Zero-Shot Learning

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Referring Expression Segmentation RefCOCO testA MLCD-Seg-7B Overall IoU 85.3 #3 of 13 Archive leaderboard report
Referring Expression Segmentation RefCOCO testB MLCD-Seg-7B Overall IoU 81.5 #3 of 13 Archive leaderboard report
Referring Expression Segmentation RefCOCO+ test B MLCD-Seg-7B Overall IoU 75.6 #1 of 30 Archive leaderboard report
Referring Expression Segmentation RefCOCO+ testA MLCD-Seg-7B Overall IoU 82.9 #2 of 30 Archive leaderboard report
Referring Expression Segmentation RefCOCO+ val MLCD-Seg-7B Overall IoU 79.4 #1 of 33 Archive leaderboard report
Referring Expression Segmentation RefCOCOg-test MLCD-Seg-7B Overall IoU 80.5 #2 of 18 Archive leaderboard report
Referring Expression Segmentation RefCOCOg-val MLCD-Seg-7B Overall IoU 79.9 #1 of 23 Archive leaderboard report
Referring Expression Segmentation RefCoCo val MLCD-Seg-7B Overall IoU 83.6 #4 of 37 Archive leaderboard report
Visual Question Answering (VQA) DocVQA test MLCD-Embodied-7B ANLS 0.916 #2 of 33 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

CLIP

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections