{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NHXA7RSUUT23J53PZHBUYEMFYN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9b0ae75759a475aeb14261d7ef7c42003b079804d2094d02b9587e5d58b822fc","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T19:11:19Z","title_canon_sha256":"0b3ac8a6c6d0dc0183a5f3f385c0e1ce87ae4fbc64e6c68dde163e23a54e0b43"},"schema_version":"1.0","source":{"id":"2210.05740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.05740","created_at":"2026-07-05T06:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.05740v2","created_at":"2026-07-05T06:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05740","created_at":"2026-07-05T06:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"NHXA7RSUUT23","created_at":"2026-07-05T06:41:45Z"},{"alias_kind":"pith_short_16","alias_value":"NHXA7RSUUT23J53P","created_at":"2026-07-05T06:41:45Z"},{"alias_kind":"pith_short_8","alias_value":"NHXA7RSU","created_at":"2026-07-05T06:41:45Z"}],"graph_snapshots":[{"event_id":"sha256:d544477f723b326cb3919717b016d699edfd52dc932ed97e74fd152d5052f2bf","target":"graph","created_at":"2026-07-05T06:41:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.05740/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributionally Robust Optimization (DRO), as a popular method to train robust models against distribution shift between training and test sets, has received tremendous attention in recent years. In this paper, we propose and analyze stochastic algorithms that apply to both non-convex and convex losses for solving Kullback Leibler divergence constrained DRO problem. Compared with existing methods solving this problem, our stochastic algorithms not only enjoy competitive if not better complexity independent of sample size but also just require a constant batch size at every iteration, which is","authors_text":"Er Wei Bai, Jiameng Lyu, Kung sik Chan, Qi Qi, Tianbao Yang","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T19:11:19Z","title":"Stochastic Constrained DRO with a Complexity Independent of Sample Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05740","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0584f7733007cf4a5a97531f1a60ea31e976ab898a4a425e5de11fede5d2384a","target":"record","created_at":"2026-07-05T06:41:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9b0ae75759a475aeb14261d7ef7c42003b079804d2094d02b9587e5d58b822fc","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-11T19:11:19Z","title_canon_sha256":"0b3ac8a6c6d0dc0183a5f3f385c0e1ce87ae4fbc64e6c68dde163e23a54e0b43"},"schema_version":"1.0","source":{"id":"2210.05740","kind":"arxiv","version":2}},"canonical_sha256":"69ee0fc654a4f5b4f76fc9c34c1185c348c2cb02b0e56d2ebdec5a2fe8ea9024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ee0fc654a4f5b4f76fc9c34c1185c348c2cb02b0e56d2ebdec5a2fe8ea9024","first_computed_at":"2026-07-05T06:41:45.461822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:45.461822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rhh0bUVXvfGjhTuX62Dp+7dwGJmgtoAWnrOBlJbGazfntVauJP4uQ4drN3+wJs+qnF85v01uQK9LV1ePtCm2Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:45.462334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.05740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0584f7733007cf4a5a97531f1a60ea31e976ab898a4a425e5de11fede5d2384a","sha256:d544477f723b326cb3919717b016d699edfd52dc932ed97e74fd152d5052f2bf"],"state_sha256":"035ba26910524a1765cca6b542242b1a6a4c483d9c554f006e666828ede3027f"}