{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YA2JVGQVJ7YLRUJKAMZF5R4ZTW","short_pith_number":"pith:YA2JVGQV","schema_version":"1.0","canonical_sha256":"c0349a9a154ff0b8d12a03325ec7999dbd8e9970c299ede851cc346e64192fc5","source":{"kind":"arxiv","id":"2205.14224","version":3},"attestation_state":"computed","paper":{"title":"Will Bilevel Optimizers Benefit from Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Lei Ying, Mingrui Liu, Yingbin Liang","submitted_at":"2022-05-27T20:28:52Z","abstract_excerpt":"Bilevel optimization has arisen as a powerful tool for solving a variety of machine learning problems. Two current popular bilevel optimizers AID-BiO and ITD-BiO naturally involve solving one or two sub-problems, and consequently, whether we solve these problems with loops (that take many iterations) or without loops (that take only a few iterations) can significantly affect the overall computational efficiency. Existing studies in the literature cover only some of those implementation choices, and the complexity bounds available are not refined enough to enable rigorous comparison among diffe"},"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":"2205.14224","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-27T20:28:52Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"574d8064c37cafabc30daa4490450b0e002c57b0c68da0d6e72e02bf7193e1ab","abstract_canon_sha256":"3be81522004583ce5949e1f7e469380961f44913ff449b87e98655a43bc0f223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:11.992852Z","signature_b64":"CNXA4Qu5Sbc3H0jAiXurW2k9p1hH8h3Au++i4cBOmByR3NrDOrxFec+tK46h0s7cNY51fRC803VLhuhD0fNXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0349a9a154ff0b8d12a03325ec7999dbd8e9970c299ede851cc346e64192fc5","last_reissued_at":"2026-07-05T04:28:11.992323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:11.992323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Will Bilevel Optimizers Benefit from Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Lei Ying, Mingrui Liu, Yingbin Liang","submitted_at":"2022-05-27T20:28:52Z","abstract_excerpt":"Bilevel optimization has arisen as a powerful tool for solving a variety of machine learning problems. Two current popular bilevel optimizers AID-BiO and ITD-BiO naturally involve solving one or two sub-problems, and consequently, whether we solve these problems with loops (that take many iterations) or without loops (that take only a few iterations) can significantly affect the overall computational efficiency. Existing studies in the literature cover only some of those implementation choices, and the complexity bounds available are not refined enough to enable rigorous comparison among diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14224","kind":"arxiv","version":3},"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.14224/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":"2205.14224","created_at":"2026-07-05T04:28:11.992399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14224v3","created_at":"2026-07-05T04:28:11.992399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14224","created_at":"2026-07-05T04:28:11.992399+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA2JVGQVJ7YL","created_at":"2026-07-05T04:28:11.992399+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA2JVGQVJ7YLRUJK","created_at":"2026-07-05T04:28:11.992399+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA2JVGQV","created_at":"2026-07-05T04:28:11.992399+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/YA2JVGQVJ7YLRUJKAMZF5R4ZTW","json":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW.json","graph_json":"https://pith.science/api/pith-number/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/graph.json","events_json":"https://pith.science/api/pith-number/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/events.json","paper":"https://pith.science/paper/YA2JVGQV"},"agent_actions":{"view_html":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW","download_json":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW.json","view_paper":"https://pith.science/paper/YA2JVGQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14224&json=true","fetch_graph":"https://pith.science/api/pith-number/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/graph.json","fetch_events":"https://pith.science/api/pith-number/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/action/storage_attestation","attest_author":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/action/author_attestation","sign_citation":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/action/citation_signature","submit_replication":"https://pith.science/pith/YA2JVGQVJ7YLRUJKAMZF5R4ZTW/action/replication_record"}},"created_at":"2026-07-05T04:28:11.992399+00:00","updated_at":"2026-07-05T04:28:11.992399+00:00"}