Papers › Semi-Supervised Semantic Segmentation via Adaptive Equalization Learning

Semi-Supervised Semantic Segmentation via Adaptive Equalization Learning

11 Oct 2021NeurIPS 2021 12arXiv:2110.05474archive 2025-07-28

Hanzhe Hu, Fangyun Wei, Han Hu, Qiwei Ye, Jinshi Cui, LiWei Wang

Due to the limited and even imbalanced data, semi-supervised semantic segmentation tends to have poor performance on some certain categories, e.g., tailed categories in Cityscapes dataset which exhibits a long-tailed label distribution. Existing approaches almost all neglect this problem, and treat categories equally. Some popular approaches such as consistency regularization or pseudo-labeling may even harm the learning of under-performing categories, that the predictions or pseudo labels of these categories could be too inaccurate to guide the learning on the unlabeled data. In this paper, we look into this problem, and propose a novel framework for semi-supervised semantic segmentation, named adaptive equalization learning (AEL). AEL adaptively balances the training of well and badly performed categories, with a confidence bank to dynamically track category-wise performance during training. The confidence bank is leveraged as an indicator to tilt training towards under-performing categories, instantiated in three strategies: 1) adaptive Copy-Paste and CutMix data augmentation approaches which give more chance for under-performing categories to be copied or cut; 2) an adaptive data sampling approach to encourage pixels from under-performing category to be sampled; 3) a simple yet effective re-weighting method to alleviate the training noise raised by pseudo-labeling. Experimentally, AEL outperforms the state-of-the-art methods by a large margin on the Cityscapes and Pascal VOC benchmarks under various data partition protocols. Code is available at https://github.com/hzhupku/SemiSeg-AEL

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 1 code sample harvested from 1 repository linked to this paper: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 1 sample from 1 repository, 1 ran (1 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

hzhupku/semiseg-ael officialmentioned in papermentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified 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

1 sample harvested: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran

Licence: 0 of the 1 sample 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 hzhupku/semiseg-ael. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

hzhupku/semiseg-ael official repository 1 sample, 1 ran (0 instrument-failed) · 0 unverified
Criterion_cons semseg/utils/loss_helper.py ran MIT (permissive) · df89ce7c7fa936b9 · report fixture: signature preds:Tensor/4/float, conf:Tensor/3/float, gt:Tensor/3/int, dcp_criterion:NoneType/0/? · returned Tensor · level recorded 2026-09-24

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Adaptive Equalization Learning (AEL) (graph method: Adaptive Equalization Learning (AEL)). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

  1. Criterion_cons entry · level 1 · ran · df89ce7c7fa936b9

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2110.05474") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Data AugmentationSemantic SegmentationSemi-Supervised Semantic Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Semi-Supervised Semantic Segmentation ADE20K 1/16 labeled AEL Validation mIoU 33.2 #3 of 5 Archive leaderboard report
Semi-Supervised Semantic Segmentation ADE20K 1/32 labeled AEL Validation mIoU 28.4 #3 of 5 Archive leaderboard report
Semi-Supervised Semantic Segmentation Cityscapes 12.5% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 77.9% #8 of 33 Archive leaderboard report
Semi-Supervised Semantic Segmentation Cityscapes 25% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 79.01% #10 of 30 Archive leaderboard report
Semi-Supervised Semantic Segmentation Cityscapes 50% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 80.28% #6 of 23 Archive leaderboard report
Semi-Supervised Semantic Segmentation Cityscapes 6.25% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 75.83% #10 of 18 Archive leaderboard report
Semi-Supervised Semantic Segmentation Cityscapes 93 labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 74.28 #1 of 3 Archive leaderboard report
Semi-Supervised Semantic Segmentation PASCAL VOC 2012 25% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 78.06 #14 of 27 Archive leaderboard report
Semi-Supervised Semantic Segmentation PASCAL VOC 2012 331 labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 76.97 #1 of 1 Archive leaderboard report
Semi-Supervised Semantic Segmentation PASCAL VOC 2012 50% AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 80.29% #4 of 14 Archive leaderboard report
Semi-Supervised Semantic Segmentation Pascal VOC 2012 12.5% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 77.57% #14 of 38 Archive leaderboard report
Semi-Supervised Semantic Segmentation Pascal VOC 2012 6.25% labeled AEL (DeepLab v3+ with ResNet-101 pretraind on ImageNet-1K) Validation mIoU 77.2 #11 of 19 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.

Methods

Copy-PasteCutMix

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