{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QX7EOH7P43AZG6SXTUCO4WO3IH","short_pith_number":"pith:QX7EOH7P","schema_version":"1.0","canonical_sha256":"85fe471fefe6c1937a579d04ee59db41d003e310627d78407dcde442517ae5e1","source":{"kind":"arxiv","id":"2206.05248","version":6},"attestation_state":"computed","paper":{"title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Argyris Oikonomou, Weiqiang Zheng, Yang Cai","submitted_at":"2022-06-10T17:44:06Z","abstract_excerpt":"We study constrained comonotone min-max optimization, a structured class of nonconvex-nonconcave min-max optimization problems, and their generalization to comonotone inclusion. In our first contribution, we extend the Extra Anchored Gradient (EAG) algorithm, originally proposed by Yoon and Ryu (2021) for unconstrained min-max optimization, to constrained comonotone min-max optimization and comonotone inclusion, achieving an optimal convergence rate of $O\\left(\\frac{1}{T}\\right)$ among all first-order methods. Additionally, we prove that the algorithm's iterations converge to a point in the so"},"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.05248","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-06-10T17:44:06Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"214bccb58fecab4a6a34a374e8fe584504e197ce177a4a6b49280147c1afdf15","abstract_canon_sha256":"789d367b3f07ef7a781137206c1be1321dacab6e5cc39835195a8fd83d0088d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:31.977470Z","signature_b64":"ya67ln52yCCORPaba4pjZfC0d70pGgNY7AnwOCCzcJRL+5wnojZdUBDflJo6fZ4cQlX+368AS3JmDdUDkB4xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85fe471fefe6c1937a579d04ee59db41d003e310627d78407dcde442517ae5e1","last_reissued_at":"2026-07-05T09:44:31.977023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:31.977023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Argyris Oikonomou, Weiqiang Zheng, Yang Cai","submitted_at":"2022-06-10T17:44:06Z","abstract_excerpt":"We study constrained comonotone min-max optimization, a structured class of nonconvex-nonconcave min-max optimization problems, and their generalization to comonotone inclusion. In our first contribution, we extend the Extra Anchored Gradient (EAG) algorithm, originally proposed by Yoon and Ryu (2021) for unconstrained min-max optimization, to constrained comonotone min-max optimization and comonotone inclusion, achieving an optimal convergence rate of $O\\left(\\frac{1}{T}\\right)$ among all first-order methods. Additionally, we prove that the algorithm's iterations converge to a point in the so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05248","kind":"arxiv","version":6},"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.05248/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.05248","created_at":"2026-07-05T09:44:31.977083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.05248v6","created_at":"2026-07-05T09:44:31.977083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05248","created_at":"2026-07-05T09:44:31.977083+00:00"},{"alias_kind":"pith_short_12","alias_value":"QX7EOH7P43AZ","created_at":"2026-07-05T09:44:31.977083+00:00"},{"alias_kind":"pith_short_16","alias_value":"QX7EOH7P43AZG6SX","created_at":"2026-07-05T09:44:31.977083+00:00"},{"alias_kind":"pith_short_8","alias_value":"QX7EOH7P","created_at":"2026-07-05T09:44:31.977083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.07529","citing_title":"Training Deep Learning Models with Norm-Constrained LMOs","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09363","citing_title":"Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions","ref_index":157,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH","json":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH.json","graph_json":"https://pith.science/api/pith-number/QX7EOH7P43AZG6SXTUCO4WO3IH/graph.json","events_json":"https://pith.science/api/pith-number/QX7EOH7P43AZG6SXTUCO4WO3IH/events.json","paper":"https://pith.science/paper/QX7EOH7P"},"agent_actions":{"view_html":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH","download_json":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH.json","view_paper":"https://pith.science/paper/QX7EOH7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.05248&json=true","fetch_graph":"https://pith.science/api/pith-number/QX7EOH7P43AZG6SXTUCO4WO3IH/graph.json","fetch_events":"https://pith.science/api/pith-number/QX7EOH7P43AZG6SXTUCO4WO3IH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH/action/storage_attestation","attest_author":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH/action/author_attestation","sign_citation":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH/action/citation_signature","submit_replication":"https://pith.science/pith/QX7EOH7P43AZG6SXTUCO4WO3IH/action/replication_record"}},"created_at":"2026-07-05T09:44:31.977083+00:00","updated_at":"2026-07-05T09:44:31.977083+00:00"}