Papers › Self-Supervised Aggregation of Diverse Experts for Test-Agnostic Long-Tailed Recognition

Self-Supervised Aggregation of Diverse Experts for Test-Agnostic Long-Tailed Recognition

20 Jul 2021arXiv:2107.09249archive 2025-07-28

Yifan Zhang, Bryan Hooi, Lanqing Hong, Jiashi Feng

Existing long-tailed recognition methods, aiming to train class-balanced models from long-tailed data, generally assume the models would be evaluated on the uniform test class distribution. However, practical test class distributions often violate this assumption (e.g., being either long-tailed or even inversely long-tailed), which may lead existing methods to fail in real applications. In this paper, we study a more practical yet challenging task, called test-agnostic long-tailed recognition, where the training class distribution is long-tailed while the test class distribution is agnostic and not necessarily uniform. In addition to the issue of class imbalance, this task poses another challenge: the class distribution shift between the training and test data is unknown. To tackle this task, we propose a novel approach, called Self-supervised Aggregation of Diverse Experts, which consists of two strategies: (i) a new skill-diverse expert learning strategy that trains multiple experts from a single and stationary long-tailed dataset to separately handle different class distributions; (ii) a novel test-time expert aggregation strategy that leverages self-supervision to aggregate the learned multiple experts for handling unknown test class distributions. We theoretically show that our self-supervised strategy has a provable ability to simulate test-agnostic class distributions. Promising empirical results demonstrate the effectiveness of our method on both vanilla and test-agnostic long-tailed recognition. Code is available at \url{https://github.com/Vanint/SADE-AgnosticLT}.

PaperPDFCodeCode 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="2107.09249")

Code

Syntology Ran 4 of 6 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 3 ran with no contract checked.

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

Vanint/TADE-AgnosticLT officialmentioned in papermentioned on GitHubpytorchMIT report
vanint/sade-agnosticlt 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

6 samples harvested; 4 ran; 0 honoured the contract we drafted; 2 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.

1ran · our draft was wrong
3ran
2unverified

Licence: 0 of the 6 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 Vanint/TADE-AgnosticLT. “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.

accuracy Vanint/TADE-AgnosticLT/model/metric.py official repository ran MIT (permissive) · 1c1fdcd838303a0d · report
focal_loss Vanint/TADE-AgnosticLT/model/loss.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 4dcf06ba28983266 · report
learing_rate_scheduler Vanint/TADE-AgnosticLT/train_places.py official repository ran MIT (permissive) · 23198d10b9f73030 · report
top_k_acc Vanint/TADE-AgnosticLT/model/metric.py official repository ran MIT (permissive) · c642158604bebe8a · report
init_weights Vanint/TADE-AgnosticLT/model/model.py official repository unverified MIT (permissive) · 0933d643f92c12aa · report
transform_convert Vanint/TADE-AgnosticLT/selection_from_cifar_pool_balance.py official repository unverified MIT (permissive) · bf3d5219dca41ccd · report

Tasks

Image ClassificationLong-tail LearningTest Agnostic Long-Tailed Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification iNaturalist 2018 TADE (ResNet-50) Top-1 Accuracy 72.9% #33 of 60 Archive leaderboard report
Long-tail Learning CIFAR-10-LT (ρ=10) TADE Error Rate 9.2 #15 of 50 Archive leaderboard report
Long-tail Learning CIFAR-10-LT (ρ=10) RIDE Error Rate 10.3 #23 of 50 Archive leaderboard report
Long-tail Learning CIFAR-10-LT (ρ=100) TADE Error Rate 16.2 #13 of 28 Archive leaderboard report
Long-tail Learning CIFAR-100-LT (ρ=10) TADE Error Rate 36.4 #16 of 31 Archive leaderboard report
Long-tail Learning CIFAR-100-LT (ρ=100) TADE Error Rate 50.2 #29 of 66 Archive leaderboard report
Long-tail Learning CIFAR-100-LT (ρ=50) TADE Error Rate 46.1 #18 of 25 Archive leaderboard report
Long-tail Learning ImageNet-LT TADE(ResNeXt101-32x4d) Top-1 Accuracy 61.4 #13 of 69 Archive leaderboard report
Long-tail Learning ImageNet-LT TADE(ResNeXt-50) Top-1 Accuracy 58.8 #18 of 69 Archive leaderboard report
Long-tail Learning Places-LT TADE Top 1 Accuracy 40.9 #15 of 29 Archive leaderboard report
Long-tail Learning Places-LT TADE Top-1 Accuracy 41.3 #15 of 29 Archive leaderboard report
Long-tail Learning iNaturalist 2018 TADE(ResNet-152) Top-1 Accuracy 77% #9 of 43 Archive leaderboard report
Long-tail Learning iNaturalist 2018 TADE Top-1 Accuracy 72.9% #24 of 43 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.

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