{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:I53UEPPGLSDACEFSNP36USASWU","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":"d86540f8f2627f4204b388d99652ba9b0cea2ffdbf76f1ffc3a630965e521eb1","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-01-22T00:05:14Z","title_canon_sha256":"7d0852e4e952cd64e11fb70bbca496a5594ab6a26b5680366947a268aee6c212"},"schema_version":"1.0","source":{"id":"2001.07819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07819","created_at":"2026-07-05T04:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07819v2","created_at":"2026-07-05T04:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07819","created_at":"2026-07-05T04:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"I53UEPPGLSDA","created_at":"2026-07-05T04:11:22Z"},{"alias_kind":"pith_short_16","alias_value":"I53UEPPGLSDACEFS","created_at":"2026-07-05T04:11:22Z"},{"alias_kind":"pith_short_8","alias_value":"I53UEPPG","created_at":"2026-07-05T04:11:22Z"}],"graph_snapshots":[{"event_id":"sha256:684193e3630caabcb5a45077ad544dc7b3eec67c44543ea643647ffc3a7938e4","target":"graph","created_at":"2026-07-05T04:11:22Z","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/2001.07819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study zeroth-order algorithms for minimax optimization problems that are nonconvex in one variable and strongly-concave in the other variable. Such minimax optimization problems have attracted significant attention lately due to their applications in modern machine learning tasks. We first consider a deterministic version of the problem. We design and analyze the Zeroth-Order Gradient Descent Ascent (\\texttt{ZO-GDA}) algorithm, and provide improved results compared to existing works, in terms of oracle complexity. We also propose the Zeroth-Order Gradient Descent Multi-Step A","authors_text":"Krishnakumar Balasubramanian, Meisam Razaviyayn, Shiqian Ma, Zhongruo Wang","cross_cats":["cs.DS","cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-01-22T00:05:14Z","title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07819","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:4140b7648ae8e4849319f87b07db691b2d38c7a428e5e9c049e327b84aabfc6c","target":"record","created_at":"2026-07-05T04:11:22Z","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":"d86540f8f2627f4204b388d99652ba9b0cea2ffdbf76f1ffc3a630965e521eb1","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-01-22T00:05:14Z","title_canon_sha256":"7d0852e4e952cd64e11fb70bbca496a5594ab6a26b5680366947a268aee6c212"},"schema_version":"1.0","source":{"id":"2001.07819","kind":"arxiv","version":2}},"canonical_sha256":"4777423de65c860110b26bf7ea4812b51597d9925a62a1b4a713704599d04403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4777423de65c860110b26bf7ea4812b51597d9925a62a1b4a713704599d04403","first_computed_at":"2026-07-05T04:11:22.533923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:22.533923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R9R+XxliCXNck90zzQtAdOlMbUVh1kSmhX922NH955FzkV8zaEyC1fCXkO1S7yqeJ/c4tYny4OcEni4NcbQrAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:22.534480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.07819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4140b7648ae8e4849319f87b07db691b2d38c7a428e5e9c049e327b84aabfc6c","sha256:684193e3630caabcb5a45077ad544dc7b3eec67c44543ea643647ffc3a7938e4"],"state_sha256":"1b310e94b0d69c717c2d7baa6df42e232dd77e254f00a0dc4431241f53f2d56a"}