{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CRS4IJXDDYT6M5V36BNCFFJQ4T","short_pith_number":"pith:CRS4IJXD","schema_version":"1.0","canonical_sha256":"1465c426e31e27e676bbf05a229530e4e7f9ec5a71a9e737d216fd9dfb241e0c","source":{"kind":"arxiv","id":"1705.06884","version":2},"attestation_state":"computed","paper":{"title":"A Unified Framework for Stochastic Matrix Factorization via Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jiashi Feng, Renbo Zhao, William B. Haskell","submitted_at":"2017-05-19T08:05:10Z","abstract_excerpt":"We propose a unified framework to speed up the existing stochastic matrix factorization (SMF) algorithms via variance reduction. Our framework is general and it subsumes several well-known SMF formulations in the literature. We perform a non-asymptotic convergence analysis of our framework and derive computational and sample complexities for our algorithm to converge to an $\\epsilon$-stationary point in expectation. In addition, extensive experiments for a wide class of SMF formulations demonstrate that our framework consistently yields faster convergence and a more accurate output dictionary "},"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":"1705.06884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-19T08:05:10Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"aa00dda38528ed71469139fb1611dfaf1c9c56d431ee3778c38aa9d21d756a96","abstract_canon_sha256":"784e77c9c6c4fd7f9294d555efbc15cfca5366184ddb90fe81fb0c584f67fcb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.517229Z","signature_b64":"fPBy2LJT0EDKvV6+3Xive+PqwJ+45q28nfFaybJTz+n70mi5FENl/fNYMT1x7Bog6+E+3E1KQjRU8o1/IbVCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1465c426e31e27e676bbf05a229530e4e7f9ec5a71a9e737d216fd9dfb241e0c","last_reissued_at":"2026-05-18T00:44:06.516511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.516511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Stochastic Matrix Factorization via Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jiashi Feng, Renbo Zhao, William B. Haskell","submitted_at":"2017-05-19T08:05:10Z","abstract_excerpt":"We propose a unified framework to speed up the existing stochastic matrix factorization (SMF) algorithms via variance reduction. Our framework is general and it subsumes several well-known SMF formulations in the literature. We perform a non-asymptotic convergence analysis of our framework and derive computational and sample complexities for our algorithm to converge to an $\\epsilon$-stationary point in expectation. In addition, extensive experiments for a wide class of SMF formulations demonstrate that our framework consistently yields faster convergence and a more accurate output dictionary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06884","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":"1705.06884","created_at":"2026-05-18T00:44:06.516631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06884v2","created_at":"2026-05-18T00:44:06.516631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06884","created_at":"2026-05-18T00:44:06.516631+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRS4IJXDDYT6","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRS4IJXDDYT6M5V3","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRS4IJXD","created_at":"2026-05-18T12:31:10.602751+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/CRS4IJXDDYT6M5V36BNCFFJQ4T","json":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T.json","graph_json":"https://pith.science/api/pith-number/CRS4IJXDDYT6M5V36BNCFFJQ4T/graph.json","events_json":"https://pith.science/api/pith-number/CRS4IJXDDYT6M5V36BNCFFJQ4T/events.json","paper":"https://pith.science/paper/CRS4IJXD"},"agent_actions":{"view_html":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T","download_json":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T.json","view_paper":"https://pith.science/paper/CRS4IJXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06884&json=true","fetch_graph":"https://pith.science/api/pith-number/CRS4IJXDDYT6M5V36BNCFFJQ4T/graph.json","fetch_events":"https://pith.science/api/pith-number/CRS4IJXDDYT6M5V36BNCFFJQ4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T/action/storage_attestation","attest_author":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T/action/author_attestation","sign_citation":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T/action/citation_signature","submit_replication":"https://pith.science/pith/CRS4IJXDDYT6M5V36BNCFFJQ4T/action/replication_record"}},"created_at":"2026-05-18T00:44:06.516631+00:00","updated_at":"2026-05-18T00:44:06.516631+00:00"}