Papers › Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-ID

Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-ID

4 Jun 2020NeurIPS 2020 12arXiv:2006.02713archive 2025-07-28

Yixiao Ge, Feng Zhu, Dapeng Chen, Rui Zhao, Hongsheng Li

Domain adaptive object re-ID aims to transfer the learned knowledge from the labeled source domain to the unlabeled target domain to tackle the open-class re-identification problems. Although state-of-the-art pseudo-label-based methods have achieved great success, they did not make full use of all valuable information because of the domain gap and unsatisfying clustering performance. To solve these problems, we propose a novel self-paced contrastive learning framework with hybrid memory. The hybrid memory dynamically generates source-domain class-level, target-domain cluster-level and un-clustered instance-level supervisory signals for learning feature representations. Different from the conventional contrastive learning strategy, the proposed framework jointly distinguishes source-domain classes, and target-domain clusters and un-clustered instances. Most importantly, the proposed self-paced method gradually creates more reliable clusters to refine the hybrid memory and learning targets, and is shown to be the key to our outstanding performance. Our method outperforms state-of-the-arts on multiple domain adaptation tasks of object re-ID and even boosts the performance on the source domain without any extra annotations. Our generalized version on unsupervised object re-ID surpasses state-of-the-art algorithms by considerable 16.7% and 7.9% on Market-1501 and MSMT17 benchmarks.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

Syntology holds a reference implementation of Self-paced Contrastive Learning with Hybrid Memory, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Self-paced Contrastive Learning with Hybrid Memory') (how to connect); the free check have('2006.02713') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 5 code samples harvested from 2 repositories linked to this paper: 3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 3 samples from 1 repository, 3 ran (2 with no instrument failure; 1 where Syntology's instrument failed); community (archive-listed): 2 samples from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

yxgeee/SpCL officialmentioned in papermentioned on GitHubpytorchSyntology: 3 samples, 3 ran (1 instrument-failed) · 0 unverified report
GJTNB/reading-memo mentioned on GitHubpytorchSyntology: not harvested report
open-mmlab/OpenUnReID mentioned on GitHubpytorchSyntology: 2 samples, 0 ran · 2 unverified 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

5 samples harvested: 3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
2ran
2unverified

Licence: 0 of the 5 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

yxgeee/SpCL official repository 3 samples, 3 ran (1 instrument-failed) · 0 unverified
HM spcl/models/hm.py ran MIT (permissive) · 198515d7a87b4074 · report fixture: returned HM · level recorded 2026-09-22
HybridMemory spcl/models/hm.py ran · metamorphic tier: deterministic MIT (permissive) · 94a0cbacdd9fae2e · report fixture: returned HybridMemory · level recorded 2026-09-22
hm spcl/models/hm.py ran · our draft was wrong MIT (permissive) · 6bee8a7a58df869e · report fixture: signature inputs:Tensor/2/float, indexes:Tensor/1/int, features:Tensor/2/float, momentum:float/0/float · returned Tensor · level recorded 2026-09-22
open-mmlab/OpenUnReID community (archive-listed) 2 samples, 0 ran · 2 unverified
HybridMemory openunreid/models/losses/memory.py unverified Apache-2.0 (permissive) · 21c9ef17b1caacd1 · report
hm openunreid/models/losses/memory.py unverified Apache-2.0 (permissive) · 669dde59f08f64b3 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

3 assemblies on this paper: 2 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).

generated Assembly for Self-paced Contrastive Learning with Hybrid Memory (graph method: Self-paced Contrastive Learning with Hybrid Memory), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).

label matches by construction: the code was generated for this method (not judged by a model)

  1. unified_contrastive_loss entry · level 3 · ran; the contract check could not run · e011b37fb8750981f2ae1674024952d9264c1fc87e15faece58f6339d44cc2e6

