{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EDRB3JPBPIYKWJHCC5EE5LOJIJ","short_pith_number":"pith:EDRB3JPB","schema_version":"1.0","canonical_sha256":"20e21da5e17a30ab24e217484eadc9427c7adce783add390eadc0a427247ad59","source":{"kind":"arxiv","id":"2106.04692","version":2},"attestation_state":"computed","paper":{"title":"Provably Faster 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":"Junjie Yang, Kaiyi Ji, Yingbin Liang","submitted_at":"2021-06-08T21:05:30Z","abstract_excerpt":"Bilevel optimization has been widely applied in many important machine learning applications such as hyperparameter optimization and meta-learning. Recently, several momentum-based algorithms have been proposed to solve bilevel optimization problems faster. However, those momentum-based algorithms do not achieve provably better computational complexity than $\\mathcal{\\widetilde O}(\\epsilon^{-2})$ of the SGD-based algorithm. In this paper, we propose two new algorithms for bilevel optimization, where the first algorithm adopts momentum-based recursive iterations, and the second algorithm adopts"},"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":"2106.04692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T21:05:30Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"562a1b3eb9813ded44ee94acd22c0c804f9e1053236b4140f03bd3af16001396","abstract_canon_sha256":"8d383a33187f66f0945f5ffea05aa891884791a4022b37c5709d98fb64a6a1e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:25.498350Z","signature_b64":"DyBXmlOrvHHMbkL0bU2SKLE9YaM2G7D0RLwlUbur1UZs6MqoWYxLH77/fZWX7GJsCXrx31XBqDAs7JCKNfC1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e21da5e17a30ab24e217484eadc9427c7adce783add390eadc0a427247ad59","last_reissued_at":"2026-07-05T03:41:25.497841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:25.497841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Faster 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":"Junjie Yang, Kaiyi Ji, Yingbin Liang","submitted_at":"2021-06-08T21:05:30Z","abstract_excerpt":"Bilevel optimization has been widely applied in many important machine learning applications such as hyperparameter optimization and meta-learning. Recently, several momentum-based algorithms have been proposed to solve bilevel optimization problems faster. However, those momentum-based algorithms do not achieve provably better computational complexity than $\\mathcal{\\widetilde O}(\\epsilon^{-2})$ of the SGD-based algorithm. In this paper, we propose two new algorithms for bilevel optimization, where the first algorithm adopts momentum-based recursive iterations, and the second algorithm adopts"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04692","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/2106.04692/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":"2106.04692","created_at":"2026-07-05T03:41:25.497897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04692v2","created_at":"2026-07-05T03:41:25.497897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04692","created_at":"2026-07-05T03:41:25.497897+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDRB3JPBPIYK","created_at":"2026-07-05T03:41:25.497897+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDRB3JPBPIYKWJHC","created_at":"2026-07-05T03:41:25.497897+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDRB3JPB","created_at":"2026-07-05T03:41:25.497897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ","json":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ.json","graph_json":"https://pith.science/api/pith-number/EDRB3JPBPIYKWJHCC5EE5LOJIJ/graph.json","events_json":"https://pith.science/api/pith-number/EDRB3JPBPIYKWJHCC5EE5LOJIJ/events.json","paper":"https://pith.science/paper/EDRB3JPB"},"agent_actions":{"view_html":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ","download_json":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ.json","view_paper":"https://pith.science/paper/EDRB3JPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04692&json=true","fetch_graph":"https://pith.science/api/pith-number/EDRB3JPBPIYKWJHCC5EE5LOJIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EDRB3JPBPIYKWJHCC5EE5LOJIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ/action/storage_attestation","attest_author":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ/action/author_attestation","sign_citation":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ/action/citation_signature","submit_replication":"https://pith.science/pith/EDRB3JPBPIYKWJHCC5EE5LOJIJ/action/replication_record"}},"created_at":"2026-07-05T03:41:25.497897+00:00","updated_at":"2026-07-05T03:41:25.497897+00:00"}