{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:73U3TRUZQWUGDRVHDUPMXEI7T5","short_pith_number":"pith:73U3TRUZ","schema_version":"1.0","canonical_sha256":"fee9b9c69985a861c6a71d1ecb911f9f65c8a72d7697bf0b3986c489103eec20","source":{"kind":"arxiv","id":"2007.13982","version":2},"attestation_state":"computed","paper":{"title":"Distributionally Robust Losses for Latent Covariate Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongseok Namkoong, John Duchi, Tatsunori Hashimoto","submitted_at":"2020-07-28T04:16:27Z","abstract_excerpt":"While modern large-scale datasets often consist of heterogeneous subpopulations -- for example, multiple demographic groups or multiple text corpora -- the standard practice of minimizing average loss fails to guarantee uniformly low losses across all subpopulations. We propose a convex procedure that controls the worst-case performance over all subpopulations of a given size. Our procedure comes with finite-sample (nonparametric) convergence guarantees on the worst-off subpopulation. Empirically, we observe on lexical similarity, wine quality, and recidivism prediction tasks that our worst-ca"},"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":"2007.13982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-28T04:16:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b9c543d470fc032fcd409a7bb6507ad6c44145be15598f6773250ad1f937bc47","abstract_canon_sha256":"7efb11dc904224014685c16078e36cfadce868338c19eacf9f30d64bba9a9748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:37.966766Z","signature_b64":"Oxh/GpL7471qjf/5v6rCmUSGjlbQAR0+fnRgD8RtGiYvmtu+OV1KmoB8aY3nA19ZpCipa/02Rlev62VzwKIVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fee9b9c69985a861c6a71d1ecb911f9f65c8a72d7697bf0b3986c489103eec20","last_reissued_at":"2026-07-05T04:47:37.966387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:37.966387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Losses for Latent Covariate Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongseok Namkoong, John Duchi, Tatsunori Hashimoto","submitted_at":"2020-07-28T04:16:27Z","abstract_excerpt":"While modern large-scale datasets often consist of heterogeneous subpopulations -- for example, multiple demographic groups or multiple text corpora -- the standard practice of minimizing average loss fails to guarantee uniformly low losses across all subpopulations. We propose a convex procedure that controls the worst-case performance over all subpopulations of a given size. Our procedure comes with finite-sample (nonparametric) convergence guarantees on the worst-off subpopulation. Empirically, we observe on lexical similarity, wine quality, and recidivism prediction tasks that our worst-ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13982","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/2007.13982/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":"2007.13982","created_at":"2026-07-05T04:47:37.966443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.13982v2","created_at":"2026-07-05T04:47:37.966443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13982","created_at":"2026-07-05T04:47:37.966443+00:00"},{"alias_kind":"pith_short_12","alias_value":"73U3TRUZQWUG","created_at":"2026-07-05T04:47:37.966443+00:00"},{"alias_kind":"pith_short_16","alias_value":"73U3TRUZQWUGDRVH","created_at":"2026-07-05T04:47:37.966443+00:00"},{"alias_kind":"pith_short_8","alias_value":"73U3TRUZ","created_at":"2026-07-05T04:47:37.966443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12226","citing_title":"Learning Causality for Modern Machine Learning","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5","json":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5.json","graph_json":"https://pith.science/api/pith-number/73U3TRUZQWUGDRVHDUPMXEI7T5/graph.json","events_json":"https://pith.science/api/pith-number/73U3TRUZQWUGDRVHDUPMXEI7T5/events.json","paper":"https://pith.science/paper/73U3TRUZ"},"agent_actions":{"view_html":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5","download_json":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5.json","view_paper":"https://pith.science/paper/73U3TRUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.13982&json=true","fetch_graph":"https://pith.science/api/pith-number/73U3TRUZQWUGDRVHDUPMXEI7T5/graph.json","fetch_events":"https://pith.science/api/pith-number/73U3TRUZQWUGDRVHDUPMXEI7T5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5/action/storage_attestation","attest_author":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5/action/author_attestation","sign_citation":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5/action/citation_signature","submit_replication":"https://pith.science/pith/73U3TRUZQWUGDRVHDUPMXEI7T5/action/replication_record"}},"created_at":"2026-07-05T04:47:37.966443+00:00","updated_at":"2026-07-05T04:47:37.966443+00:00"}