{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q5H6CJ6ZQHP3IKMLZR7O5UUMBE","short_pith_number":"pith:Q5H6CJ6Z","canonical_record":{"source":{"id":"1706.07270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-22T11:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"ab20909adee1c98ee79615cc847319c12e7b151ef40e7aff41e79786c90fe12f","abstract_canon_sha256":"f9f32a0c2a176c8b0cae0de483af304d9f9cb3fc184e6b1cbf56779d50c43b03"},"schema_version":"1.0"},"canonical_sha256":"874fe127d981dfb4298bcc7eeed28c093a15688071d36c2c791969256088d95a","source":{"kind":"arxiv","id":"1706.07270","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07270","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07270v2","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07270","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"Q5H6CJ6ZQHP3","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5H6CJ6ZQHP3IKML","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5H6CJ6Z","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q5H6CJ6ZQHP3IKMLZR7O5UUMBE","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-22T11:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"ab20909adee1c98ee79615cc847319c12e7b151ef40e7aff41e79786c90fe12f","abstract_canon_sha256":"f9f32a0c2a176c8b0cae0de483af304d9f9cb3fc184e6b1cbf56779d50c43b03"},"schema_version":"1.0"},"canonical_sha256":"874fe127d981dfb4298bcc7eeed28c093a15688071d36c2c791969256088d95a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:41.494655Z","signature_b64":"or8KOAqygWUH7wKnEuc5LFyYdd5WyYeZZf80WmUufLVbIAkDmF1UApEIuF9yDBQdncVNZJZrvQ3HG6wbaqMABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874fe127d981dfb4298bcc7eeed28c093a15688071d36c2c791969256088d95a","last_reissued_at":"2026-05-18T00:38:41.494196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:41.494196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07270","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:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75tw6BZjYIjTEJm+j9S2jevkrXvmiXR9R3lHaeqKh1Bo02qYgXUAu2Iy8+dT1BQBOG7QnrtoEUC2yuSJjkcsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:17:57.792087Z"},"content_sha256":"b8f8109e894d30c704abeb212154d6c7b141dec21556de199efa04274d2f9bae","schema_version":"1.0","event_id":"sha256:b8f8109e894d30c704abeb212154d6c7b141dec21556de199efa04274d2f9bae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q5H6CJ6ZQHP3IKMLZR7O5UUMBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonlinear Acceleration of Stochastic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Damien Scieur, Francis Bach","submitted_at":"2017-06-22T11:53:37Z","abstract_excerpt":"Extrapolation methods use the last few iterates of an optimization algorithm to produce a better estimate of the optimum. They were shown to achieve optimal convergence rates in a deterministic setting using simple gradient iterates. Here, we study extrapolation methods in a stochastic setting, where the iterates are produced by either a simple or an accelerated stochastic gradient algorithm. We first derive convergence bounds for arbitrary, potentially biased perturbations, then produce asymptotic bounds using the ratio between the variance of the noise and the accuracy of the current point. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07270","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:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKUUx3XeQUAQ2r6KB/YkJcKEU1yxzLFR3zNXO14AS5oe80n1ckZN/dwJwe83Uv1ZxEL2msaPzeH7wODZYtdCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T15:17:57.792440Z"},"content_sha256":"f1db6e9411a5fd0dfe2ab5afefc2faa465f878dc848ae072a4f0cd237255f1b5","schema_version":"1.0","event_id":"sha256:f1db6e9411a5fd0dfe2ab5afefc2faa465f878dc848ae072a4f0cd237255f1b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/bundle.json","state_url":"https://pith.science/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/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-06-22T15:17:57Z","links":{"resolver":"https://pith.science/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE","bundle":"https://pith.science/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/bundle.json","state":"https://pith.science/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5H6CJ6ZQHP3IKMLZR7O5UUMBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q5H6CJ6ZQHP3IKMLZR7O5UUMBE","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":"f9f32a0c2a176c8b0cae0de483af304d9f9cb3fc184e6b1cbf56779d50c43b03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-22T11:53:37Z","title_canon_sha256":"ab20909adee1c98ee79615cc847319c12e7b151ef40e7aff41e79786c90fe12f"},"schema_version":"1.0","source":{"id":"1706.07270","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07270","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07270v2","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07270","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"Q5H6CJ6ZQHP3","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5H6CJ6ZQHP3IKML","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5H6CJ6Z","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:f1db6e9411a5fd0dfe2ab5afefc2faa465f878dc848ae072a4f0cd237255f1b5","target":"graph","created_at":"2026-05-18T00:38:41Z","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":"Extrapolation methods use the last few iterates of an optimization algorithm to produce a better estimate of the optimum. They were shown to achieve optimal convergence rates in a deterministic setting using simple gradient iterates. Here, we study extrapolation methods in a stochastic setting, where the iterates are produced by either a simple or an accelerated stochastic gradient algorithm. We first derive convergence bounds for arbitrary, potentially biased perturbations, then produce asymptotic bounds using the ratio between the variance of the noise and the accuracy of the current point. ","authors_text":"Alexandre d'Aspremont, Damien Scieur, Francis Bach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-22T11:53:37Z","title":"Nonlinear Acceleration of Stochastic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07270","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:b8f8109e894d30c704abeb212154d6c7b141dec21556de199efa04274d2f9bae","target":"record","created_at":"2026-05-18T00:38:41Z","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":"f9f32a0c2a176c8b0cae0de483af304d9f9cb3fc184e6b1cbf56779d50c43b03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-22T11:53:37Z","title_canon_sha256":"ab20909adee1c98ee79615cc847319c12e7b151ef40e7aff41e79786c90fe12f"},"schema_version":"1.0","source":{"id":"1706.07270","kind":"arxiv","version":2}},"canonical_sha256":"874fe127d981dfb4298bcc7eeed28c093a15688071d36c2c791969256088d95a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874fe127d981dfb4298bcc7eeed28c093a15688071d36c2c791969256088d95a","first_computed_at":"2026-05-18T00:38:41.494196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:41.494196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"or8KOAqygWUH7wKnEuc5LFyYdd5WyYeZZf80WmUufLVbIAkDmF1UApEIuF9yDBQdncVNZJZrvQ3HG6wbaqMABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:41.494655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07270","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8f8109e894d30c704abeb212154d6c7b141dec21556de199efa04274d2f9bae","sha256:f1db6e9411a5fd0dfe2ab5afefc2faa465f878dc848ae072a4f0cd237255f1b5"],"state_sha256":"a637bcfe3e8b634fa325d53aafbb1e5de2b4a359cc6b42ad55a730de1ff84c68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnhouSx+3aWfu3ibOWSdNyOrvYJs2MIxwL54hnEHahWJoih7pxr+7743aGUnXr0bT+En50ZxdDlnEkbd6RP7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T15:17:57.794367Z","bundle_sha256":"d73a4f611402ecad8ee4c622075c81c1f1ff6a6318dbc504c170b4e27c6aaf7e"}}