{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2K66U7QAHSQWP54JVDVLQKUCQC","short_pith_number":"pith:2K66U7QA","canonical_record":{"source":{"id":"2205.15235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T16:50:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b2d5cacbeee3de4c0c9a6b6f1eb88bd218438d8a2bc67e93d3a315fc4c2766f9","abstract_canon_sha256":"eabb5dc4aa60090705630e52efa65dab2a9b3b87369d738aed98108a678edd47"},"schema_version":"1.0"},"canonical_sha256":"d2bdea7e003ca167f789a8eab82a82809507e7a8810d8dad6c41153e558fba57","source":{"kind":"arxiv","id":"2205.15235","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.15235","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2205.15235v2","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15235","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"2K66U7QAHSQW","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"2K66U7QAHSQWP54J","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"2K66U7QA","created_at":"2026-07-05T05:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2K66U7QAHSQWP54JVDVLQKUCQC","target":"record","payload":{"canonical_record":{"source":{"id":"2205.15235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T16:50:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b2d5cacbeee3de4c0c9a6b6f1eb88bd218438d8a2bc67e93d3a315fc4c2766f9","abstract_canon_sha256":"eabb5dc4aa60090705630e52efa65dab2a9b3b87369d738aed98108a678edd47"},"schema_version":"1.0"},"canonical_sha256":"d2bdea7e003ca167f789a8eab82a82809507e7a8810d8dad6c41153e558fba57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:01.359612Z","signature_b64":"PO7yezvS1Wza4DWy3O8eiPhD5fI+HeAggi8p+Cp5mqu4OCovxnkgHW3miKeLegnks2rEJuZkqN4V4fSri9VNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2bdea7e003ca167f789a8eab82a82809507e7a8810d8dad6c41153e558fba57","last_reissued_at":"2026-07-05T05:06:01.359022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:01.359022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.15235","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-07-05T05:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjcoN5ZzFxGSF7ZLmYTFG1BKY/4uhSCV8D80burobCKmPWO/VGkfYwpJEfnRcEcfDmrz6PsbMY5ci9CaG9W4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:38:13.662816Z"},"content_sha256":"1291c4087d0dc451fd632a9476a0579c665063da6fa32207e75fb141e614a293","schema_version":"1.0","event_id":"sha256:1291c4087d0dc451fd632a9476a0579c665063da6fa32207e75fb141e614a293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2K66U7QAHSQWP54JVDVLQKUCQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-convex online learning via algorithmic equivalence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Udaya Ghai, Zhou Lu","submitted_at":"2022-05-30T16:50:34Z","abstract_excerpt":"We study an algorithmic equivalence technique between non-convex gradient descent and convex mirror descent. We start by looking at a harder problem of regret minimization in online non-convex optimization. We show that under certain geometric and smoothness conditions, online gradient descent applied to non-convex functions is an approximation of online mirror descent applied to convex functions under reparameterization. In continuous time, the gradient flow with this reparameterization was shown to be exactly equivalent to continuous-time mirror descent by Amid and Warmuth 2020, but theory f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15235","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.15235/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyhsQNYXby7KxK5TEdnrZ1glJ9lr/5JlNFZOwcSMhOa6Vc8v4kYw+DxdZtQXMb3JYCzGbjxI8fK8HioNHgq2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:38:13.663195Z"},"content_sha256":"498c732e7ed45f637cf0268dcdbd5129716e6bfd269db10d7fa2bc9cb7e8988e","schema_version":"1.0","event_id":"sha256:498c732e7ed45f637cf0268dcdbd5129716e6bfd269db10d7fa2bc9cb7e8988e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2K66U7QAHSQWP54JVDVLQKUCQC/bundle.json","state_url":"https://pith.science/pith/2K66U7QAHSQWP54JVDVLQKUCQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2K66U7QAHSQWP54JVDVLQKUCQC/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-08-04T03:38:13Z","links":{"resolver":"https://pith.science/pith/2K66U7QAHSQWP54JVDVLQKUCQC","bundle":"https://pith.science/pith/2K66U7QAHSQWP54JVDVLQKUCQC/bundle.json","state":"https://pith.science/pith/2K66U7QAHSQWP54JVDVLQKUCQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2K66U7QAHSQWP54JVDVLQKUCQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2K66U7QAHSQWP54JVDVLQKUCQC","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":"eabb5dc4aa60090705630e52efa65dab2a9b3b87369d738aed98108a678edd47","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T16:50:34Z","title_canon_sha256":"b2d5cacbeee3de4c0c9a6b6f1eb88bd218438d8a2bc67e93d3a315fc4c2766f9"},"schema_version":"1.0","source":{"id":"2205.15235","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.15235","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2205.15235v2","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15235","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"2K66U7QAHSQW","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"2K66U7QAHSQWP54J","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"2K66U7QA","created_at":"2026-07-05T05:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:498c732e7ed45f637cf0268dcdbd5129716e6bfd269db10d7fa2bc9cb7e8988e","target":"graph","created_at":"2026-07-05T05:06:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.15235/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study an algorithmic equivalence technique between non-convex gradient descent and convex mirror descent. We start by looking at a harder problem of regret minimization in online non-convex optimization. We show that under certain geometric and smoothness conditions, online gradient descent applied to non-convex functions is an approximation of online mirror descent applied to convex functions under reparameterization. In continuous time, the gradient flow with this reparameterization was shown to be exactly equivalent to continuous-time mirror descent by Amid and Warmuth 2020, but theory f","authors_text":"Elad Hazan, Udaya Ghai, Zhou Lu","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T16:50:34Z","title":"Non-convex online learning via algorithmic equivalence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15235","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:1291c4087d0dc451fd632a9476a0579c665063da6fa32207e75fb141e614a293","target":"record","created_at":"2026-07-05T05:06:01Z","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":"eabb5dc4aa60090705630e52efa65dab2a9b3b87369d738aed98108a678edd47","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T16:50:34Z","title_canon_sha256":"b2d5cacbeee3de4c0c9a6b6f1eb88bd218438d8a2bc67e93d3a315fc4c2766f9"},"schema_version":"1.0","source":{"id":"2205.15235","kind":"arxiv","version":2}},"canonical_sha256":"d2bdea7e003ca167f789a8eab82a82809507e7a8810d8dad6c41153e558fba57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2bdea7e003ca167f789a8eab82a82809507e7a8810d8dad6c41153e558fba57","first_computed_at":"2026-07-05T05:06:01.359022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:01.359022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PO7yezvS1Wza4DWy3O8eiPhD5fI+HeAggi8p+Cp5mqu4OCovxnkgHW3miKeLegnks2rEJuZkqN4V4fSri9VNBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:01.359612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.15235","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1291c4087d0dc451fd632a9476a0579c665063da6fa32207e75fb141e614a293","sha256:498c732e7ed45f637cf0268dcdbd5129716e6bfd269db10d7fa2bc9cb7e8988e"],"state_sha256":"9429b0feb9b553f2e9da2a64669f9abd9b860df5535aca605bf977ad743bb3ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Stnr/zjAz0DF05T14AVpIZvFg6viqsO5QWKO7DAKbjw3ViS5t5fVcIMlWS+UFC0HZK85okqOHaF/BswJkbRZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T03:38:13.665775Z","bundle_sha256":"2993450d522127792060796ad25969b806177a6e3116648cc54948cbfc289381"}}