{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QXR3XDEVEOJDTNUY6HYVALJQUL","short_pith_number":"pith:QXR3XDEV","schema_version":"1.0","canonical_sha256":"85e3bb8c95239239b698f1f1502d30a2c9a2639ab109e906190c3e8b30c5309d","source":{"kind":"arxiv","id":"2401.16164","version":1},"attestation_state":"computed","paper":{"title":"Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Chengming Yu, Jin Zhang, Shangzhi Zeng, Wei Yao","submitted_at":"2024-01-29T13:50:56Z","abstract_excerpt":"This paper presents a new approach and algorithm for solving a class of constrained Bi-Level Optimization (BLO) problems in which the lower-level problem involves constraints coupling both upper-level and lower-level variables. Such problems have recently gained significant attention due to their broad applicability in machine learning. However, conventional gradient-based methods unavoidably rely on computationally intensive calculations related to the Hessian matrix. To address this challenge, we begin by devising a smooth proximal Lagrangian value function to handle the constrained lower-le"},"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":"2401.16164","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-01-29T13:50:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"46beaf4a08e95f20f834b930f47a7b23860a770494aa4d49bdda867953a29f1c","abstract_canon_sha256":"790e109150cd030455035e846b4cb77321229e8d3a4d51ea1f8093d763a317f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:45.038784Z","signature_b64":"HxTdF8lz5OXJ9NH9y5Cx2bdj3djaoAkmK+H6ryx+by9ZFgC2DH4ocJ0/5GOT8uaoAtXsPhdRBMxEX3OaHnwADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85e3bb8c95239239b698f1f1502d30a2c9a2639ab109e906190c3e8b30c5309d","last_reissued_at":"2026-07-05T07:38:45.038380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:45.038380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Chengming Yu, Jin Zhang, Shangzhi Zeng, Wei Yao","submitted_at":"2024-01-29T13:50:56Z","abstract_excerpt":"This paper presents a new approach and algorithm for solving a class of constrained Bi-Level Optimization (BLO) problems in which the lower-level problem involves constraints coupling both upper-level and lower-level variables. Such problems have recently gained significant attention due to their broad applicability in machine learning. However, conventional gradient-based methods unavoidably rely on computationally intensive calculations related to the Hessian matrix. To address this challenge, we begin by devising a smooth proximal Lagrangian value function to handle the constrained lower-le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16164","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/2401.16164/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":"2401.16164","created_at":"2026-07-05T07:38:45.038437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.16164v1","created_at":"2026-07-05T07:38:45.038437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16164","created_at":"2026-07-05T07:38:45.038437+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXR3XDEVEOJD","created_at":"2026-07-05T07:38:45.038437+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXR3XDEVEOJDTNUY","created_at":"2026-07-05T07:38:45.038437+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXR3XDEV","created_at":"2026-07-05T07:38:45.038437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21153","citing_title":"DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06431","citing_title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL","json":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL.json","graph_json":"https://pith.science/api/pith-number/QXR3XDEVEOJDTNUY6HYVALJQUL/graph.json","events_json":"https://pith.science/api/pith-number/QXR3XDEVEOJDTNUY6HYVALJQUL/events.json","paper":"https://pith.science/paper/QXR3XDEV"},"agent_actions":{"view_html":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL","download_json":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL.json","view_paper":"https://pith.science/paper/QXR3XDEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.16164&json=true","fetch_graph":"https://pith.science/api/pith-number/QXR3XDEVEOJDTNUY6HYVALJQUL/graph.json","fetch_events":"https://pith.science/api/pith-number/QXR3XDEVEOJDTNUY6HYVALJQUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL/action/storage_attestation","attest_author":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL/action/author_attestation","sign_citation":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL/action/citation_signature","submit_replication":"https://pith.science/pith/QXR3XDEVEOJDTNUY6HYVALJQUL/action/replication_record"}},"created_at":"2026-07-05T07:38:45.038437+00:00","updated_at":"2026-07-05T07:38:45.038437+00:00"}