Evidence map›Paper›PMID 39632939›Full record

ArticleScientific reports2024

Kalman contrastive unsupervised representation learning.

Mohammad Mahdi Jahani Yekta

Abstract read
In one paragraph

Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Mohammad Mahdi Jahani YektaDepartment of Computer Science, Stanford University, 353 Jane Stanford Way, Stanford, CA, 94305, USA. m_mahdi_jahani@yahoo.com.ORCID https://orcid.org/0000-0002-3478-9607

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We first propose a Kalman contrastive (KalCo) framework for unsupervised representation learning by dictionary lookup. It builds a dynamic dictionary of encoded representation keys with a queue and a Kalman filter encoder, to which the encoded queries are matched. The large and consistent dictionaries built this way increase the accuracy of KalCo to values much higher than those of the famous momentum contrastive (MoCo) unsupervised learning, which is actually a very simplified version of KalCo with only a fixed scaler momentum coefficient. For a standard pretext task of instance discrimination on the ImageNet-1M (IN-1M) dataset; e.g., KalCo yields an accuracy of 80%, compared to 55% for MoCo. Similar results are obtained also on Instagram-1B (IG-1B). For the same task on a bunch of OpenfMRI datasets, the accuracy is 84%. We then upgrade KalCo to KalCo v2 by using an MLP projection head and more data augmentation, along also with a larger memory bank. The accuracy of KalCo v2 is around the even more impressive amounts of 90% on IN-1M and IG-1B, and 95% on OpenfMRI, the first being about 3% higher than those of three most-cited recent alternatives.

Indexed as

Contrastive unsupervised learningDictionary buildingKalman filterMoCoRegularized optimization

Identifiers

PMID39632939
PMCPMC11618453

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.