Papers › Max-Margin Contrastive Learning

Max-Margin Contrastive Learning

21 Dec 2021arXiv:2112.11450archive 2025-07-28

Anshul Shah, Suvrit Sra, Rama Chellappa, Anoop Cherian

Standard contrastive learning approaches usually require a large number of negatives for effective unsupervised learning and often exhibit slow convergence. We suspect this behavior is due to the suboptimal selection of negatives used for offering contrast to the positives. We counter this difficulty by taking inspiration from support vector machines (SVMs) to present max-margin contrastive learning (MMCL). Our approach selects negatives as the sparse support vectors obtained via a quadratic optimization problem, and contrastiveness is enforced by maximizing the decision margin. As SVM optimization can be computationally demanding, especially in an end-to-end setting, we present simplifications that alleviate the computational burden. We validate our approach on standard vision benchmark datasets, demonstrating better performance in unsupervised representation learning over state-of-the-art, while having better empirical convergence properties.

PaperPDFCodeCode Syntology ran

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 12 code samples harvested from 1 repository linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 12 samples from 1 repository, 5 ran (5 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-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 5 samples that ran has no recorded date.

anshulbshah/MMCL officialmentioned on GitHubpytorchMITSyntology: 12 samples, 5 ran (0 instrument-failed) · 7 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

12 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 7 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 · honoured contract
4ran
7unverified

Licence: 2 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. For 2 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from anshulbshah/MMCL. “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.

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.

anshulbshah/MMCL official repository 12 samples, 5 ran (0 instrument-failed) · 7 unverified
accuracy in 872 papers
census: 8 implementations from 7 papers, 7 distinct outputs across 6 buckets, one shared input per bucket
models/losses.py ran MIT (permissive) · 11bc56dd2ecb7644 · report fixture: signature logits:Tensor/2/float, labels:Tensor/2/int, k:int/0/int · returned Tensor · level recorded 2026-09-24
compute_kernel in 13 papers models/losses.py ran MIT (permissive) · 9498c0875cc30496 · report fixture: signature X:Tensor/2/float, Y:Tensor/2/float, gamma:float/0/float, kernel_type:str/0/str · returned Tensor · level recorded 2026-09-24
compute_kernel_new CIFAR100/svm_losses.py ran fingerprinted MIT (permissive) · 5fa7bb56e6e22a54 · report fixture: signature X:Tensor/2/float, Y:Tensor/2/float, gamma:float/0/float · returned Tensor · level recorded 2026-09-24
get_lr in 91 papers CIFAR100/linear.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · 7337f1f5ff01dcd0 · report fixture: signature optimizer:SGD/0/? · returned float · level recorded, date not recorded
only_value_error myexman/index.py ran MIT (permissive) · c404ad6b3c3cae86 · report fixture: signature conv:callable/0/? · returned function · level recorded 2026-09-24
get_args in 84 papers myexman/index.py unverified MIT (permissive) · 5bd550cf0a598b22 · report
get_dataset in 285 papers CIFAR100/utils.py unverified MIT (permissive) · 0b30248ddcadc9b7 · report
none2none myexman/index.py unverified MIT (permissive) · 459939c749c8fd3f · report
pgd_simple_short models/solvers.py unverified MIT (permissive) · 54bdbe97f492c455 · report
pgd_with_nesterov models/solvers.py unverified MIT (permissive) · 5a39dd9aa51e8d32 · report
pgd_with_nesterov CIFAR100/solvers.py unverified MIT (permissive) · 91f52fbcbca3f103 · report
train_val in 10 papers CIFAR100/linear.py unverified MIT (permissive) here; the stored copy is pointer only · 8f49bc51cbbd9f64 · report

Tasks

Contrastive LearningRepresentation LearningSelf-Supervised Image Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Self-Supervised Image Classification ImageNet MMCL (100 epoch, 256 batch size) Top 1 Accuracy 63.8% #116 of 144 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

Contrastive LearningSVM

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