SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2102.05291 · ICML · 2021

Clusterability as an Alternative to Anchor Points When Learning with Noisy Labels

Yang Liu, Zhaowei Zhu, Yiwen Song

arXiv · PDF · Open in the Atlas

Code that ran

None of the 9 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (9 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/2102.05291.json · badge: /api/ran/2102.05291.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
ucsc-real/hoc canonical (classifier label)
classifier basis: classifier_2025
0 ran · 3 no recorded run
ZhaoweiZhu1995/HOC marked official in Papers with Code
Papers with Code archive
0 ran · 6 no recorded run
FunctionStatusWhere it lives
calc_func Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("f388201005d0b814")
How it ran

no invocation recorded.

count_y Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("b36ca77215508992")
How it ran

no invocation recorded.

func Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("5d07bccf4e30a813")
How it ran

no invocation recorded.

get_T_HOC Not yet run
unverified (harvested, no recorded run)
ucsc-real/hoc/hoc.py
code served (permissive licence) · get_code("3361a9152aa929d6")
How it ran

no invocation recorded.

get_T_HOC Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("1cd09c2c81c35331")
How it ran

no invocation recorded.

get_T_P_global Not yet run
unverified (harvested, no recorded run)
ucsc-real/hoc/hoc.py
code served (permissive licence) · get_code("30638d8a1dcd43ba")
How it ran

no invocation recorded.

get_T_P_global Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("b2f527000dba956c")
How it ran

no invocation recorded.

get_T_P_local Not yet run
unverified (harvested, no recorded run)
ucsc-real/hoc/hoc.py
code served (permissive licence) · get_code("40e317bbf3e2b611")
How it ran

no invocation recorded.

get_T_P_local Not yet run
unverified (harvested, no recorded run)
ZhaoweiZhu1995/HOC/hoc.py
code served (permissive licence) · get_code("a068af24b9f178c4")
How it ran

no invocation recorded.

Also present in other papers' code

Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 5 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 5 later) and 1 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
get_T_P_local
brick of this paper's assembly: helper
2 other papers
2 later
2110.06283 (2021-10)
Detecting Corrupted Labels Without Training a Model to Predict
2310.04668 (2023-10)
Label-free Node Classification on Graphs with Large Language Models (LLMS)
count_y
brick of this paper's assembly: helper
1 other paper
1 later · 1 only as an assembly brick
2110.06283 (2021-10)
Detecting Corrupted Labels Without Training a Model to Predict
func
brick of this paper's assembly: helper
1 other paper
1 later · 1 only as an assembly brick
2110.06283 (2021-10)
Detecting Corrupted Labels Without Training a Model to Predict
get_T_HOC
brick of this paper's assembly: entry
1 other paper
1 later
2310.04668 (2023-10)
Label-free Node Classification on Graphs with Large Language Models (LLMS)
get_T_P_global
brick of this paper's assembly: helper
1 other paper
1 later
2310.04668 (2023-10)
Label-free Node Classification on Graphs with Large Language Models (LLMS)

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

The label noise transition matrix, characterizing the probabilities of a training instance being wrongly annotated, is crucial to designing popular solutions to learning with noisy labels. Existing works heavily rely on finding "anchor points" or their approximates, defined as instances belonging to a particular class almost surely. Nonetheless, finding anchor points remains a non-trivial task, and the estimation accuracy is also often throttled by the number of available anchor points. In this paper, we propose an alternative option to the above task. Our main contribution is the discovery of an efficient estimation procedure based on a clusterability condition. We prove that with clusterable representations of features, using up to third-order consensuses of noisy labels among neighbor representations is sufficient to estimate a unique transition matrix. Compared with methods using anchor points, our approach uses substantially more instances and benefits from a much better sample complexity. We demonstrate the estimation accuracy and advantages of our estimates using both synthetic noisy labels (on CIFAR-10/100) and real human-level noisy labels (on Clothing1M and our self-collected humanannotated CIFAR-10). Our code and human-level noisy CIFAR-10 labels are available at https: //github.com/UCSC-REAL/HOC.

For agents

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

get_harvested_code_for_paper("2102.05291")
get_code_for_paper("2102.05291")
have("2102.05291")

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

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

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

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

Connect an agent — have() is free.