{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SG7BZMYCQBE2ZJMAKIDK5QLKY3","short_pith_number":"pith:SG7BZMYC","canonical_record":{"source":{"id":"2102.03926","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-07T21:46:29Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"c9d54277dc35b37c3e29c15972d4ca5b068d4596f139ee6a00525ac66b1bd221","abstract_canon_sha256":"0bea7d3a5c7023a212b819cf13874958fbb8effdea3e3b1092a6c1dd68c67fbb"},"schema_version":"1.0"},"canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","source":{"kind":"arxiv","id":"2102.03926","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03926","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03926v4","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03926","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"SG7BZMYCQBE2","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"SG7BZMYCQBE2ZJMA","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"SG7BZMYC","created_at":"2026-07-05T03:52:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SG7BZMYCQBE2ZJMAKIDK5QLKY3","target":"record","payload":{"canonical_record":{"source":{"id":"2102.03926","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-07T21:46:29Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"c9d54277dc35b37c3e29c15972d4ca5b068d4596f139ee6a00525ac66b1bd221","abstract_canon_sha256":"0bea7d3a5c7023a212b819cf13874958fbb8effdea3e3b1092a6c1dd68c67fbb"},"schema_version":"1.0"},"canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:25.694710Z","signature_b64":"rIxVhS0Ak8lzGTUVEnTLiPbxp0L4UcbgWZJemh4UEEpVslXan3Ejb+qAuOqgH/GCN8kR7a/UjKk/9SFBf06KAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","last_reissued_at":"2026-07-05T03:52:25.694180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:25.694180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.03926","source_version":4,"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-05T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6CeuNd0wyG7wuR6DOMF8VNUwQMkI3LxL9Z10jrnZ9Xsks4CsAvvFN/fxjeaAZlNI416gJoltG7z5IhIwjLdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:05:06.942839Z"},"content_sha256":"db973b031080eb5bf91d37c5a0523cdd5217f9e893eac0515d06fbc09f6f5414","schema_version":"1.0","event_id":"sha256:db973b031080eb5bf91d37c5a0523cdd5217f9e893eac0515d06fbc09f6f5414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SG7BZMYCQBE2ZJMAKIDK5QLKY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Yingbin Liang","submitted_at":"2021-02-07T21:46:29Z","abstract_excerpt":"Bilevel optimization has recently attracted growing interests due to its wide applications in modern machine learning problems. Although recent studies have characterized the convergence rate for several such popular algorithms, it is still unclear how much further these convergence rates can be improved. In this paper, we address this fundamental question from two perspectives. First, we provide the first-known lower complexity bounds of $\\widetilde{\\Omega}(\\frac{1}{\\sqrt{\\mu_x}\\mu_y})$ and $\\widetilde \\Omega\\big(\\frac{1}{\\sqrt{\\epsilon}}\\min\\{\\frac{1}{\\mu_y},\\frac{1}{\\sqrt{\\epsilon^{3}}}\\}\\b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03926","kind":"arxiv","version":4},"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/2102.03926/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-05T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wfkk4X+sZxlOAdGLUUMd6SR2kih3mWcoY+Hd9jAq02CLCSCJ2geQTxC5NNIIqJorUCpxMzeoL9RHM+Q75zunAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:05:06.943731Z"},"content_sha256":"075e09f6de9d366b8165736dcbea8d65b257c9375f45976dcd4c97d250eca3be","schema_version":"1.0","event_id":"sha256:075e09f6de9d366b8165736dcbea8d65b257c9375f45976dcd4c97d250eca3be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/bundle.json","state_url":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/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-04T12:05:06Z","links":{"resolver":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3","bundle":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/bundle.json","state":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SG7BZMYCQBE2ZJMAKIDK5QLKY3","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":"0bea7d3a5c7023a212b819cf13874958fbb8effdea3e3b1092a6c1dd68c67fbb","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-07T21:46:29Z","title_canon_sha256":"c9d54277dc35b37c3e29c15972d4ca5b068d4596f139ee6a00525ac66b1bd221"},"schema_version":"1.0","source":{"id":"2102.03926","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03926","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03926v4","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03926","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"SG7BZMYCQBE2","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"SG7BZMYCQBE2ZJMA","created_at":"2026-07-05T03:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"SG7BZMYC","created_at":"2026-07-05T03:52:25Z"}],"graph_snapshots":[{"event_id":"sha256:075e09f6de9d366b8165736dcbea8d65b257c9375f45976dcd4c97d250eca3be","target":"graph","created_at":"2026-07-05T03:52:25Z","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/2102.03926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization has recently attracted growing interests due to its wide applications in modern machine learning problems. Although recent studies have characterized the convergence rate for several such popular algorithms, it is still unclear how much further these convergence rates can be improved. In this paper, we address this fundamental question from two perspectives. First, we provide the first-known lower complexity bounds of $\\widetilde{\\Omega}(\\frac{1}{\\sqrt{\\mu_x}\\mu_y})$ and $\\widetilde \\Omega\\big(\\frac{1}{\\sqrt{\\epsilon}}\\min\\{\\frac{1}{\\mu_y},\\frac{1}{\\sqrt{\\epsilon^{3}}}\\}\\b","authors_text":"Kaiyi Ji, Yingbin Liang","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-07T21:46:29Z","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03926","kind":"arxiv","version":4},"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:db973b031080eb5bf91d37c5a0523cdd5217f9e893eac0515d06fbc09f6f5414","target":"record","created_at":"2026-07-05T03:52:25Z","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":"0bea7d3a5c7023a212b819cf13874958fbb8effdea3e3b1092a6c1dd68c67fbb","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-07T21:46:29Z","title_canon_sha256":"c9d54277dc35b37c3e29c15972d4ca5b068d4596f139ee6a00525ac66b1bd221"},"schema_version":"1.0","source":{"id":"2102.03926","kind":"arxiv","version":4}},"canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","first_computed_at":"2026-07-05T03:52:25.694180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:25.694180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rIxVhS0Ak8lzGTUVEnTLiPbxp0L4UcbgWZJemh4UEEpVslXan3Ejb+qAuOqgH/GCN8kR7a/UjKk/9SFBf06KAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:25.694710Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.03926","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db973b031080eb5bf91d37c5a0523cdd5217f9e893eac0515d06fbc09f6f5414","sha256:075e09f6de9d366b8165736dcbea8d65b257c9375f45976dcd4c97d250eca3be"],"state_sha256":"58f7fd5db968191e4464ff5262ed26e66b124f86c199126de544d080b3884d86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ar6XPD8IPCM8Ik1GprpPQ0KrrwGO3ushcMcSd7ev3K78e+4DW2/Nu3Iyw47+3n18R4NfWNjBwnegFrP1N2iqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:05:06.950393Z","bundle_sha256":"980f9105396d20ca5418e999b4b5f63cff3ec663909a18a7e50fc22d48d5d044"}}