{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R7MMDDLJBBS72JAQ67SXQTUKCP","short_pith_number":"pith:R7MMDDLJ","schema_version":"1.0","canonical_sha256":"8fd8c18d690865fd2410f7e5784e8a13d39275841b43fe38d448ef182b3dcfe9","source":{"kind":"arxiv","id":"1603.06861","version":1},"attestation_state":"computed","paper":{"title":"Trading-off variance and complexity in stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Anastasios Kyrillidis, Megasthenis Asteris, Sujay Sanghavi, Vatsal Shah","submitted_at":"2016-03-22T16:34:26Z","abstract_excerpt":"Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stochastic counterparts with respect to the convergence rate, due to high variance introduced by the stochastic updates. The popular Stochastic Variance-Reduced Gradient (SVRG) method mitigates this shortcoming, introducing a new update rule which requires infrequent passes over the entire input dataset to compute the full-gradient.\n  In this work, we propose CheapSVRG, a stochastic variance-reduction optimization scheme"},"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":"1603.06861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-22T16:34:26Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"266d0057534836f76eae2658944054362805c0e24b1cafceda17531798b1734f","abstract_canon_sha256":"e4dade02187616c40d84435802674c4a462833354e0e04850da7d3e66bd1b0b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.554696Z","signature_b64":"G6Vpswh11KgfH3+H0/yBFODvMncVmDxTxpqj0FyvjncSyy5ZtLlZ4D+kF+n2xQZS5Puy972CqVQrjWF9gnvPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd8c18d690865fd2410f7e5784e8a13d39275841b43fe38d448ef182b3dcfe9","last_reissued_at":"2026-05-18T01:18:34.554208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.554208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading-off variance and complexity in stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Anastasios Kyrillidis, Megasthenis Asteris, Sujay Sanghavi, Vatsal Shah","submitted_at":"2016-03-22T16:34:26Z","abstract_excerpt":"Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stochastic counterparts with respect to the convergence rate, due to high variance introduced by the stochastic updates. The popular Stochastic Variance-Reduced Gradient (SVRG) method mitigates this shortcoming, introducing a new update rule which requires infrequent passes over the entire input dataset to compute the full-gradient.\n  In this work, we propose CheapSVRG, a stochastic variance-reduction optimization scheme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06861","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":"1603.06861","created_at":"2026-05-18T01:18:34.554282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06861v1","created_at":"2026-05-18T01:18:34.554282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06861","created_at":"2026-05-18T01:18:34.554282+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7MMDDLJBBS7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7MMDDLJBBS72JAQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7MMDDLJ","created_at":"2026-05-18T12:30:41.710351+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/R7MMDDLJBBS72JAQ67SXQTUKCP","json":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP.json","graph_json":"https://pith.science/api/pith-number/R7MMDDLJBBS72JAQ67SXQTUKCP/graph.json","events_json":"https://pith.science/api/pith-number/R7MMDDLJBBS72JAQ67SXQTUKCP/events.json","paper":"https://pith.science/paper/R7MMDDLJ"},"agent_actions":{"view_html":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP","download_json":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP.json","view_paper":"https://pith.science/paper/R7MMDDLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06861&json=true","fetch_graph":"https://pith.science/api/pith-number/R7MMDDLJBBS72JAQ67SXQTUKCP/graph.json","fetch_events":"https://pith.science/api/pith-number/R7MMDDLJBBS72JAQ67SXQTUKCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP/action/storage_attestation","attest_author":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP/action/author_attestation","sign_citation":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP/action/citation_signature","submit_replication":"https://pith.science/pith/R7MMDDLJBBS72JAQ67SXQTUKCP/action/replication_record"}},"created_at":"2026-05-18T01:18:34.554282+00:00","updated_at":"2026-05-18T01:18:34.554282+00:00"}