Papers › Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach

Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach

7 Feb 2023arXiv:2302.03357archive 2025-07-28

Xiang Lan, Hanshu Yan, Shenda Hong, Mengling Feng

Not all positive pairs are beneficial to time series contrastive learning. In this paper, we study two types of bad positive pairs that can impair the quality of time series representation learned through contrastive learning: the noisy positive pair and the faulty positive pair. We observe that, with the presence of noisy positive pairs, the model tends to simply learn the pattern of noise (Noisy Alignment). Meanwhile, when faulty positive pairs arise, the model wastes considerable amount of effort aligning non-representative patterns (Faulty Alignment). To address this problem, we propose a Dynamic Bad Pair Mining (DBPM) algorithm, which reliably identifies and suppresses bad positive pairs in time series contrastive learning. Specifically, DBPM utilizes a memory module to dynamically track the training behavior of each positive pair along training process. This allows us to identify potential bad positive pairs at each epoch based on their historical training behaviors. The identified bad pairs are subsequently down-weighted through a transformation module, thereby mitigating their negative impact on the representation learning process. DBPM is a simple algorithm designed as a lightweight plug-in without learnable parameters to enhance the performance of existing state-of-the-art methods. Through extensive experiments conducted on four large-scale, real-world time series datasets, we demonstrate DBPM's efficacy in mitigating the adverse effects of bad positive pairs.

PaperPDFCodeCode 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.

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

Code

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

By repository: official repository: 9 samples from 1 repository, 7 ran (4 with no instrument failure; 3 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.

lanxiang1017/dynamicbadpairmining_iclr24 officialmentioned in paperpytorchSyntology: 9 samples, 7 ran (3 instrument-failed) · 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

9 samples harvested: 7 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 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.

2ran · our draft was wrong
1ran; the contract check could not run
4ran
2unverified

Licence: 9 of the 9 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 lanxiang1017/dynamicbadpairmining_iclr24. “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”. For 4 samples that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

lanxiang1017/dynamicbadpairmining_iclr24 official repository 9 samples, 7 ran (3 instrument-failed) · 2 unverified
BasicBlock in 126 papers
census: 6 implementations from 6 papers, 5 distinct outputs on one shared input
models/dbpm_model.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · 97f4b7a71f2a6dc1 · report fixture: returned BasicBlock · level recorded 2026-09-22
InfoNCE in 15 papers models/dbpm_model.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · 13196a05922a4556 · report fixture: returned InfoNCE · level recorded 2026-09-22
LinearClassifier models/dbpm_model.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · 070f933207345be3 · report fixture: returned LinearClassifier · level recorded 2026-09-22
ResNet in 139 papers models/dbpm_model.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · d18829d3a6df39e9 · report fixture: returned ResNet · level recorded 2026-09-22
ResNet34 in 91 papers models/dbpm_model.py ran · our draft was wrong no licence file found · pointer only · 3a802f69ecd390d5 · report fixture: signature input_channels:int/0/int, projection_output_dim:int/0/int · returned ResNet · level recorded 2026-09-22
get_scores in 22 papers models/dbpm_model.py ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only · c18b03944ec98848 · report fixture: signature one_hot_labels:ndarray/2/int, probs:ndarray/2/float · returned tuple · level recorded 2026-09-22
loss_ntxent models/dbpm_model.py ran · our draft was wrong no licence file found · pointer only · 1743b3639fe9448a · report fixture: signature features:list/1/Tensor, device:str/0/str · returned Tensor · level recorded 2026-09-22
save_model in 19 papers models/dbpm_model.py unverified no licence file found · pointer only · c995c24f3dfc702c · report
simpleModel models/dbpm_model.py unverified no licence file found · pointer only · e99558104673f3e0 · 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. 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.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Dynamic Bad Pair Mining (DBPM) (graph method: Dynamic Bad Pair Mining (DBPM)). 9 bricks; individually on a fixture: 7 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified. The assembly has not been run end-to-end.

  1. simpleModel entry · level 0 · unverified · e99558104673f3e0
  2. LinearClassifier model · level 1 · ran · 070f933207345be3
  3. ResNet34 helper · level 1 · ran · our draft was wrong · 3a802f69ecd390d5
  4. loss_ntxent helper · level 1 · ran · our draft was wrong · 1743b3639fe9448a
  5. save_model helper · level 0 · unverified · c995c24f3dfc702c
  6. get_scores helper · level 1 · ran; the contract check could not run (RAISES) · c18b03944ec98848
  7. BasicBlock helper · level 1 · ran · 97f4b7a71f2a6dc1
  8. ResNet model · level 1 · ran · d18829d3a6df39e9
  9. InfoNCE loss · level 1 · ran · 13196a05922a4556

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="2302.03357") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Contrastive LearningRepresentation LearningTime SeriesTime Series Analysis

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive Learning

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