{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DNDQBF623SU7DJXBR4GUMBE2NU","short_pith_number":"pith:DNDQBF62","schema_version":"1.0","canonical_sha256":"1b470097dadca9f1a6e18f0d46049a6d2a5eb1f6ccfcbb1f0fa7326fbc3edcd5","source":{"kind":"arxiv","id":"2306.14853","version":5},"attestation_state":"computed","paper":{"title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jingzhao Zhang, Lesi Chen, Yaohua Ma","submitted_at":"2023-06-26T17:07:54Z","abstract_excerpt":"In this work, we consider bilevel optimization when the lower-level problem is strongly convex. Recent works show that with a Hessian-vector product (HVP) oracle, one can provably find an $\\epsilon$-stationary point within ${\\mathcal{O}}(\\epsilon^{-2})$ oracle calls. However, the HVP oracle may be inaccessible or expensive in practice. Kwon et al. (ICML 2023) addressed this issue by proposing a first-order method that can achieve the same goal at a slower rate of $\\tilde{\\mathcal{O}}(\\epsilon^{-3})$. In this paper, we incorporate a two-time-scale update to improve their method to achieve the n"},"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":"2306.14853","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-26T17:07:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"687c5f9aaebfd25c8fb9f2634b2d01dca9f394c59febc66d6885c8040b9de81d","abstract_canon_sha256":"d392dff8e5f42aec7d0863503745a68fb336d2c94721d8bf683d0185ade5882d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:44.501561Z","signature_b64":"P5FywhY4imcvJw3CgupA/OKIWHsJR1EnGBXEaS2nlz9AiVvfcl7c4O4fn+MDAKqEf3qtyYLquTkth3/UaVJLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b470097dadca9f1a6e18f0d46049a6d2a5eb1f6ccfcbb1f0fa7326fbc3edcd5","last_reissued_at":"2026-05-26T02:03:44.500715Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:44.500715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jingzhao Zhang, Lesi Chen, Yaohua Ma","submitted_at":"2023-06-26T17:07:54Z","abstract_excerpt":"In this work, we consider bilevel optimization when the lower-level problem is strongly convex. Recent works show that with a Hessian-vector product (HVP) oracle, one can provably find an $\\epsilon$-stationary point within ${\\mathcal{O}}(\\epsilon^{-2})$ oracle calls. However, the HVP oracle may be inaccessible or expensive in practice. Kwon et al. (ICML 2023) addressed this issue by proposing a first-order method that can achieve the same goal at a slower rate of $\\tilde{\\mathcal{O}}(\\epsilon^{-3})$. In this paper, we incorporate a two-time-scale update to improve their method to achieve the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14853","kind":"arxiv","version":5},"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/2306.14853/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":"2306.14853","created_at":"2026-05-26T02:03:44.500869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.14853v5","created_at":"2026-05-26T02:03:44.500869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14853","created_at":"2026-05-26T02:03:44.500869+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNDQBF623SU7","created_at":"2026-05-26T02:03:44.500869+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNDQBF623SU7DJXB","created_at":"2026-05-26T02:03:44.500869+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNDQBF62","created_at":"2026-05-26T02:03:44.500869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2602.11665","citing_title":"Fully First-Order Algorithms for Online Bilevel Optimization","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06431","citing_title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU","json":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU.json","graph_json":"https://pith.science/api/pith-number/DNDQBF623SU7DJXBR4GUMBE2NU/graph.json","events_json":"https://pith.science/api/pith-number/DNDQBF623SU7DJXBR4GUMBE2NU/events.json","paper":"https://pith.science/paper/DNDQBF62"},"agent_actions":{"view_html":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU","download_json":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU.json","view_paper":"https://pith.science/paper/DNDQBF62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.14853&json=true","fetch_graph":"https://pith.science/api/pith-number/DNDQBF623SU7DJXBR4GUMBE2NU/graph.json","fetch_events":"https://pith.science/api/pith-number/DNDQBF623SU7DJXBR4GUMBE2NU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU/action/storage_attestation","attest_author":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU/action/author_attestation","sign_citation":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU/action/citation_signature","submit_replication":"https://pith.science/pith/DNDQBF623SU7DJXBR4GUMBE2NU/action/replication_record"}},"created_at":"2026-05-26T02:03:44.500869+00:00","updated_at":"2026-05-26T02:03:44.500869+00:00"}