{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EROUJSXSKESJY4FXGWDWH3G2SL","short_pith_number":"pith:EROUJSXS","canonical_record":{"source":{"id":"1711.04416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-13T04:21:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09763657695e81561651a6535d227a718625d0048cb0d23bbc3b352176957914","abstract_canon_sha256":"53387d4e381e2eb7de81716bdd009dea307c1e3c99bcdeaae0958f62ed164843"},"schema_version":"1.0"},"canonical_sha256":"245d44caf251249c70b7358763ecda92fd9956bff0e55336ad176490586ec5fd","source":{"kind":"arxiv","id":"1711.04416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04416","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04416v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04416","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"EROUJSXSKESJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EROUJSXSKESJY4FX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EROUJSXS","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EROUJSXSKESJY4FXGWDWH3G2SL","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-13T04:21:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09763657695e81561651a6535d227a718625d0048cb0d23bbc3b352176957914","abstract_canon_sha256":"53387d4e381e2eb7de81716bdd009dea307c1e3c99bcdeaae0958f62ed164843"},"schema_version":"1.0"},"canonical_sha256":"245d44caf251249c70b7358763ecda92fd9956bff0e55336ad176490586ec5fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:39.099956Z","signature_b64":"xu/JuqYl58e8Szwa/r0RugD92tjVPXGYJbFlZnsxOQSmAKdWOKoKQ4W1Z2CiQQqicwA5tdS58GezHWLxiF9uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245d44caf251249c70b7358763ecda92fd9956bff0e55336ad176490586ec5fd","last_reissued_at":"2026-05-18T00:30:39.099403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:39.099403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04416","source_version":1,"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-18T00:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBehnXl/iv5VgUd/eOBJNKCH+aCMVLwkX1seiAnvaVy9Vfk5XD+6pjZZQQdYQSQxJTogKVH0vIE6SSL7Z74BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:07:39.279391Z"},"content_sha256":"67ab965edd46ad72f3eb3f7079fc9ff622667a4c6f93881fb8b31cb3b5047761","schema_version":"1.0","event_id":"sha256:67ab965edd46ad72f3eb3f7079fc9ff622667a4c6f93881fb8b31cb3b5047761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EROUJSXSKESJY4FXGWDWH3G2SL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variance Reduced methods for Non-convex Composition Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Ji Liu, Liu Liu","submitted_at":"2017-11-13T04:21:41Z","abstract_excerpt":"This paper explores the non-convex composition optimization in the form including inner and outer finite-sum functions with a large number of component functions. This problem arises in some important applications such as nonlinear embedding and reinforcement learning. Although existing approaches such as stochastic gradient descent (SGD) and stochastic variance reduced gradient (SVRG) descent can be applied to solve this problem, their query complexity tends to be high, especially when the number of inner component functions is large. In this paper, we apply the variance-reduced technique to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04416","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"},"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-18T00:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCQKidtdu1GaquOwynTtjrJlSVfMfVcUAfP/xnCi4P3zht2MK8ywfIsF9AkSunagoVIKhbj9mgXWnZ3Ks0MBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:07:39.279744Z"},"content_sha256":"7e18c4f6c391b9fa311a2dec5a9f86712cb619c47d66efbfe18bedac5087e368","schema_version":"1.0","event_id":"sha256:7e18c4f6c391b9fa311a2dec5a9f86712cb619c47d66efbfe18bedac5087e368"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EROUJSXSKESJY4FXGWDWH3G2SL/bundle.json","state_url":"https://pith.science/pith/EROUJSXSKESJY4FXGWDWH3G2SL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EROUJSXSKESJY4FXGWDWH3G2SL/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-31T18:07:39Z","links":{"resolver":"https://pith.science/pith/EROUJSXSKESJY4FXGWDWH3G2SL","bundle":"https://pith.science/pith/EROUJSXSKESJY4FXGWDWH3G2SL/bundle.json","state":"https://pith.science/pith/EROUJSXSKESJY4FXGWDWH3G2SL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EROUJSXSKESJY4FXGWDWH3G2SL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EROUJSXSKESJY4FXGWDWH3G2SL","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":"53387d4e381e2eb7de81716bdd009dea307c1e3c99bcdeaae0958f62ed164843","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-13T04:21:41Z","title_canon_sha256":"09763657695e81561651a6535d227a718625d0048cb0d23bbc3b352176957914"},"schema_version":"1.0","source":{"id":"1711.04416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04416","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04416v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04416","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"EROUJSXSKESJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EROUJSXSKESJY4FX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EROUJSXS","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7e18c4f6c391b9fa311a2dec5a9f86712cb619c47d66efbfe18bedac5087e368","target":"graph","created_at":"2026-05-18T00:30:39Z","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":"This paper explores the non-convex composition optimization in the form including inner and outer finite-sum functions with a large number of component functions. This problem arises in some important applications such as nonlinear embedding and reinforcement learning. Although existing approaches such as stochastic gradient descent (SGD) and stochastic variance reduced gradient (SVRG) descent can be applied to solve this problem, their query complexity tends to be high, especially when the number of inner component functions is large. In this paper, we apply the variance-reduced technique to ","authors_text":"Dacheng Tao, Ji Liu, Liu Liu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-13T04:21:41Z","title":"Variance Reduced methods for Non-convex Composition Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04416","kind":"arxiv","version":1},"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:67ab965edd46ad72f3eb3f7079fc9ff622667a4c6f93881fb8b31cb3b5047761","target":"record","created_at":"2026-05-18T00:30:39Z","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":"53387d4e381e2eb7de81716bdd009dea307c1e3c99bcdeaae0958f62ed164843","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-13T04:21:41Z","title_canon_sha256":"09763657695e81561651a6535d227a718625d0048cb0d23bbc3b352176957914"},"schema_version":"1.0","source":{"id":"1711.04416","kind":"arxiv","version":1}},"canonical_sha256":"245d44caf251249c70b7358763ecda92fd9956bff0e55336ad176490586ec5fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"245d44caf251249c70b7358763ecda92fd9956bff0e55336ad176490586ec5fd","first_computed_at":"2026-05-18T00:30:39.099403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:39.099403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xu/JuqYl58e8Szwa/r0RugD92tjVPXGYJbFlZnsxOQSmAKdWOKoKQ4W1Z2CiQQqicwA5tdS58GezHWLxiF9uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:39.099956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67ab965edd46ad72f3eb3f7079fc9ff622667a4c6f93881fb8b31cb3b5047761","sha256:7e18c4f6c391b9fa311a2dec5a9f86712cb619c47d66efbfe18bedac5087e368"],"state_sha256":"e06d88a1c14cdf7ee67cfc41594bcfdcc1ff5f503d660eb3a5bdca77df1cde7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snOZZpcR4tUvJz4/fmCzU8PFjLiMWZc3B80GYZ+MtEY2cijRsAZXVLpi2fUhYEzmqQtd7RFt/75zdvHLe0m+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:07:39.281922Z","bundle_sha256":"e457403c75cdd805d36e93444d772e750401924327a7916c57709a2947b89a34"}}