{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZGW4ZFZ7KJFNAE3T3BTWBJJNGA","short_pith_number":"pith:ZGW4ZFZ7","schema_version":"1.0","canonical_sha256":"c9adcc973f524ad01373d86760a52d3018627c21ff2fe66d0805154bfd7ceabe","source":{"kind":"arxiv","id":"2401.14655","version":1},"attestation_state":"computed","paper":{"title":"Distributionally Robust Optimization and Robust Statistics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jiajin Li, Jose Blanchet, Sirui Lin, Xuhui Zhang","submitted_at":"2024-01-26T05:28:17Z","abstract_excerpt":"We review distributionally robust optimization (DRO), a principled approach for constructing statistical estimators that hedge against the impact of deviations in the expected loss between the training and deployment environments. Many well-known estimators in statistics and machine learning (e.g. AdaBoost, LASSO, ridge regression, dropout training, etc.) are distributionally robust in a precise sense. We hope that by discussing the DRO interpretation of well-known estimators, statisticians who may not be too familiar with DRO may find a way to access the DRO literature through the bridge betw"},"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.14655","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2024-01-26T05:28:17Z","cross_cats_sorted":[],"title_canon_sha256":"3cb2f427475abf8e0b0cf2a63d74d56e27500d83c9feb2c25de0118971750567","abstract_canon_sha256":"b5967d1eab4e87548ebe9d5d16fef33b21e120b7e391a2eed1fdf3cfb808e387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:59.695470Z","signature_b64":"wN4nV6Jh0EX6bqWFY1gUu7Ki+KQKT2g9eo5H+azS62vwJmcfGia/PrYP2haNGAsOQMXGxbk9+Rk0fWhARWr5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9adcc973f524ad01373d86760a52d3018627c21ff2fe66d0805154bfd7ceabe","last_reissued_at":"2026-07-05T07:37:59.694960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:59.694960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Optimization and Robust Statistics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jiajin Li, Jose Blanchet, Sirui Lin, Xuhui Zhang","submitted_at":"2024-01-26T05:28:17Z","abstract_excerpt":"We review distributionally robust optimization (DRO), a principled approach for constructing statistical estimators that hedge against the impact of deviations in the expected loss between the training and deployment environments. Many well-known estimators in statistics and machine learning (e.g. AdaBoost, LASSO, ridge regression, dropout training, etc.) are distributionally robust in a precise sense. We hope that by discussing the DRO interpretation of well-known estimators, statisticians who may not be too familiar with DRO may find a way to access the DRO literature through the bridge betw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14655","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/2401.14655/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.14655","created_at":"2026-07-05T07:37:59.695021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14655v1","created_at":"2026-07-05T07:37:59.695021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14655","created_at":"2026-07-05T07:37:59.695021+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGW4ZFZ7KJFN","created_at":"2026-07-05T07:37:59.695021+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGW4ZFZ7KJFNAE3T","created_at":"2026-07-05T07:37:59.695021+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGW4ZFZ7","created_at":"2026-07-05T07:37:59.695021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.01932","citing_title":"A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20115","citing_title":"On the Stability and Generalization of First-order Bilevel Minimax Optimization","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA","json":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA.json","graph_json":"https://pith.science/api/pith-number/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/graph.json","events_json":"https://pith.science/api/pith-number/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/events.json","paper":"https://pith.science/paper/ZGW4ZFZ7"},"agent_actions":{"view_html":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA","download_json":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA.json","view_paper":"https://pith.science/paper/ZGW4ZFZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14655&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/action/storage_attestation","attest_author":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/action/author_attestation","sign_citation":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/action/citation_signature","submit_replication":"https://pith.science/pith/ZGW4ZFZ7KJFNAE3T3BTWBJJNGA/action/replication_record"}},"created_at":"2026-07-05T07:37:59.695021+00:00","updated_at":"2026-07-05T07:37:59.695021+00:00"}