Stephan Mandt, Robert Bamler
None of the 4 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (4 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2002.06298.json · badge: /api/ran/2002.06298.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| mandt-lab/adversarial-negative-sampling | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| AbstractModel | Not yet run unverified (harvested, no recorded run) |
mandt-lab/adversarial-negative-sampling/main_model/supervised_nce_model.py code served (permissive licence) · get_code("7d1d233de7618263") How it ranno invocation recorded. |
| SupervisedNceModel | Not yet run unverified (harvested, no recorded run) |
mandt-lab/adversarial-negative-sampling/main_model/supervised_nce_model.py code served (permissive licence) · get_code("fc212b2ddb8029bb") How it ranno invocation recorded. |
| define_learning_rate | Not yet run unverified (harvested, no recorded run) |
mandt-lab/adversarial-negative-sampling/main_model/supervised_nce_model.py code served (permissive licence) · get_code("69632ce0003df38d") How it ranno invocation recorded. |
| define_optimizer | Not yet run unverified (harvested, no recorded run) |
mandt-lab/adversarial-negative-sampling/main_model/supervised_nce_model.py code served (permissive licence) · get_code("3fc563d96ab187e2") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| define_optimizer brick of this paper's assembly: helper |
1 other paper 1 dated earlier |
1907.01068 (2019-07) Augmenting and Tuning Knowledge Graph Embeddings |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Training a classifier over a large number of classes, known as 'extreme classification', has become a topic of major interest with applications in technology, science, and e-commerce. Traditional softmax regression induces a gradient cost proportional to the number of classes C, which often is prohibitively expensive. A popular scalable softmax approximation relies on uniform negative sampling, which suffers from slow convergence due a poor signal-to-noise ratio. In this paper, we propose a simple training method for drastically enhancing the gradient signal by drawing negative samples from an adversarial model that mimics the data distribution. Our contributions are three-fold: (i) an adversarial sampling mechanism that produces negative samples at a cost only logarithmic in C, thus still resulting in cheap gradient updates; (ii) a mathematical proof that this adversarial sampling minimizes the gradient variance while any bias due to non-uniform sampling can be removed; (iii) experimental results on large scale data sets that show a reduction of the training time by an order of magnitude relative to several competitive baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.06298")
get_code_for_paper("2002.06298")
have("2002.06298")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.06298.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.06298)
Connect an agent — have() is free.