{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:35J52URGGBQX4S6B4DMIRUDU7J","short_pith_number":"pith:35J52URG","schema_version":"1.0","canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","source":{"kind":"arxiv","id":"2412.00659","version":1},"attestation_state":"computed","paper":{"title":"Linear Convergence Analysis of Single-loop Algorithm for Bilevel Optimization via Small-gain Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianhui Li, Jianqi Chen, Junfeng Wu, Shi Pu","submitted_at":"2024-12-01T03:42:17Z","abstract_excerpt":"Bilevel optimization has gained considerable attention due to its broad applicability across various fields. While several studies have investigated the convergence rates in the strongly-convex-strongly-convex (SC-SC) setting, no prior work has proven that a single-loop algorithm can achieve linear convergence. This paper employs a small-gain theorem in {robust control theory} to demonstrate that a single-loop algorithm based on the implicit function theorem attains a linear convergence rate of $\\mathcal{O}(\\rho^{k})$, where $\\rho\\in(0,1)$ is specified in Theorem 3. Specifically, We model the "},"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":"2412.00659","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-01T03:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"3a59223546ba607b6f61f3c8acb81a2c415e51a63028a05bb8715160244006f6","abstract_canon_sha256":"c7e43f32686dc411f9022fdd2c41fdb9c4837c1d8208339e358f170ff2ccd8bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:44.863474Z","signature_b64":"6gkwf34PxLjLSlta4JjO9H//u0f4wW1gL6bRxy36v6KwTaCoqPO8BnJAACEXQr7NGnkjGzZOTqO9wp+V5t9tBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df53dd522630617e4bc1e0d888d074fa4256bb9f902ae488c356dee4552344e9","last_reissued_at":"2026-07-05T09:42:44.863049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:44.863049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence Analysis of Single-loop Algorithm for Bilevel Optimization via Small-gain Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianhui Li, Jianqi Chen, Junfeng Wu, Shi Pu","submitted_at":"2024-12-01T03:42:17Z","abstract_excerpt":"Bilevel optimization has gained considerable attention due to its broad applicability across various fields. While several studies have investigated the convergence rates in the strongly-convex-strongly-convex (SC-SC) setting, no prior work has proven that a single-loop algorithm can achieve linear convergence. This paper employs a small-gain theorem in {robust control theory} to demonstrate that a single-loop algorithm based on the implicit function theorem attains a linear convergence rate of $\\mathcal{O}(\\rho^{k})$, where $\\rho\\in(0,1)$ is specified in Theorem 3. Specifically, We model the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00659","kind":"arxiv","version":1},"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/2412.00659/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":"2412.00659","created_at":"2026-07-05T09:42:44.863103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00659v1","created_at":"2026-07-05T09:42:44.863103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00659","created_at":"2026-07-05T09:42:44.863103+00:00"},{"alias_kind":"pith_short_12","alias_value":"35J52URGGBQX","created_at":"2026-07-05T09:42:44.863103+00:00"},{"alias_kind":"pith_short_16","alias_value":"35J52URGGBQX4S6B","created_at":"2026-07-05T09:42:44.863103+00:00"},{"alias_kind":"pith_short_8","alias_value":"35J52URG","created_at":"2026-07-05T09:42:44.863103+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/35J52URGGBQX4S6B4DMIRUDU7J","json":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J.json","graph_json":"https://pith.science/api/pith-number/35J52URGGBQX4S6B4DMIRUDU7J/graph.json","events_json":"https://pith.science/api/pith-number/35J52URGGBQX4S6B4DMIRUDU7J/events.json","paper":"https://pith.science/paper/35J52URG"},"agent_actions":{"view_html":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J","download_json":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J.json","view_paper":"https://pith.science/paper/35J52URG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00659&json=true","fetch_graph":"https://pith.science/api/pith-number/35J52URGGBQX4S6B4DMIRUDU7J/graph.json","fetch_events":"https://pith.science/api/pith-number/35J52URGGBQX4S6B4DMIRUDU7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/action/storage_attestation","attest_author":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/action/author_attestation","sign_citation":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/action/citation_signature","submit_replication":"https://pith.science/pith/35J52URGGBQX4S6B4DMIRUDU7J/action/replication_record"}},"created_at":"2026-07-05T09:42:44.863103+00:00","updated_at":"2026-07-05T09:42:44.863103+00:00"}