Methods › General › Semi-Supervised Learning Methods › Gradual Self-Training
Gradual Self-Training
Introduced by Ananya Kumar et al. in Understanding Self-Training for Gradual Domain Adaptation
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Gradual self-training is a method for semi-supervised domain adaptation. The goal is to adapt an initial classifier trained on a source domain given only unlabeled data that shifts gradually in distribution towards a target domain.
This comes up for example in applications ranging from sensor networks and self-driving car perception modules to brain-machine interfaces, where machine learning systems must adapt to data distributions that evolve over time.
The gradual self-training algorithm begins with a classifier w₀ trained on labeled examples from the source domain (Figure a). For each successive domain Pₜ, the algorithm generates pseudolabels for unlabeled examples from that domain, and then trains a regularized supervised classifier on the pseudolabeled examples. The intuition, visualized in the Figure, is that after a single gradual shift, most examples are pseudolabeled correctly so self-training learns a good classifier on the shifted data, but the shift from the source to the target can be too large for self-training to correct.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Self-MAP; Self-MVA; Self-PRM; SELF-ICL; Self-MOA; Self-Aug; Self-Talk; Self-CTRL.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 8 · with a code link: 8 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (4 of 8 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 8 of 8, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Gradual Domain Adaptation: Theory and Algorithms 20 Oct 2023 · 2 repositories · arXiv:2310.13852Syntology official (archive's flag): 10 ran · 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 15 harvested samples)
-
Adversarial Self-Training Improves Robustness and Generalization for Gradual Domain Adaptation 21 Sep 2023 · 1 repository
-
Gradual Domain Adaptation via Normalizing Flows 23 Jun 2022 · 1 repository · arXiv:2206.11492Syntology official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 9 harvested samples)
-
Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyond 18 Apr 2022 · 3 repositories · arXiv:2204.08200Syntology community repositories only · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)
-
Improving Word Translation via Two-Stage Contrastive Learning 15 Mar 2022 · 1 repository · arXiv:2203.08307Syntology official (archive's flag): 2 ran · 5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 6 harvested samples) · 4 pointer-only (licence)
-
Improving Word Translation via Two-Stage Contrastive Learning 16 Nov 2021 · 1 repository
-
UmBERTo-MTSA @ AcCompl-It: Improving Complexity and Acceptability Prediction with Multi-task Learning on Self-Supervised Annotations 10 Nov 2020 · 1 repository · arXiv:2011.05197
-
Understanding Self-Training for Gradual Domain Adaptation 26 Feb 2020 · 2 repositories · arXiv:2002.11361
Tasks archive 2025-07-28
16 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
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