{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SG7BZMYCQBE2ZJMAKIDK5QLKY3","short_pith_number":"pith:SG7BZMYC","schema_version":"1.0","canonical_sha256":"91be1cb3028049aca5805206aec16ac6ef77875fa9737cecdc54cb04ecdaf9d4","source":{"kind":"arxiv","id":"2102.03926","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.03926","created_at":"2026-07-05T03:52:25.694246+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.03926v4","created_at":"2026-07-05T03:52:25.694246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03926","created_at":"2026-07-05T03:52:25.694246+00:00"},{"alias_kind":"pith_short_12","alias_value":"SG7BZMYCQBE2","created_at":"2026-07-05T03:52:25.694246+00:00"},{"alias_kind":"pith_short_16","alias_value":"SG7BZMYCQBE2ZJMA","created_at":"2026-07-05T03:52:25.694246+00:00"},{"alias_kind":"pith_short_8","alias_value":"SG7BZMYC","created_at":"2026-07-05T03:52:25.694246+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04031","citing_title":"Pseudospectral Bounds for Transient Amplification in Coupled Gradient Descent","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3","json":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3.json","graph_json":"https://pith.science/api/pith-number/SG7BZMYCQBE2ZJMAKIDK5QLKY3/graph.json","events_json":"https://pith.science/api/pith-number/SG7BZMYCQBE2ZJMAKIDK5QLKY3/events.json","paper":"https://pith.science/paper/SG7BZMYC"},"agent_actions":{"view_html":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3","download_json":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3.json","view_paper":"https://pith.science/paper/SG7BZMYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.03926&json=true","fetch_graph":"https://pith.science/api/pith-number/SG7BZMYCQBE2ZJMAKIDK5QLKY3/graph.json","fetch_events":"https://pith.science/api/pith-number/SG7BZMYCQBE2ZJMAKIDK5QLKY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/action/storage_attestation","attest_author":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/action/author_attestation","sign_citation":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/action/citation_signature","submit_replication":"https://pith.science/pith/SG7BZMYCQBE2ZJMAKIDK5QLKY3/action/replication_record"}},"created_at":"2026-07-05T03:52:25.694246+00:00","updated_at":"2026-07-05T03:52:25.694246+00:00"}