Papers › Benchmarking Representation Learning for Natural World Image Collections

Benchmarking Representation Learning for Natural World Image Collections

30 Mar 2021CVPR 2021 1arXiv:2103.16483archive 2025-07-28

Grant van Horn, Elijah Cole, Sara Beery, Kimberly Wilber, Serge Belongie, Oisin Mac Aodha

Recent progress in self-supervised learning has resulted in models that are capable of extracting rich representations from image collections without requiring any explicit label supervision. However, to date the vast majority of these approaches have restricted themselves to training on standard benchmark datasets such as ImageNet. We argue that fine-grained visual categorization problems, such as plant and animal species classification, provide an informative testbed for self-supervised learning. In order to facilitate progress in this area we present two new natural world visual classification datasets, iNat2021 and NeWT. The former consists of 2.7M images from 10k different species uploaded by users of the citizen science application iNaturalist. We designed the latter, NeWT, in collaboration with domain experts with the aim of benchmarking the performance of representation learning algorithms on a suite of challenging natural world binary classification tasks that go beyond standard species classification. These two new datasets allow us to explore questions related to large-scale representation and transfer learning in the context of fine-grained categories. We provide a comprehensive analysis of feature extractors trained with and without supervision on ImageNet and iNat2021, shedding light on the strengths and weaknesses of different learned features across a diverse set of tasks. We find that features produced by standard supervised methods still outperform those produced by self-supervised approaches such as SimCLR. However, improved self-supervised learning methods are constantly being released and the iNat2021 and NeWT datasets are a valuable resource for tracking their progress.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2103.16483")

Code

Syntology Ran 0 of 12 code samples harvested from 1 repository linked to this paper; 12 have no recorded run.

By repository: official repository: 12 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

visipedia/newt officialmentioned in papermentioned on GitHubpytorchMIT 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; 0 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

12unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from visipedia/newt. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

conv_block visipedia/newt/benchmark/tf_resnet.py official repository unverified MIT (permissive) · cbe50e0989ae1e3f · report
evalute_features visipedia/newt/benchmark/evaluate_linear_models.py official repository unverified MIT (permissive) · 47c40e00f535da70 · report
fixed_padding visipedia/newt/benchmark/tf_resnet.py official repository unverified MIT (permissive) · 43006b1579cc0b34 · report
identity_block visipedia/newt/benchmark/tf_resnet.py official repository unverified MIT (permissive) · 2c7bf74214627a61 · report
linearsvc visipedia/newt/benchmark/linear_evaluation.py official repository unverified MIT (permissive) · d9c3f2f2c048d6a2 · report
load_cub visipedia/newt/benchmark/dataset_utils.py official repository unverified MIT (permissive) · 26d13a1ab4665887 · report
load_feature_extractor visipedia/newt/benchmark/pt_resnet_feature_extractor.py official repository unverified MIT (permissive) · a4f41438107ab2a7 · report
load_newt_task visipedia/newt/benchmark/dataset_utils.py official repository unverified MIT (permissive) · 11489c1ebee3c555 · report
load_oxford_flowers visipedia/newt/benchmark/dataset_utils.py official repository unverified MIT (permissive) · bfe9138310b695d3 · report
loader visipedia/newt/benchmark/pt_resnet_feature_extractor.py official repository unverified MIT (permissive) · 65dab949aa3e1b87 · report
logreg visipedia/newt/benchmark/linear_evaluation.py official repository unverified MIT (permissive) · 7bde24b55ef593b2 · report
sgd visipedia/newt/benchmark/linear_evaluation.py official repository unverified MIT (permissive) · cb90fce2472de4f8 · report

Tasks

BenchmarkingBinary ClassificationClassificationFine-Grained Visual CategorizationGeneral ClassificationRepresentation LearningSelf-Supervised LearningTransfer Learning

Datasets

Introduced by this paper, per the archive.

iNat2021

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationBottleneck Residual BlockColorJitterConvolutionDense ConnectionsFeedforward NetworkGlobal Average PoolingKaiming InitializationMax PoolingNT-XentRandom Gaussian BlurRandom Resized CropReLUResidual BlockResidual ConnectionSimCLR

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