{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6AHACD5T73GVJIE3NCGEX6XOPQ","short_pith_number":"pith:6AHACD5T","schema_version":"1.0","canonical_sha256":"f00e010fb3fecd54a09b688c4bfaee7c0c158390bd6bd20c65d554e18977f21f","source":{"kind":"arxiv","id":"2106.07991","version":1},"attestation_state":"computed","paper":{"title":"A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"math.OC","authors_text":"Jin Zhang, Risheng Liu, Shangzhi Zeng, Xiaoming Yuan, Xuan Liu","submitted_at":"2021-06-15T09:10:40Z","abstract_excerpt":"Bi-level optimization model is able to capture a wide range of complex learning tasks with practical interest. Due to the witnessed efficiency in solving bi-level programs, gradient-based methods have gained popularity in the machine learning community. In this work, we propose a new gradient-based solution scheme, namely, the Bi-level Value-Function-based Interior-point Method (BVFIM). Following the main idea of the log-barrier interior-point scheme, we penalize the regularized value function of the lower level problem into the upper level objective. By further solving a sequence of different"},"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":"2106.07991","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-15T09:10:40Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"1f5dd9b8f0576acaf74509bf228bcc3f466482879611c9763b59ec7d911b1566","abstract_canon_sha256":"fab71af077979806e6da0787cc9ae5e0d94105dcfa6433a9291627afc31db62b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:36.333607Z","signature_b64":"rQKcbMsrBkWOhTyi9V7Q+fYFuTlBrN/TTx0LWzjTEVp4WXmKSmufYDy+bc1KMPMKtr3sP5S67M3k+iuImRziCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f00e010fb3fecd54a09b688c4bfaee7c0c158390bd6bd20c65d554e18977f21f","last_reissued_at":"2026-07-05T02:49:36.333230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:36.333230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"math.OC","authors_text":"Jin Zhang, Risheng Liu, Shangzhi Zeng, Xiaoming Yuan, Xuan Liu","submitted_at":"2021-06-15T09:10:40Z","abstract_excerpt":"Bi-level optimization model is able to capture a wide range of complex learning tasks with practical interest. Due to the witnessed efficiency in solving bi-level programs, gradient-based methods have gained popularity in the machine learning community. In this work, we propose a new gradient-based solution scheme, namely, the Bi-level Value-Function-based Interior-point Method (BVFIM). Following the main idea of the log-barrier interior-point scheme, we penalize the regularized value function of the lower level problem into the upper level objective. By further solving a sequence of different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07991","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/2106.07991/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":"2106.07991","created_at":"2026-07-05T02:49:36.333294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07991v1","created_at":"2026-07-05T02:49:36.333294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07991","created_at":"2026-07-05T02:49:36.333294+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AHACD5T73GV","created_at":"2026-07-05T02:49:36.333294+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AHACD5T73GVJIE3","created_at":"2026-07-05T02:49:36.333294+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AHACD5T","created_at":"2026-07-05T02:49:36.333294+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/6AHACD5T73GVJIE3NCGEX6XOPQ","json":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ.json","graph_json":"https://pith.science/api/pith-number/6AHACD5T73GVJIE3NCGEX6XOPQ/graph.json","events_json":"https://pith.science/api/pith-number/6AHACD5T73GVJIE3NCGEX6XOPQ/events.json","paper":"https://pith.science/paper/6AHACD5T"},"agent_actions":{"view_html":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ","download_json":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ.json","view_paper":"https://pith.science/paper/6AHACD5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07991&json=true","fetch_graph":"https://pith.science/api/pith-number/6AHACD5T73GVJIE3NCGEX6XOPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6AHACD5T73GVJIE3NCGEX6XOPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ/action/storage_attestation","attest_author":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ/action/author_attestation","sign_citation":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ/action/citation_signature","submit_replication":"https://pith.science/pith/6AHACD5T73GVJIE3NCGEX6XOPQ/action/replication_record"}},"created_at":"2026-07-05T02:49:36.333294+00:00","updated_at":"2026-07-05T02:49:36.333294+00:00"}