{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:STN76QIYC6DAUMLFKWPAEJTIZE","short_pith_number":"pith:STN76QIY","canonical_record":{"source":{"id":"1606.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-02T09:59:16Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"54d1399218ba669b702afd7398d723b7e0a5cc99848341349474d617c7c8b479","abstract_canon_sha256":"8c23a250594e2a35e2422311f9cedecbed59aa897ff2fe55248902f956c0ea93"},"schema_version":"1.0"},"canonical_sha256":"94dbff411817860a3165559e022668c90badf93ebbbc2b1e3fb759e4f043f2ff","source":{"kind":"arxiv","id":"1606.00602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00602","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00602v2","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00602","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"STN76QIYC6DA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"STN76QIYC6DAUMLF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"STN76QIY","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:STN76QIYC6DAUMLFKWPAEJTIZE","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-02T09:59:16Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"54d1399218ba669b702afd7398d723b7e0a5cc99848341349474d617c7c8b479","abstract_canon_sha256":"8c23a250594e2a35e2422311f9cedecbed59aa897ff2fe55248902f956c0ea93"},"schema_version":"1.0"},"canonical_sha256":"94dbff411817860a3165559e022668c90badf93ebbbc2b1e3fb759e4f043f2ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:49.746529Z","signature_b64":"Isbm3Wf0NtXitgHqYAjkua+eOj6O2TFFQ1lOAo8rlD96vDKWQ8g3jaC3S6bTnZTg0zMTUfeDwH4IQSocz5gSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94dbff411817860a3165559e022668c90badf93ebbbc2b1e3fb759e4f043f2ff","last_reissued_at":"2026-05-18T01:04:49.745952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:49.745952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00602","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrIFd2L3OSR83aE0yxOn5YpRHBbTKdv+8/itr66PTfF3yxEWy8q7wGHs9S/TUUke01pewPSMOGDz4N0X0TiLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:48.385166Z"},"content_sha256":"b3a5143f6a86060a2c57113861162ccf9f50e19b5765df27bcfadf8287183562","schema_version":"1.0","event_id":"sha256:b3a5143f6a86060a2c57113861162ccf9f50e19b5765df27bcfadf8287183562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:STN76QIYC6DAUMLFKWPAEJTIZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variance-Reduced Proximal Stochastic Gradient Descent for Non-convex Composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Xiyu Yu","submitted_at":"2016-06-02T09:59:16Z","abstract_excerpt":"Here we study non-convex composite optimization: first, a finite-sum of smooth but non-convex functions, and second, a general function that admits a simple proximal mapping. Most research on stochastic methods for composite optimization assumes convexity or strong convexity of each function. In this paper, we extend this problem into the non-convex setting using variance reduction techniques, such as prox-SVRG and prox-SAGA. We prove that, with a constant step size, both prox-SVRG and prox-SAGA are suitable for non-convex composite optimization, and help the problem converge to a stationary p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00602","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Spk8MvaXQFR0lpqjlimfO2v6p1mLqqwcZpHcUehO1+CuH0dMQ4NjiY2qv9lOnN9X2uBSHgQ5lBDkEv6UX+Q+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:48.385525Z"},"content_sha256":"eb6140109ccf0865acdf27c6214526e3c57a1c8bbe4f89865dc0606b8fdd7a1a","schema_version":"1.0","event_id":"sha256:eb6140109ccf0865acdf27c6214526e3c57a1c8bbe4f89865dc0606b8fdd7a1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STN76QIYC6DAUMLFKWPAEJTIZE/bundle.json","state_url":"https://pith.science/pith/STN76QIYC6DAUMLFKWPAEJTIZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STN76QIYC6DAUMLFKWPAEJTIZE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T23:22:48Z","links":{"resolver":"https://pith.science/pith/STN76QIYC6DAUMLFKWPAEJTIZE","bundle":"https://pith.science/pith/STN76QIYC6DAUMLFKWPAEJTIZE/bundle.json","state":"https://pith.science/pith/STN76QIYC6DAUMLFKWPAEJTIZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STN76QIYC6DAUMLFKWPAEJTIZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:STN76QIYC6DAUMLFKWPAEJTIZE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8c23a250594e2a35e2422311f9cedecbed59aa897ff2fe55248902f956c0ea93","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-02T09:59:16Z","title_canon_sha256":"54d1399218ba669b702afd7398d723b7e0a5cc99848341349474d617c7c8b479"},"schema_version":"1.0","source":{"id":"1606.00602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00602","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00602v2","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00602","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"STN76QIYC6DA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"STN76QIYC6DAUMLF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"STN76QIY","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:eb6140109ccf0865acdf27c6214526e3c57a1c8bbe4f89865dc0606b8fdd7a1a","target":"graph","created_at":"2026-05-18T01:04:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Here we study non-convex composite optimization: first, a finite-sum of smooth but non-convex functions, and second, a general function that admits a simple proximal mapping. Most research on stochastic methods for composite optimization assumes convexity or strong convexity of each function. In this paper, we extend this problem into the non-convex setting using variance reduction techniques, such as prox-SVRG and prox-SAGA. We prove that, with a constant step size, both prox-SVRG and prox-SAGA are suitable for non-convex composite optimization, and help the problem converge to a stationary p","authors_text":"Dacheng Tao, Xiyu Yu","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-02T09:59:16Z","title":"Variance-Reduced Proximal Stochastic Gradient Descent for Non-convex Composite optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00602","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3a5143f6a86060a2c57113861162ccf9f50e19b5765df27bcfadf8287183562","target":"record","created_at":"2026-05-18T01:04:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8c23a250594e2a35e2422311f9cedecbed59aa897ff2fe55248902f956c0ea93","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-02T09:59:16Z","title_canon_sha256":"54d1399218ba669b702afd7398d723b7e0a5cc99848341349474d617c7c8b479"},"schema_version":"1.0","source":{"id":"1606.00602","kind":"arxiv","version":2}},"canonical_sha256":"94dbff411817860a3165559e022668c90badf93ebbbc2b1e3fb759e4f043f2ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94dbff411817860a3165559e022668c90badf93ebbbc2b1e3fb759e4f043f2ff","first_computed_at":"2026-05-18T01:04:49.745952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:49.745952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Isbm3Wf0NtXitgHqYAjkua+eOj6O2TFFQ1lOAo8rlD96vDKWQ8g3jaC3S6bTnZTg0zMTUfeDwH4IQSocz5gSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:49.746529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3a5143f6a86060a2c57113861162ccf9f50e19b5765df27bcfadf8287183562","sha256:eb6140109ccf0865acdf27c6214526e3c57a1c8bbe4f89865dc0606b8fdd7a1a"],"state_sha256":"3443880b15da8bf2825c5b6b61b551a06c17ed85e63766044c43f441f357ac92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmrJh2EvGdPuSjZsuZEJAE+ag/SnLNc4/zahjzX/zC5vgow5r9bL9v/EaPhPg7oB8YpG+pC79CtugeM1wV1MBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:22:48.387493Z","bundle_sha256":"10bd6edce1b3fdd5f9fb9b60fe2902c087fc85ec7ad615bd254ffdeff90acf51"}}