{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AXRZ5GUB2V3EUZAUVU6DJ2XTMV","short_pith_number":"pith:AXRZ5GUB","schema_version":"1.0","canonical_sha256":"05e39e9a81d5764a6414ad3c34eaf36578727742fbfcff0a2d4f9130b1cab700","source":{"kind":"arxiv","id":"1901.08669","version":1},"attestation_state":"computed","paper":{"title":"SAGA with Arbitrary Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter Richt\\'arik, Xu Qian, Zheng Qu","submitted_at":"2019-01-24T22:37:42Z","abstract_excerpt":"We study the problem of minimizing the average of a very large number of smooth functions, which is of key importance in training supervised learning models. One of the most celebrated methods in this context is the SAGA algorithm. Despite years of research on the topic, a general-purpose version of SAGA---one that would include arbitrary importance sampling and minibatching schemes---does not exist. We remedy this situation and propose a general and flexible variant of SAGA following the {\\em arbitrary sampling} paradigm. We perform an iteration complexity analysis of the method, largely poss"},"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":"1901.08669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T22:37:42Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8849b60685d59ee32d8591bc0b05eeebf85661db0fb7f0d8b47c37084c5a1b50","abstract_canon_sha256":"bb55d5d0e2296f182a8676e43d3b5f4b19f1ce1da5febf7e7068450d3916168e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:33.447088Z","signature_b64":"YUdoTQC0/O16TfDv5EHIpLZWS+dwsiciL5+tx7q/Neipby1UNLXVjTTZHuytrTNm+Zn10GqHP/PpKyMcXuAEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e39e9a81d5764a6414ad3c34eaf36578727742fbfcff0a2d4f9130b1cab700","last_reissued_at":"2026-05-17T23:55:33.446586Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:33.446586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAGA with Arbitrary Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Peter Richt\\'arik, Xu Qian, Zheng Qu","submitted_at":"2019-01-24T22:37:42Z","abstract_excerpt":"We study the problem of minimizing the average of a very large number of smooth functions, which is of key importance in training supervised learning models. One of the most celebrated methods in this context is the SAGA algorithm. Despite years of research on the topic, a general-purpose version of SAGA---one that would include arbitrary importance sampling and minibatching schemes---does not exist. We remedy this situation and propose a general and flexible variant of SAGA following the {\\em arbitrary sampling} paradigm. We perform an iteration complexity analysis of the method, largely poss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08669","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":""},"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":"1901.08669","created_at":"2026-05-17T23:55:33.446667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08669v1","created_at":"2026-05-17T23:55:33.446667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08669","created_at":"2026-05-17T23:55:33.446667+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXRZ5GUB2V3E","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXRZ5GUB2V3EUZAU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXRZ5GUB","created_at":"2026-05-18T12:33:12.712433+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/AXRZ5GUB2V3EUZAUVU6DJ2XTMV","json":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV.json","graph_json":"https://pith.science/api/pith-number/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/graph.json","events_json":"https://pith.science/api/pith-number/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/events.json","paper":"https://pith.science/paper/AXRZ5GUB"},"agent_actions":{"view_html":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV","download_json":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV.json","view_paper":"https://pith.science/paper/AXRZ5GUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08669&json=true","fetch_graph":"https://pith.science/api/pith-number/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/graph.json","fetch_events":"https://pith.science/api/pith-number/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/action/storage_attestation","attest_author":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/action/author_attestation","sign_citation":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/action/citation_signature","submit_replication":"https://pith.science/pith/AXRZ5GUB2V3EUZAUVU6DJ2XTMV/action/replication_record"}},"created_at":"2026-05-17T23:55:33.446667+00:00","updated_at":"2026-05-17T23:55:33.446667+00:00"}