2 sibling assemblies for Self-paced Contrastive Learning with Hybrid Memory (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Self-paced Contrastive Learning with Hybrid Memory (graph method: Self-paced Contrastive Learning with Hybrid Memory). 3 bricks; individually on a fixture: 3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. HybridMemory entry · level 1 · ran · 94a0cbacdd9fae2e
  2. hm helper · level 1 · ran · our draft was wrong · 6bee8a7a58df869e
  3. HM helper · level 1 · ran · 198515d7a87b4074

harvested Assembly for Self-paced Contrastive Learning with Hybrid Memory (graph method: Self-paced Contrastive Learning with Hybrid Memory). 2 bricks; individually on a fixture: 0 ran · 2 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. HybridMemory entry · level 0 · unverified · 21c9ef17b1caacd1
  2. hm helper · level 0 · unverified · 669dde59f08f64b3

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2006.02713") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

ClusteringContrastive LearningDomain AdaptationObjectPseudo LabelUnsupervised Domain AdaptationUnsupervised Person Re-Identification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Unsupervised Domain Adaptation Duke to MSMT SpCL mAP 26.5 #4 of 13 Archive leaderboard report
Unsupervised Domain Adaptation Duke to MSMT SpCL rank-1 53.1 #4 of 13 Archive leaderboard report
Unsupervised Domain Adaptation Duke to MSMT SpCL rank-10 70.5 #4 of 13 Archive leaderboard report
Unsupervised Domain Adaptation Duke to MSMT SpCL rank-5 65.8 #4 of 13 Archive leaderboard report
Unsupervised Domain Adaptation Duke to Market SpCL mAP 76.7 #6 of 26 Archive leaderboard report
Unsupervised Domain Adaptation Duke to Market SpCL rank-1 90.3 #6 of 26 Archive leaderboard report
Unsupervised Domain Adaptation Duke to Market SpCL rank-10 97.7 #6 of 26 Archive leaderboard report
Unsupervised Domain Adaptation Duke to Market SpCL rank-5 96.2 #6 of 26 Archive leaderboard report
Unsupervised Domain Adaptation Market to Duke SpCL mAP 68.8 #6 of 25 Archive leaderboard report
Unsupervised Domain Adaptation Market to Duke SpCL rank-1 82.9 #6 of 25 Archive leaderboard report
Unsupervised Domain Adaptation Market to Duke SpCL rank-10 92.5 #6 of 25 Archive leaderboard report
Unsupervised Domain Adaptation Market to Duke SpCL rank-5 90.1 #6 of 25 Archive leaderboard report
Unsupervised Domain Adaptation Market to MSMT SpCl mAP 25.4 #7 of 17 Archive leaderboard report
Unsupervised Domain Adaptation Market to MSMT SpCl rank-1 51.6 #7 of 17 Archive leaderboard report
Unsupervised Domain Adaptation Market to MSMT SpCl rank-10 69.7 #7 of 17 Archive leaderboard report
Unsupervised Domain Adaptation Market to MSMT SpCl rank-5 64.3 #7 of 17 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Large SPCL R-1 32.7 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Large SPCL R-10 - #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Large SPCL R-5 55.7 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Large SPCL mAP 16.6 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Medium SPCL R-1 42.0 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Medium SPCL R-10 - #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Medium SPCL R-5 66.1 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Medium SPCL mAP 21.5 #9 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Small SPCL R-1 48.8 #8 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Small SPCL R-10 - #8 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Small SPCL R-5 72.8 #8 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VERI-Wild Small SPCL mAP 25.1 #8 of 9 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VeRi-776 SPCL Rank-1 80.4 #8 of 14 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VeRi-776 SPCL Rank-5 86.8 #8 of 14 Archive leaderboard report
Unsupervised Domain Adaptation VehicleID to VeRi-776 SPCL mAP 38.9 #8 of 14 Archive leaderboard report
Unsupervised Person Re-Identification DukeMTMC-reID SpCL MAP 65.3 #8 of 13 Archive leaderboard report
Unsupervised Person Re-Identification DukeMTMC-reID SpCL Rank-1 81.2 #8 of 13 Archive leaderboard report
Unsupervised Person Re-Identification DukeMTMC-reID SpCL Rank-10 92.2 #8 of 13 Archive leaderboard report
Unsupervised Person Re-Identification DukeMTMC-reID SpCL Rank-5 90.3 #8 of 13 Archive leaderboard report
Unsupervised Person Re-Identification Market-1501 SpCL MAP 72.6 #17 of 23 Archive leaderboard report
Unsupervised Person Re-Identification Market-1501 SpCL Rank-1 87.7 #17 of 23 Archive leaderboard report
Unsupervised Person Re-Identification Market-1501 SpCL Rank-10 96.9 #17 of 23 Archive leaderboard report
Unsupervised Person Re-Identification Market-1501 SpCL Rank-5 95.2 #17 of 23 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.

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