{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OZNG4MZBAG22XFCLULPFIAEOZA","short_pith_number":"pith:OZNG4MZB","schema_version":"1.0","canonical_sha256":"765a6e332101b5ab944ba2de54008ec80ef4a19ee8491ff3b051845312e66664","source":{"kind":"arxiv","id":"1906.01481","version":1},"attestation_state":"computed","paper":{"title":"L-SVRG and L-Katyusha with Arbitrary Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Richt\\'arik, Xun Qian, Zheng Qu","submitted_at":"2019-06-04T14:42:39Z","abstract_excerpt":"We develop and analyze a new family of {\\em nonaccelerated and accelerated loopless variance-reduced methods} for finite sum optimization problems. Our convergence analysis relies on a novel expected smoothness condition which upper bounds the variance of the stochastic gradient estimation by a constant times a distance-like function. This allows us to handle with ease {\\em arbitrary sampling schemes} as well as the nonconvex case. We perform an in-depth estimation of these expected smoothness parameters and propose new importance samplings which allow {\\em linear speedup} when the expected mi"},"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":"1906.01481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T14:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"79d4923e45500a904e1bdff237d55b6a87453fd837e041d037999ebe00e1cdf4","abstract_canon_sha256":"c8bfaaa2cb5370358ee61723e10054bd96756cf10ed74266eab6dc94b0f312b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.431578Z","signature_b64":"rPRsM5EDlRu8l6fkf06i6z7Sfd6BFeh0tXdMomiJhfHYk9CHUAkjIDdZ6U68YFGCwkEgXbwrqdxp4W7a/nKTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"765a6e332101b5ab944ba2de54008ec80ef4a19ee8491ff3b051845312e66664","last_reissued_at":"2026-05-17T23:44:16.431002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.431002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L-SVRG and L-Katyusha with Arbitrary Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Richt\\'arik, Xun Qian, Zheng Qu","submitted_at":"2019-06-04T14:42:39Z","abstract_excerpt":"We develop and analyze a new family of {\\em nonaccelerated and accelerated loopless variance-reduced methods} for finite sum optimization problems. Our convergence analysis relies on a novel expected smoothness condition which upper bounds the variance of the stochastic gradient estimation by a constant times a distance-like function. This allows us to handle with ease {\\em arbitrary sampling schemes} as well as the nonconvex case. We perform an in-depth estimation of these expected smoothness parameters and propose new importance samplings which allow {\\em linear speedup} when the expected mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01481","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":"1906.01481","created_at":"2026-05-17T23:44:16.431097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01481v1","created_at":"2026-05-17T23:44:16.431097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01481","created_at":"2026-05-17T23:44:16.431097+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZNG4MZBAG22","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZNG4MZBAG22XFCL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZNG4MZB","created_at":"2026-05-18T12:33:24.271573+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/OZNG4MZBAG22XFCLULPFIAEOZA","json":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA.json","graph_json":"https://pith.science/api/pith-number/OZNG4MZBAG22XFCLULPFIAEOZA/graph.json","events_json":"https://pith.science/api/pith-number/OZNG4MZBAG22XFCLULPFIAEOZA/events.json","paper":"https://pith.science/paper/OZNG4MZB"},"agent_actions":{"view_html":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA","download_json":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA.json","view_paper":"https://pith.science/paper/OZNG4MZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01481&json=true","fetch_graph":"https://pith.science/api/pith-number/OZNG4MZBAG22XFCLULPFIAEOZA/graph.json","fetch_events":"https://pith.science/api/pith-number/OZNG4MZBAG22XFCLULPFIAEOZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA/action/storage_attestation","attest_author":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA/action/author_attestation","sign_citation":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA/action/citation_signature","submit_replication":"https://pith.science/pith/OZNG4MZBAG22XFCLULPFIAEOZA/action/replication_record"}},"created_at":"2026-05-17T23:44:16.431097+00:00","updated_at":"2026-05-17T23:44:16.431097+00:00"}