{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EPKSG22FC5BYX25MCBSJKOQRG5","short_pith_number":"pith:EPKSG22F","canonical_record":{"source":{"id":"1809.10491","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T12:35:17Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7f3ca4c1a7fa7aa3c83dedde70f432083ac3db52202ab1f6234f8c3b1a9ee800","abstract_canon_sha256":"f2299779b02d4cde25235383e824e25651d4973ddd827fbe495413fb7fd06041"},"schema_version":"1.0"},"canonical_sha256":"23d5236b4517438bebac1064953a11374adb565f94ce007793dc52e4c15e9df5","source":{"kind":"arxiv","id":"1809.10491","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10491","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10491v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10491","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"EPKSG22FC5BY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPKSG22FC5BYX25M","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPKSG22F","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EPKSG22FC5BYX25MCBSJKOQRG5","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10491","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T12:35:17Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7f3ca4c1a7fa7aa3c83dedde70f432083ac3db52202ab1f6234f8c3b1a9ee800","abstract_canon_sha256":"f2299779b02d4cde25235383e824e25651d4973ddd827fbe495413fb7fd06041"},"schema_version":"1.0"},"canonical_sha256":"23d5236b4517438bebac1064953a11374adb565f94ce007793dc52e4c15e9df5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.263899Z","signature_b64":"LeFmFL4NW9GtSffe0Xwej3r1Efl1PCDo9zqShJAV6EjdlI7tAJH223oHyIu1R71ehn0Os0Adfz5zkcANlIPnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d5236b4517438bebac1064953a11374adb565f94ce007793dc52e4c15e9df5","last_reissued_at":"2026-05-17T23:55:03.263530Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.263530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10491","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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z78nwPj5nIO0srIAvns0/9ev5V/944ZEq9jS+yIYsXUlsGfSds4Tq33lmbRK4sMY7ZrBJhNVJ0B7m/xXXbAQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:31:05.430509Z"},"content_sha256":"f1d4fb6323a3f668ec97f992e3bfb337e829fe1c363920b6eec468a317d02ec9","schema_version":"1.0","event_id":"sha256:f1d4fb6323a3f668ec97f992e3bfb337e829fe1c363920b6eec468a317d02ec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EPKSG22FC5BYX25MCBSJKOQRG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2018-09-27T12:35:17Z","abstract_excerpt":"In this paper we focus on the problem of Online Principal Component Analysis in the regret minimization framework. For this problem, all existing regret minimization algorithms for the fully-adversarial setting are based on a positive semidefinite convex relaxation, and hence require quadratic memory and SVD computation (either thin of full) on each iteration, which amounts to at least quadratic runtime per iteration. This is in stark contrast to a corresponding stochastic i.i.d. variant of the problem, which was studied extensively lately, and admits very efficient gradient ascent algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10491","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-17T23:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynxgUvrsaFFn2V2z+SWgBbJd/DxyYNcvOvbRj1+3qrlLFZZ+2tgrU+W2XL+HbCjTYpIPLupvUeDhTzxwWQvkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:31:05.430852Z"},"content_sha256":"01d3a61d936ee82c31d1ea67d24d54b396d630ebc665c10c61b8992681563a11","schema_version":"1.0","event_id":"sha256:01d3a61d936ee82c31d1ea67d24d54b396d630ebc665c10c61b8992681563a11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPKSG22FC5BYX25MCBSJKOQRG5/bundle.json","state_url":"https://pith.science/pith/EPKSG22FC5BYX25MCBSJKOQRG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPKSG22FC5BYX25MCBSJKOQRG5/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-24T21:31:05Z","links":{"resolver":"https://pith.science/pith/EPKSG22FC5BYX25MCBSJKOQRG5","bundle":"https://pith.science/pith/EPKSG22FC5BYX25MCBSJKOQRG5/bundle.json","state":"https://pith.science/pith/EPKSG22FC5BYX25MCBSJKOQRG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPKSG22FC5BYX25MCBSJKOQRG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EPKSG22FC5BYX25MCBSJKOQRG5","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":"f2299779b02d4cde25235383e824e25651d4973ddd827fbe495413fb7fd06041","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T12:35:17Z","title_canon_sha256":"7f3ca4c1a7fa7aa3c83dedde70f432083ac3db52202ab1f6234f8c3b1a9ee800"},"schema_version":"1.0","source":{"id":"1809.10491","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10491","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10491v2","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10491","created_at":"2026-05-17T23:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"EPKSG22FC5BY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPKSG22FC5BYX25M","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPKSG22F","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:01d3a61d936ee82c31d1ea67d24d54b396d630ebc665c10c61b8992681563a11","target":"graph","created_at":"2026-05-17T23:55:03Z","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":"In this paper we focus on the problem of Online Principal Component Analysis in the regret minimization framework. For this problem, all existing regret minimization algorithms for the fully-adversarial setting are based on a positive semidefinite convex relaxation, and hence require quadratic memory and SVD computation (either thin of full) on each iteration, which amounts to at least quadratic runtime per iteration. This is in stark contrast to a corresponding stochastic i.i.d. variant of the problem, which was studied extensively lately, and admits very efficient gradient ascent algorithms ","authors_text":"Dan Garber","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T12:35:17Z","title":"On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10491","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:f1d4fb6323a3f668ec97f992e3bfb337e829fe1c363920b6eec468a317d02ec9","target":"record","created_at":"2026-05-17T23:55:03Z","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":"f2299779b02d4cde25235383e824e25651d4973ddd827fbe495413fb7fd06041","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-27T12:35:17Z","title_canon_sha256":"7f3ca4c1a7fa7aa3c83dedde70f432083ac3db52202ab1f6234f8c3b1a9ee800"},"schema_version":"1.0","source":{"id":"1809.10491","kind":"arxiv","version":2}},"canonical_sha256":"23d5236b4517438bebac1064953a11374adb565f94ce007793dc52e4c15e9df5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23d5236b4517438bebac1064953a11374adb565f94ce007793dc52e4c15e9df5","first_computed_at":"2026-05-17T23:55:03.263530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:03.263530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LeFmFL4NW9GtSffe0Xwej3r1Efl1PCDo9zqShJAV6EjdlI7tAJH223oHyIu1R71ehn0Os0Adfz5zkcANlIPnBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:03.263899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10491","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d4fb6323a3f668ec97f992e3bfb337e829fe1c363920b6eec468a317d02ec9","sha256:01d3a61d936ee82c31d1ea67d24d54b396d630ebc665c10c61b8992681563a11"],"state_sha256":"7979746509fe07ae1e91827d28aae72364667c6b17340489fb6887fd03803da8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fy69QbRUMkQdS6nsqbhCbOXCgRB885Wf31rPcGGrOtNHBeQACmMi7GD8S5SPMKloeCKC3aKN+Rb6EZ+FQ+fWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:31:05.432731Z","bundle_sha256":"3059155c2962a523b5faf94ca991b855463ec128188f3b03f557de3a8bc99c34"}}