{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CAALD36E23BM2D5JNOET2ZZIRY","short_pith_number":"pith:CAALD36E","schema_version":"1.0","canonical_sha256":"1000b1efc4d6c2cd0fa96b893d67288e167f237d5ef0b1ad6cbd1e6e88e4082c","source":{"kind":"arxiv","id":"2401.14846","version":2},"attestation_state":"computed","paper":{"title":"Understanding Domain Generalization: A Noise Robustness Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Rui Qiao","submitted_at":"2024-01-26T13:27:15Z","abstract_excerpt":"Despite the rapid development of machine learning algorithms for domain generalization (DG), there is no clear empirical evidence that the existing DG algorithms outperform the classic empirical risk minimization (ERM) across standard benchmarks. To better understand this phenomenon, we investigate whether there are benefits of DG algorithms over ERM through the lens of label noise. Specifically, our finite-sample analysis reveals that label noise exacerbates the effect of spurious correlations for ERM, undermining generalization. Conversely, we illustrate that DG algorithms exhibit implicit l"},"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":"2401.14846","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-26T13:27:15Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"209b3628e3656477e139cc66cb3a1b3af648a9c93f29193fd22f297d0e4c311e","abstract_canon_sha256":"7830729b2fa75cadd6e0ad33852b706b12852e2f32563dbf04b372c9433c5945"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:58.960249Z","signature_b64":"Xb9lQyheSArw0g74Ivfjuoso3XDngKMPin61q3xc8RwxmyqVZQFZ8qLr/PIsLnwoyLH1HCs0WFqX0QZiPjGCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1000b1efc4d6c2cd0fa96b893d67288e167f237d5ef0b1ad6cbd1e6e88e4082c","last_reissued_at":"2026-07-05T07:56:58.959824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:58.959824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Domain Generalization: A Noise Robustness Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Rui Qiao","submitted_at":"2024-01-26T13:27:15Z","abstract_excerpt":"Despite the rapid development of machine learning algorithms for domain generalization (DG), there is no clear empirical evidence that the existing DG algorithms outperform the classic empirical risk minimization (ERM) across standard benchmarks. To better understand this phenomenon, we investigate whether there are benefits of DG algorithms over ERM through the lens of label noise. Specifically, our finite-sample analysis reveals that label noise exacerbates the effect of spurious correlations for ERM, undermining generalization. Conversely, we illustrate that DG algorithms exhibit implicit l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14846","kind":"arxiv","version":2},"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/2401.14846/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":"2401.14846","created_at":"2026-07-05T07:56:58.959880+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14846v2","created_at":"2026-07-05T07:56:58.959880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14846","created_at":"2026-07-05T07:56:58.959880+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAALD36E23BM","created_at":"2026-07-05T07:56:58.959880+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAALD36E23BM2D5J","created_at":"2026-07-05T07:56:58.959880+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAALD36E","created_at":"2026-07-05T07:56:58.959880+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.14375","citing_title":"Causal Fine-Tuning under Latent Confounded Shift","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY","json":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY.json","graph_json":"https://pith.science/api/pith-number/CAALD36E23BM2D5JNOET2ZZIRY/graph.json","events_json":"https://pith.science/api/pith-number/CAALD36E23BM2D5JNOET2ZZIRY/events.json","paper":"https://pith.science/paper/CAALD36E"},"agent_actions":{"view_html":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY","download_json":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY.json","view_paper":"https://pith.science/paper/CAALD36E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14846&json=true","fetch_graph":"https://pith.science/api/pith-number/CAALD36E23BM2D5JNOET2ZZIRY/graph.json","fetch_events":"https://pith.science/api/pith-number/CAALD36E23BM2D5JNOET2ZZIRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY/action/storage_attestation","attest_author":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY/action/author_attestation","sign_citation":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY/action/citation_signature","submit_replication":"https://pith.science/pith/CAALD36E23BM2D5JNOET2ZZIRY/action/replication_record"}},"created_at":"2026-07-05T07:56:58.959880+00:00","updated_at":"2026-07-05T07:56:58.959880+00:00"}