{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/gradual-self-training","slug":"gradual-self-training","name":"Gradual Self-Training","full_name":"Gradual Self-Training","full_name_withheld":false,"description_markdown":"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. \r\n\r\nThis 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.\r\n\r\nThe gradual self-training algorithm begins with a classifier $w_0$ trained on labeled examples from the source domain (Figure a). For each successive domain $P_t$, 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.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Understanding Self-Training for Gradual Domain Adaptation","paper":"/paper/understanding-self-training-for-gradual","first_author":"Ananya Kumar","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/understanding-self-training-for-gradual"},"source":{"url":"https://arxiv.org/abs/2002.11361v1","title":"Understanding Self-Training for Gradual Domain Adaptation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Semi-Supervised Learning Methods","url":"/methods/category/semi-supervised-learning-methods","pwc_aliases":[]}],"n_papers_tagged":8,"archive_num_papers":8,"papers_newest_first":[{"paper":"/paper/gradual-domain-adaptation-theory-and","slug":"gradual-domain-adaptation-theory-and","title":"Gradual Domain Adaptation: Theory and Algorithms","date":"2023-10-20","arxiv_id":"2310.13852","n_code_links":2,"syntology":{"ran":10,"of":15,"n_ran_checked":9,"n_instrument":1,"unverified":5,"pointer_only":0,"phrase":"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","official":{"repos":["uiuctml/goat","yifei-he/goat"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/adversarial-self-training-improves-robustness","slug":"adversarial-self-training-improves-robustness","title":"Adversarial Self-Training Improves Robustness and Generalization for Gradual Domain Adaptation","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/gradual-domain-adaptation-via-normalizing","slug":"gradual-domain-adaptation-via-normalizing","title":"Gradual Domain Adaptation via Normalizing Flows","date":"2022-06-23","arxiv_id":"2206.11492","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"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","official":{"repos":["ismhinolab/gda_via_cnf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/understanding-gradual-domain-adaptation","slug":"understanding-gradual-domain-adaptation","title":"Understanding Gradual Domain Adaptation: Improved Analysis, Optimal Path and Beyond","date":"2022-04-18","arxiv_id":"2204.08200","n_code_links":3,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"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","official":{"repos":["Haoxiang-Wang/gradual-domain-adaptation"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/improving-word-translation-via-two-stage-1","slug":"improving-word-translation-via-two-stage-1","title":"Improving Word Translation via Two-Stage Contrastive Learning","date":"2022-03-15","arxiv_id":"2203.08307","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":2,"n_instrument":3,"unverified":1,"pointer_only":4,"phrase":"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","official":{"repos":["cambridgeltl/contrastivebli"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/improving-word-translation-via-two-stage","slug":"improving-word-translation-via-two-stage","title":"Improving Word Translation via Two-Stage Contrastive Learning","date":"2021-11-16","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/umberto-mtsa-accompl-it-improving-complexity","slug":"umberto-mtsa-accompl-it-improving-complexity","title":"UmBERTo-MTSA @ AcCompl-It: Improving Complexity and Acceptability Prediction with Multi-task Learning on Self-Supervised Annotations","date":"2020-11-10","arxiv_id":"2011.05197","n_code_links":1,"syntology":null},{"paper":"/paper/understanding-self-training-for-gradual","slug":"understanding-self-training-for-gradual","title":"Understanding Self-Training for Gradual Domain Adaptation","date":"2020-02-26","arxiv_id":"2002.11361","n_code_links":2,"syntology":null}],"papers_shown":8,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":8,"with_a_code_link":8,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":8,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/gradual-self-training/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/gradual-self-training/papers/ran/1","json":"/method/gradual-self-training/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":4},{"task":"/task/unsupervised-domain-adaptation","name":"Unsupervised Domain Adaptation","papers":4},{"task":"/task/bilingual-lexicon-induction","name":"Bilingual Lexicon Induction","papers":2},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":2},{"task":"/task/cross-lingual-word-embeddings","name":"Cross-Lingual Word Embeddings","papers":2},{"task":"/task/machine-translation","name":"Machine Translation","papers":2},{"task":"/task/multilingual-nlp","name":"Multilingual NLP","papers":2},{"task":"/task/multilingual-word-embeddings","name":"Multilingual Word Embeddings","papers":2},{"task":"/task/pretrained-multilingual-language-models","name":"Pretrained Multilingual Language Models","papers":2},{"task":"/task/self-learning","name":"Self-Learning","papers":2},{"task":"/task/word-alignment","name":"Word Alignment","papers":2},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":2},{"task":"/task/word-translation","name":"Word Translation","papers":2},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":1},{"task":"/task/two","name":"Vocal Bursts Valence Prediction","papers":1}],"tasks_shown":16,"n_tasks":16,"usage_by_year":[{"year":"2020","papers":2},{"year":"2021","papers":1},{"year":"2022","papers":3},{"year":"2023","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/gradual-self-training"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Gradual%20Self-Training","read_at":"2026-10-05T00:57:13+00:00","query":"Gradual Self-Training","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2002.11361","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Gradual Self-Training' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Self-MAP","Self-MVA","Self-PRM","SELF-ICL","Self-MOA","Self-Aug","Self-Talk","Self-CTRL"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a8a5ac146f65f2976ac7e9741698e18080009b198b1d7945701aa568c58e2ad6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}