{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:AGEEYAVIV5UEYAWM3LPSAONOBL","short_pith_number":"pith:AGEEYAVI","canonical_record":{"source":{"id":"2202.03684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-08T07:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"2acb6877c61d753b68cdb40b6fe3b9affc617461c1f55535170949bd8181ce43","abstract_canon_sha256":"f61709423aff09c35b4f4fc074a191edbe8a66d0cb0f7d41d19e942686d547ce"},"schema_version":"1.0"},"canonical_sha256":"01884c02a8af684c02ccdadf2039ae0acd3fc9924825dbf39406f45f9e20fdf2","source":{"kind":"arxiv","id":"2202.03684","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03684","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03684v2","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03684","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"AGEEYAVIV5UE","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_16","alias_value":"AGEEYAVIV5UEYAWM","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_8","alias_value":"AGEEYAVI","created_at":"2026-07-05T06:08:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:AGEEYAVIV5UEYAWM3LPSAONOBL","target":"record","payload":{"canonical_record":{"source":{"id":"2202.03684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-08T07:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"2acb6877c61d753b68cdb40b6fe3b9affc617461c1f55535170949bd8181ce43","abstract_canon_sha256":"f61709423aff09c35b4f4fc074a191edbe8a66d0cb0f7d41d19e942686d547ce"},"schema_version":"1.0"},"canonical_sha256":"01884c02a8af684c02ccdadf2039ae0acd3fc9924825dbf39406f45f9e20fdf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:50.995476Z","signature_b64":"013DQGcCDJ3X3ED6uqm97shjHha2JgoFEsG1AgW+TUuiz7a9L5Efs55G/vpczwSczI6xxkByQTLxzr8QHQ5ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01884c02a8af684c02ccdadf2039ae0acd3fc9924825dbf39406f45f9e20fdf2","last_reissued_at":"2026-07-05T06:08:50.995047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:50.995047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.03684","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-05T06:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00ny0YlJ86Vui9aP4ZaB2GCs3UOHycgJT9cHR8gjCnqxlMT2vE42q9K5V/qbn6Q4HNSjdIfkArkk3xAHNFLGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:01:42.011749Z"},"content_sha256":"6e12faab4393f3fc17ca9430403ed0f860ce4e236473d2b0f8aecb97af6187d8","schema_version":"1.0","event_id":"sha256:6e12faab4393f3fc17ca9430403ed0f860ce4e236473d2b0f8aecb97af6187d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:AGEEYAVIV5UEYAWM3LPSAONOBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Escaping Saddle Points in Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Lifeng Lai, Minhui Huang, Shiqian Ma, Xuxing Chen","submitted_at":"2022-02-08T07:10:06Z","abstract_excerpt":"Bilevel optimization is one of the fundamental problems in machine learning and optimization. Recent theoretical developments in bilevel optimization focus on finding the first-order stationary points for nonconvex-strongly-convex cases. In this paper, we analyze algorithms that can escape saddle points in nonconvex-strongly-convex bilevel optimization. Specifically, we show that the perturbed approximate implicit differentiation (AID) with a warm start strategy finds $\\epsilon$-approximate local minimum of bilevel optimization in $\\tilde{O}(\\epsilon^{-2})$ iterations with high probability. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03684","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/2202.03684/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-05T06:08:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pyo0ICrHwqBK6GWRpqi9s+GeY6C2Hu/sHoQDnATgUD+wtJ5uY8fjxwZ8sumUEHGkffmVR0G40vkGBJF0cSHIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:01:42.012255Z"},"content_sha256":"5bd86400aaf0a061958c9318c0708b281bd5dcb0e15f098fcf719cf05f300062","schema_version":"1.0","event_id":"sha256:5bd86400aaf0a061958c9318c0708b281bd5dcb0e15f098fcf719cf05f300062"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/bundle.json","state_url":"https://pith.science/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/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-04T01:01:42Z","links":{"resolver":"https://pith.science/pith/AGEEYAVIV5UEYAWM3LPSAONOBL","bundle":"https://pith.science/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/bundle.json","state":"https://pith.science/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGEEYAVIV5UEYAWM3LPSAONOBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AGEEYAVIV5UEYAWM3LPSAONOBL","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":"f61709423aff09c35b4f4fc074a191edbe8a66d0cb0f7d41d19e942686d547ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-08T07:10:06Z","title_canon_sha256":"2acb6877c61d753b68cdb40b6fe3b9affc617461c1f55535170949bd8181ce43"},"schema_version":"1.0","source":{"id":"2202.03684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03684","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03684v2","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03684","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_12","alias_value":"AGEEYAVIV5UE","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_16","alias_value":"AGEEYAVIV5UEYAWM","created_at":"2026-07-05T06:08:50Z"},{"alias_kind":"pith_short_8","alias_value":"AGEEYAVI","created_at":"2026-07-05T06:08:50Z"}],"graph_snapshots":[{"event_id":"sha256:5bd86400aaf0a061958c9318c0708b281bd5dcb0e15f098fcf719cf05f300062","target":"graph","created_at":"2026-07-05T06:08:50Z","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/2202.03684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization is one of the fundamental problems in machine learning and optimization. Recent theoretical developments in bilevel optimization focus on finding the first-order stationary points for nonconvex-strongly-convex cases. In this paper, we analyze algorithms that can escape saddle points in nonconvex-strongly-convex bilevel optimization. Specifically, we show that the perturbed approximate implicit differentiation (AID) with a warm start strategy finds $\\epsilon$-approximate local minimum of bilevel optimization in $\\tilde{O}(\\epsilon^{-2})$ iterations with high probability. Mo","authors_text":"Kaiyi Ji, Lifeng Lai, Minhui Huang, Shiqian Ma, Xuxing Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-08T07:10:06Z","title":"Efficiently Escaping Saddle Points in Bilevel Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03684","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:6e12faab4393f3fc17ca9430403ed0f860ce4e236473d2b0f8aecb97af6187d8","target":"record","created_at":"2026-07-05T06:08:50Z","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":"f61709423aff09c35b4f4fc074a191edbe8a66d0cb0f7d41d19e942686d547ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-08T07:10:06Z","title_canon_sha256":"2acb6877c61d753b68cdb40b6fe3b9affc617461c1f55535170949bd8181ce43"},"schema_version":"1.0","source":{"id":"2202.03684","kind":"arxiv","version":2}},"canonical_sha256":"01884c02a8af684c02ccdadf2039ae0acd3fc9924825dbf39406f45f9e20fdf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01884c02a8af684c02ccdadf2039ae0acd3fc9924825dbf39406f45f9e20fdf2","first_computed_at":"2026-07-05T06:08:50.995047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:08:50.995047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"013DQGcCDJ3X3ED6uqm97shjHha2JgoFEsG1AgW+TUuiz7a9L5Efs55G/vpczwSczI6xxkByQTLxzr8QHQ5ODQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:08:50.995476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.03684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e12faab4393f3fc17ca9430403ed0f860ce4e236473d2b0f8aecb97af6187d8","sha256:5bd86400aaf0a061958c9318c0708b281bd5dcb0e15f098fcf719cf05f300062"],"state_sha256":"314dfbef991a3c2bbdda8c207717d35e6c1bbcd208b830d754bbf2577e8b3986"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeSvqx3E8x59YF/gPRAJDCRmQQcpyg2JWkiuRwOFGG9WA9/Zarfc9scABO0UR8cGotMuP9+L9zRu2tgaALj2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:01:42.016809Z","bundle_sha256":"aa908f3dc564640cc5e39a6b63549186208ebef80cd1825b093701e87612eedd"}}