{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XO27GVMYFLI2ZEGDOLPGHOIMBL","short_pith_number":"pith:XO27GVMY","schema_version":"1.0","canonical_sha256":"bbb5f355982ad1ac90c372de63b90c0ae1a77721d629703175d6f8f96ceb5fe2","source":{"kind":"arxiv","id":"1605.06398","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Variance Reduction Methods for Saddle-Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA, LIENS), P Balamurugan (SIERRA","submitted_at":"2016-05-20T15:16:29Z","abstract_excerpt":"We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly convergent algorithms for this class of problems which is common in machine learning. While the algorithmic extension is straightforward, it comes with challenges and opportunities: (a) the convex minimization analysis does not apply and we use the notion of monotone operators to prove convergence, showing in particular that the same algorithm applies to a larger c"},"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":"1605.06398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-20T15:16:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5e96b68c0aaabfec7e663f3b29e00a0a245dcce24266fd384c4f984bd864f5fd","abstract_canon_sha256":"6628a7c987e4bf179d888b3a7c18d4984afa815563945c7f296d0974b90e07ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.355901Z","signature_b64":"SS0Q/HHUl7G+IcSCOhW7ov/TUK/VOf3VubqxwdclfmLzvnsSkvQYyiqvExiTl2Ln11iIwNxon2bVERR7B22UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbb5f355982ad1ac90c372de63b90c0ae1a77721d629703175d6f8f96ceb5fe2","last_reissued_at":"2026-05-18T01:00:19.355138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.355138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Variance Reduction Methods for Saddle-Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA, LIENS), P Balamurugan (SIERRA","submitted_at":"2016-05-20T15:16:29Z","abstract_excerpt":"We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly convergent algorithms for this class of problems which is common in machine learning. While the algorithmic extension is straightforward, it comes with challenges and opportunities: (a) the convex minimization analysis does not apply and we use the notion of monotone operators to prove convergence, showing in particular that the same algorithm applies to a larger c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06398","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":""},"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":"1605.06398","created_at":"2026-05-18T01:00:19.355262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06398v2","created_at":"2026-05-18T01:00:19.355262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06398","created_at":"2026-05-18T01:00:19.355262+00:00"},{"alias_kind":"pith_short_12","alias_value":"XO27GVMYFLI2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XO27GVMYFLI2ZEGD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XO27GVMY","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL","json":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL.json","graph_json":"https://pith.science/api/pith-number/XO27GVMYFLI2ZEGDOLPGHOIMBL/graph.json","events_json":"https://pith.science/api/pith-number/XO27GVMYFLI2ZEGDOLPGHOIMBL/events.json","paper":"https://pith.science/paper/XO27GVMY"},"agent_actions":{"view_html":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL","download_json":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL.json","view_paper":"https://pith.science/paper/XO27GVMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06398&json=true","fetch_graph":"https://pith.science/api/pith-number/XO27GVMYFLI2ZEGDOLPGHOIMBL/graph.json","fetch_events":"https://pith.science/api/pith-number/XO27GVMYFLI2ZEGDOLPGHOIMBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL/action/storage_attestation","attest_author":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL/action/author_attestation","sign_citation":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL/action/citation_signature","submit_replication":"https://pith.science/pith/XO27GVMYFLI2ZEGDOLPGHOIMBL/action/replication_record"}},"created_at":"2026-05-18T01:00:19.355262+00:00","updated_at":"2026-05-18T01:00:19.355262+00:00"}