{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C5Z5BHX64BXNU3SIA5F2LEQLDF","short_pith_number":"pith:C5Z5BHX6","canonical_record":{"source":{"id":"1705.04138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-11T12:50:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f59e789ec935247669ec0bdbcbcb6fc432755ea224d099de8b3186dd90fd34a","abstract_canon_sha256":"95db4dabfdb6475adbb8a981f0f80a9b2d247f5930fa1af1c2fb5a0994b52f5e"},"schema_version":"1.0"},"canonical_sha256":"1773d09efee06eda6e48074ba5920b1973dc608105d34dda49efe3c38af1b59f","source":{"kind":"arxiv","id":"1705.04138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04138","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04138v2","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04138","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"C5Z5BHX64BXN","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5Z5BHX64BXNU3SI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5Z5BHX6","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C5Z5BHX64BXNU3SIA5F2LEQLDF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-11T12:50:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f59e789ec935247669ec0bdbcbcb6fc432755ea224d099de8b3186dd90fd34a","abstract_canon_sha256":"95db4dabfdb6475adbb8a981f0f80a9b2d247f5930fa1af1c2fb5a0994b52f5e"},"schema_version":"1.0"},"canonical_sha256":"1773d09efee06eda6e48074ba5920b1973dc608105d34dda49efe3c38af1b59f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:06.630604Z","signature_b64":"4JbDIN2i4maGSh5mL6IGvqsUvRVGzYJT4yRqL8BA0/Cl3VtybFj23OfR5f/GTtCcsZosG++9WqARwmbCIMbZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1773d09efee06eda6e48074ba5920b1973dc608105d34dda49efe3c38af1b59f","last_reissued_at":"2026-05-18T00:44:06.630144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:06.630144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04138","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-18T00:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhvKtRoh03qBSupwlv46c+6mlD43ukytym/fLG3JupERxwNCkgnB40n3TY8yi9b+CH2xbqpr8Nf2sn6vyaeJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:08:45.763629Z"},"content_sha256":"806bb30c74f97d6f60723c4a5b14bdaaa09b02e065c65f118a8da0a335fd642c","schema_version":"1.0","event_id":"sha256:806bb30c74f97d6f60723c4a5b14bdaaa09b02e065c65f118a8da0a335fd642c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C5Z5BHX64BXNU3SIA5F2LEQLDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Stochastic Variance Reduced ADMM for Stochastic Composition Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Longbo Huang, Yue Yu","submitted_at":"2017-05-11T12:50:23Z","abstract_excerpt":"We consider the stochastic composition optimization problem proposed in \\cite{wang2017stochastic}, which has applications ranging from estimation to statistical and machine learning. We propose the first ADMM-based algorithm named com-SVR-ADMM, and show that com-SVR-ADMM converges linearly for strongly convex and Lipschitz smooth objectives, and has a convergence rate of $O( \\log S/S)$, which improves upon the $O(S^{-4/9})$ rate in \\cite{wang2016accelerating} when the objective is convex and Lipschitz smooth. Moreover, com-SVR-ADMM possesses a rate of $O(1/\\sqrt{S})$ when the objective is conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04138","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-18T00:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkfFbE3D84MGMrx4pUmaV2Gttw8X6Gqh/mZf1/KdzmkAKKryCJBNmsil0nzaje5waa3o+cR5V1d2P9HUpb15Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:08:45.764014Z"},"content_sha256":"3e24f61149b0e0c68ef14f9d7e341137175b85b56ea87f37df20455dc5498f5a","schema_version":"1.0","event_id":"sha256:3e24f61149b0e0c68ef14f9d7e341137175b85b56ea87f37df20455dc5498f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/bundle.json","state_url":"https://pith.science/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/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-21T08:08:45Z","links":{"resolver":"https://pith.science/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF","bundle":"https://pith.science/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/bundle.json","state":"https://pith.science/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5Z5BHX64BXNU3SIA5F2LEQLDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C5Z5BHX64BXNU3SIA5F2LEQLDF","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":"95db4dabfdb6475adbb8a981f0f80a9b2d247f5930fa1af1c2fb5a0994b52f5e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-11T12:50:23Z","title_canon_sha256":"5f59e789ec935247669ec0bdbcbcb6fc432755ea224d099de8b3186dd90fd34a"},"schema_version":"1.0","source":{"id":"1705.04138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04138","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04138v2","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04138","created_at":"2026-05-18T00:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"C5Z5BHX64BXN","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C5Z5BHX64BXNU3SI","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C5Z5BHX6","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:3e24f61149b0e0c68ef14f9d7e341137175b85b56ea87f37df20455dc5498f5a","target":"graph","created_at":"2026-05-18T00:44:06Z","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":"We consider the stochastic composition optimization problem proposed in \\cite{wang2017stochastic}, which has applications ranging from estimation to statistical and machine learning. We propose the first ADMM-based algorithm named com-SVR-ADMM, and show that com-SVR-ADMM converges linearly for strongly convex and Lipschitz smooth objectives, and has a convergence rate of $O( \\log S/S)$, which improves upon the $O(S^{-4/9})$ rate in \\cite{wang2016accelerating} when the objective is convex and Lipschitz smooth. Moreover, com-SVR-ADMM possesses a rate of $O(1/\\sqrt{S})$ when the objective is conv","authors_text":"Longbo Huang, Yue Yu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-11T12:50:23Z","title":"Fast Stochastic Variance Reduced ADMM for Stochastic Composition Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04138","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:806bb30c74f97d6f60723c4a5b14bdaaa09b02e065c65f118a8da0a335fd642c","target":"record","created_at":"2026-05-18T00:44:06Z","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":"95db4dabfdb6475adbb8a981f0f80a9b2d247f5930fa1af1c2fb5a0994b52f5e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-11T12:50:23Z","title_canon_sha256":"5f59e789ec935247669ec0bdbcbcb6fc432755ea224d099de8b3186dd90fd34a"},"schema_version":"1.0","source":{"id":"1705.04138","kind":"arxiv","version":2}},"canonical_sha256":"1773d09efee06eda6e48074ba5920b1973dc608105d34dda49efe3c38af1b59f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1773d09efee06eda6e48074ba5920b1973dc608105d34dda49efe3c38af1b59f","first_computed_at":"2026-05-18T00:44:06.630144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:06.630144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JbDIN2i4maGSh5mL6IGvqsUvRVGzYJT4yRqL8BA0/Cl3VtybFj23OfR5f/GTtCcsZosG++9WqARwmbCIMbZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:06.630604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:806bb30c74f97d6f60723c4a5b14bdaaa09b02e065c65f118a8da0a335fd642c","sha256:3e24f61149b0e0c68ef14f9d7e341137175b85b56ea87f37df20455dc5498f5a"],"state_sha256":"7041f476ea69459f72a3bf3cfb4ac0a3f361e4b86b2ab2e7122ececbca425f4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAiD1ZxrHj4veLbYXzbzdPjP0zDMwBSUxmbAiBXWrwdIkX9vP8JQ60xpxerV9R8ae1lpg7aT9wl3S9aIKEQ2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T08:08:45.766117Z","bundle_sha256":"fd27117460e6b51cdea4afa525dc1d1f68cfff845b2201830c47e2e4a72a9c66"}}