{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MBDMKYGIDHBFLRA22HIIRD26VV","short_pith_number":"pith:MBDMKYGI","schema_version":"1.0","canonical_sha256":"6046c560c819c255c41ad1d0888f5ead7e77c3d7adb26aab5d20ae8006e46957","source":{"kind":"arxiv","id":"2002.11361","version":1},"attestation_state":"computed","paper":{"title":"Understanding Self-Training for Gradual Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananya Kumar, Percy Liang, Tengyu Ma","submitted_at":"2020-02-26T08:59:40Z","abstract_excerpt":"Machine learning systems must adapt to data distributions that evolve over time, in applications ranging from sensor networks and self-driving car perception modules to brain-machine interfaces. We consider gradual domain adaptation, where 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. We prove the first non-vacuous upper bound on the error of self-training with gradual shifts, under settings where directly adapting to the target domain can result in unbounded error. The theoretical "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2002.11361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-26T08:59:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3ba8e0ac18f7e5a5cbd21095ff1b43d520845bc75de6bd87c2bfd1fe457db7d6","abstract_canon_sha256":"c919c4c4d231f2b0758c42281576849d1bab6d61f838c972a42506c2d6b2df05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:01.446310Z","signature_b64":"O4gyehDGxVysdXidxWQLaPp93PormLFV6FEE6+rZ85q1AnNhMIDpKeoqaRGxCMQ+7eifzBGXoYYrhXX7xyGCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6046c560c819c255c41ad1d0888f5ead7e77c3d7adb26aab5d20ae8006e46957","last_reissued_at":"2026-07-05T00:44:01.445794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:01.445794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Self-Training for Gradual Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananya Kumar, Percy Liang, Tengyu Ma","submitted_at":"2020-02-26T08:59:40Z","abstract_excerpt":"Machine learning systems must adapt to data distributions that evolve over time, in applications ranging from sensor networks and self-driving car perception modules to brain-machine interfaces. We consider gradual domain adaptation, where 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. We prove the first non-vacuous upper bound on the error of self-training with gradual shifts, under settings where directly adapting to the target domain can result in unbounded error. The theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11361","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.11361/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2002.11361","created_at":"2026-07-05T00:44:01.445852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.11361v1","created_at":"2026-07-05T00:44:01.445852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11361","created_at":"2026-07-05T00:44:01.445852+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBDMKYGIDHBF","created_at":"2026-07-05T00:44:01.445852+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBDMKYGIDHBFLRA2","created_at":"2026-07-05T00:44:01.445852+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBDMKYGI","created_at":"2026-07-05T00:44:01.445852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15556","citing_title":"Commute Your Domains: Trajectory Optimality Criterion for Multi-Domain Learning","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV","json":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV.json","graph_json":"https://pith.science/api/pith-number/MBDMKYGIDHBFLRA22HIIRD26VV/graph.json","events_json":"https://pith.science/api/pith-number/MBDMKYGIDHBFLRA22HIIRD26VV/events.json","paper":"https://pith.science/paper/MBDMKYGI"},"agent_actions":{"view_html":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV","download_json":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV.json","view_paper":"https://pith.science/paper/MBDMKYGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.11361&json=true","fetch_graph":"https://pith.science/api/pith-number/MBDMKYGIDHBFLRA22HIIRD26VV/graph.json","fetch_events":"https://pith.science/api/pith-number/MBDMKYGIDHBFLRA22HIIRD26VV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV/action/storage_attestation","attest_author":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV/action/author_attestation","sign_citation":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV/action/citation_signature","submit_replication":"https://pith.science/pith/MBDMKYGIDHBFLRA22HIIRD26VV/action/replication_record"}},"created_at":"2026-07-05T00:44:01.445852+00:00","updated_at":"2026-07-05T00:44:01.445852+00:00"}