{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VGCB7EZSSU2SGURZPTG2OL4AIP","short_pith_number":"pith:VGCB7EZS","schema_version":"1.0","canonical_sha256":"a9841f933295352352397ccda72f8043d1410b948ea4f4be9bcd173822d88404","source":{"kind":"arxiv","id":"2206.04502","version":2},"attestation_state":"computed","paper":{"title":"What is a Good Metric to Study Generalization of Minimax Learners?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Asuman Ozdaglar, Jiawei Zhang, Kaiqing Zhang, Sarath Pattathil","submitted_at":"2022-06-09T13:39:06Z","abstract_excerpt":"Minimax optimization has served as the backbone of many machine learning (ML) problems. Although the convergence behavior of optimization algorithms has been extensively studied in the minimax settings, their generalization guarantees in stochastic minimax optimization problems, i.e., how the solution trained on empirical data performs on unseen testing data, have been relatively underexplored. A fundamental question remains elusive: What is a good metric to study generalization of minimax learners? In this paper, we aim to answer this question by first showing that primal risk, a universal me"},"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":"2206.04502","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-06-09T13:39:06Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"bab1a4f7b57cad0f58d6c799a4b90d583528281cdc68c2dc7e74af6279dfdcce","abstract_canon_sha256":"307fdc25dc38139723da7c2560f93438684c64525a069901b91df59fe05499b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:00.755394Z","signature_b64":"KY9OX0i1YMw+V2DlKZfOxBmin+2ChOhwAs/aPpwyTwwHpLuqmNnQ3m9YOsE0P37p/MEexsLpXPJuv+ci3HdAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9841f933295352352397ccda72f8043d1410b948ea4f4be9bcd173822d88404","last_reissued_at":"2026-07-05T04:33:00.754897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:00.754897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is a Good Metric to Study Generalization of Minimax Learners?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Asuman Ozdaglar, Jiawei Zhang, Kaiqing Zhang, Sarath Pattathil","submitted_at":"2022-06-09T13:39:06Z","abstract_excerpt":"Minimax optimization has served as the backbone of many machine learning (ML) problems. Although the convergence behavior of optimization algorithms has been extensively studied in the minimax settings, their generalization guarantees in stochastic minimax optimization problems, i.e., how the solution trained on empirical data performs on unseen testing data, have been relatively underexplored. A fundamental question remains elusive: What is a good metric to study generalization of minimax learners? In this paper, we aim to answer this question by first showing that primal risk, a universal me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04502","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/2206.04502/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":"2206.04502","created_at":"2026-07-05T04:33:00.754954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.04502v2","created_at":"2026-07-05T04:33:00.754954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04502","created_at":"2026-07-05T04:33:00.754954+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGCB7EZSSU2S","created_at":"2026-07-05T04:33:00.754954+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGCB7EZSSU2SGURZ","created_at":"2026-07-05T04:33:00.754954+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGCB7EZS","created_at":"2026-07-05T04:33:00.754954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01557","citing_title":"Everywhere Learning: Artificial Intelligence with Pointwise Constraints","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16875","citing_title":"Stochastic Optimization and Data Science","ref_index":116,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP","json":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP.json","graph_json":"https://pith.science/api/pith-number/VGCB7EZSSU2SGURZPTG2OL4AIP/graph.json","events_json":"https://pith.science/api/pith-number/VGCB7EZSSU2SGURZPTG2OL4AIP/events.json","paper":"https://pith.science/paper/VGCB7EZS"},"agent_actions":{"view_html":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP","download_json":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP.json","view_paper":"https://pith.science/paper/VGCB7EZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.04502&json=true","fetch_graph":"https://pith.science/api/pith-number/VGCB7EZSSU2SGURZPTG2OL4AIP/graph.json","fetch_events":"https://pith.science/api/pith-number/VGCB7EZSSU2SGURZPTG2OL4AIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP/action/storage_attestation","attest_author":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP/action/author_attestation","sign_citation":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP/action/citation_signature","submit_replication":"https://pith.science/pith/VGCB7EZSSU2SGURZPTG2OL4AIP/action/replication_record"}},"created_at":"2026-07-05T04:33:00.754954+00:00","updated_at":"2026-07-05T04:33:00.754954+00:00"}