SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1906.00189 · 2019

Are Anchor Points Really Indispensable in Label-Noise Learning?

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-22; 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/1906.00189.json · badge: /api/ran/1906.00189.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.

RepositoryRoleRan
xiaoboxia/T-Revision canonical (classifier label)
classifier basis: classifier_2025
3 ran · 0 no recorded run
FunctionStatusWhere it lives
check_integrity Ran
ran, violated the contract we drafted
xiaoboxia/T-Revision/utils.py
pointer only (licence: NONE) · get_code("fac9904f665a5702")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xiaoboxia/T-Revision when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

list_dir Ran
ran; our contract draft was wrong, not the code
xiaoboxia/T-Revision/utils.py
pointer only (licence: NONE) · get_code("915e1c6c38494be9")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xiaoboxia/T-Revision when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

list_files Ran
ran; our contract draft was wrong, not the code
xiaoboxia/T-Revision/utils.py
pointer only (licence: NONE) · get_code("208e196e9582a9a6")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xiaoboxia/T-Revision when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 0 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.

FunctionAlso present inEarliest-datedOthers named
list_dir 19 other papers
2 dated earlier, 17 later
1803.02999 (2018-03)
On First-Order Meta-Learning Algorithms
1903.12648 (2019-03)
Overcoming Catastrophic Forgetting with Unlabeled Data in the Wild
2206.02262 (2022-06)
Diffusion-GAN: Training GANs with Diffusion
and 16 more not named here
list_files 16 other papers
2 dated earlier, 14 later
1803.02999 (2018-03)
On First-Order Meta-Learning Algorithms
1903.12648 (2019-03)
Overcoming Catastrophic Forgetting with Unlabeled Data in the Wild
2206.02262 (2022-06)
Diffusion-GAN: Training GANs with Diffusion
and 13 more not named here
check_integrity 5 other papers
2 dated earlier, 3 later
1902.01950 (2019-02)
Meta-Amortized Variational Inference and Learning
1903.12648 (2019-03)
Overcoming Catastrophic Forgetting with Unlabeled Data in the Wild
2106.10891 (2021-06)
Open-set Label Noise Can Improve Robustness Against Inherent Label Noise
and 2 more not named here

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

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

In label-noise learning, \textit{noise transition matrix}, denoting the probabilities that clean labels flip into noisy labels, plays a central role in building \textit{statistically consistent classifiers}. Existing theories have shown that the transition matrix can be learned by exploiting \textit{anchor points} (i.e., data points that belong to a specific class almost surely). However, when there are no anchor points, the transition matrix will be poorly learned, and those current consistent classifiers will significantly degenerate. In this paper, without employing anchor points, we propose a \textit{transition-revision} ($T$-Revision) method to effectively learn transition matrices, leading to better classifiers. Specifically, to learn a transition matrix, we first initialize it by exploiting data points that are similar to anchor points, having high \textit{noisy class posterior probabilities}. Then, we modify the initialized matrix by adding a \textit{slack variable}, which can be learned and validated together with the classifier by using noisy data. Empirical results on benchmark-simulated and real-world label-noise datasets demonstrate that without using exact anchor points, the proposed method is superior to the state-of-the-art label-noise learning methods.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1906.00189")
get_code_for_paper("1906.00189")
have("1906.00189")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1906.00189.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1906.00189.svg)](https://syntology.ai/paper/1906.00189)

Connect an agent — have() is free.