{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5DC5VUBYPEADPFPHX64JUEANOZ","short_pith_number":"pith:5DC5VUBY","schema_version":"1.0","canonical_sha256":"e8c5dad03879003795e7bfb89a100d767f028bee83d64d5d2390ebd35cc5e07c","source":{"kind":"arxiv","id":"2301.01716","version":2},"attestation_state":"computed","paper":{"title":"First-order penalty methods for bilevel optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Sanyou Mei, Zhaosong Lu","submitted_at":"2023-01-04T17:29:04Z","abstract_excerpt":"In this paper we study a class of unconstrained and constrained bilevel optimization problems in which the lower level is a possibly nonsmooth convex optimization problem, while the upper level is a possibly nonconvex optimization problem. We introduce a notion of $\\varepsilon$-KKT solution for them and show that an $\\varepsilon$-KKT solution leads to an $O(\\sqrt{\\varepsilon})$- or $O(\\varepsilon)$-hypergradient based stionary point under suitable assumptions. We also propose first-order penalty methods for finding an $\\varepsilon$-KKT solution of them, whose subproblems turn out to be a struc"},"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":"2301.01716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-04T17:29:04Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"950d4d9efb6b5c68a82cfdf4463be012a88b2b4666eae722df7268d4be912317","abstract_canon_sha256":"190702e046f429415e6dc7ed55682174eff4e97d2164fb5df3695fa1c64723b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:06.569277Z","signature_b64":"3gL2qaO+4dxRhclEhZr9cTtNU3EDmbBcxghz0MgYc4eVs6drgYXI1X6poO7FFaP53qx4cecZ0SOMylY39pEqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c5dad03879003795e7bfb89a100d767f028bee83d64d5d2390ebd35cc5e07c","last_reissued_at":"2026-07-05T07:53:06.568798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:06.568798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-order penalty methods for bilevel optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Sanyou Mei, Zhaosong Lu","submitted_at":"2023-01-04T17:29:04Z","abstract_excerpt":"In this paper we study a class of unconstrained and constrained bilevel optimization problems in which the lower level is a possibly nonsmooth convex optimization problem, while the upper level is a possibly nonconvex optimization problem. We introduce a notion of $\\varepsilon$-KKT solution for them and show that an $\\varepsilon$-KKT solution leads to an $O(\\sqrt{\\varepsilon})$- or $O(\\varepsilon)$-hypergradient based stionary point under suitable assumptions. We also propose first-order penalty methods for finding an $\\varepsilon$-KKT solution of them, whose subproblems turn out to be a struc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01716","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/2301.01716/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":"2301.01716","created_at":"2026-07-05T07:53:06.568856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.01716v2","created_at":"2026-07-05T07:53:06.568856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01716","created_at":"2026-07-05T07:53:06.568856+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DC5VUBYPEAD","created_at":"2026-07-05T07:53:06.568856+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DC5VUBYPEADPFPH","created_at":"2026-07-05T07:53:06.568856+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DC5VUBY","created_at":"2026-07-05T07:53:06.568856+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":78,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20534","citing_title":"On Second-Order Methods for Bilevel Optimization","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ","json":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ.json","graph_json":"https://pith.science/api/pith-number/5DC5VUBYPEADPFPHX64JUEANOZ/graph.json","events_json":"https://pith.science/api/pith-number/5DC5VUBYPEADPFPHX64JUEANOZ/events.json","paper":"https://pith.science/paper/5DC5VUBY"},"agent_actions":{"view_html":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ","download_json":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ.json","view_paper":"https://pith.science/paper/5DC5VUBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.01716&json=true","fetch_graph":"https://pith.science/api/pith-number/5DC5VUBYPEADPFPHX64JUEANOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5DC5VUBYPEADPFPHX64JUEANOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ/action/storage_attestation","attest_author":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ/action/author_attestation","sign_citation":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ/action/citation_signature","submit_replication":"https://pith.science/pith/5DC5VUBYPEADPFPHX64JUEANOZ/action/replication_record"}},"created_at":"2026-07-05T07:53:06.568856+00:00","updated_at":"2026-07-05T07:53:06.568856+00:00"}