{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YZWUHZI6MICS55RJPR7BAIFFTA","short_pith_number":"pith:YZWUHZI6","schema_version":"1.0","canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","source":{"kind":"arxiv","id":"2411.14601","version":1},"attestation_state":"computed","paper":{"title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dmitry Kovalev, Ekaterina Borodich","submitted_at":"2024-11-21T22:06:25Z","abstract_excerpt":"We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\\min_x\\max_y f(x) + \\langle y,\\mathbf{B} x\\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine or strongly convex, there exist lower bounds on the number of gradient evaluations and matrix-vector multiplications required to solve the problem, as well as matching optimal algorithms. A notable aspect of these algorithms is that they are able to attain linear convergence, i.e., the number of iterations required to solve the problem is proportional to $\\l"},"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":"2411.14601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-21T22:06:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9530004620a03ee458256e6f71112e00557ece733b85387e6996e857141f479e","abstract_canon_sha256":"7b555d0ecf53143a5c58b1948dba8fea2790e65804e4bbc5f0196589f67f8f08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:53.660935Z","signature_b64":"41hPl68d0u6vtwXTjwb/3F2S8fiGtX2c2wQZQUSwgjPRe+YvhEmzgZd5gESEEu+bwYjgWJJuSrTE+k25SuicAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66d43e51e62052ef6297c7e1020a5980b7fb4c49a5af50ad89215a5d3943cc5","last_reissued_at":"2026-07-05T09:38:53.660486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:53.660486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dmitry Kovalev, Ekaterina Borodich","submitted_at":"2024-11-21T22:06:25Z","abstract_excerpt":"We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\\min_x\\max_y f(x) + \\langle y,\\mathbf{B} x\\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine or strongly convex, there exist lower bounds on the number of gradient evaluations and matrix-vector multiplications required to solve the problem, as well as matching optimal algorithms. A notable aspect of these algorithms is that they are able to attain linear convergence, i.e., the number of iterations required to solve the problem is proportional to $\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14601","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/2411.14601/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":"2411.14601","created_at":"2026-07-05T09:38:53.660542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14601v1","created_at":"2026-07-05T09:38:53.660542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14601","created_at":"2026-07-05T09:38:53.660542+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZWUHZI6MICS","created_at":"2026-07-05T09:38:53.660542+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZWUHZI6MICS55RJ","created_at":"2026-07-05T09:38:53.660542+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZWUHZI6","created_at":"2026-07-05T09:38:53.660542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22644","citing_title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02505","citing_title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA","json":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA.json","graph_json":"https://pith.science/api/pith-number/YZWUHZI6MICS55RJPR7BAIFFTA/graph.json","events_json":"https://pith.science/api/pith-number/YZWUHZI6MICS55RJPR7BAIFFTA/events.json","paper":"https://pith.science/paper/YZWUHZI6"},"agent_actions":{"view_html":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA","download_json":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA.json","view_paper":"https://pith.science/paper/YZWUHZI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14601&json=true","fetch_graph":"https://pith.science/api/pith-number/YZWUHZI6MICS55RJPR7BAIFFTA/graph.json","fetch_events":"https://pith.science/api/pith-number/YZWUHZI6MICS55RJPR7BAIFFTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/action/storage_attestation","attest_author":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/action/author_attestation","sign_citation":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/action/citation_signature","submit_replication":"https://pith.science/pith/YZWUHZI6MICS55RJPR7BAIFFTA/action/replication_record"}},"created_at":"2026-07-05T09:38:53.660542+00:00","updated_at":"2026-07-05T09:38:53.660542+00:00"}