{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JVKPFXD3TJWOERRWP6VMWMHAHO","short_pith_number":"pith:JVKPFXD3","schema_version":"1.0","canonical_sha256":"4d54f2dc7b9a6ce246367faacb30e03b945b465330756fcf7094b85e88a04461","source":{"kind":"arxiv","id":"2306.16761","version":2},"attestation_state":"computed","paper":{"title":"Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haian Yin, Jane J. Ye, Jin Zhang, Lucy L. Gao, Shangzhi Zeng","submitted_at":"2023-06-29T07:57:47Z","abstract_excerpt":"Bilevel programming has emerged as a valuable tool for hyperparameter selection, a central concern in machine learning. In a recent study by Ye et al. (2023), a value function-based difference of convex algorithm was introduced to address bilevel programs. This approach proves particularly powerful when dealing with scenarios where the lower-level problem exhibits convexity in both the upper-level and lower-level variables. Examples of such scenarios include support vector machines and $\\ell_1$ and $\\ell_2$ regularized regression. In this paper, we significantly expand the range of application"},"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.16761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-29T07:57:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"30175ffa59cb5c7c2cfb48880e12a878073432eaf29d2f41e354e8850743f578","abstract_canon_sha256":"16d83bb69b865cfbd5edc72b722968e78bdfbc2798006e9a9884304d38557682"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:38.185239Z","signature_b64":"sV3pigQcCEZBkk4kVM9Unzy1rHSBSZiuUuD6uAyXwLDHUFeaO16O8LDsGEHvCs427n7xNZh8VGat7OqHv0/IBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d54f2dc7b9a6ce246367faacb30e03b945b465330756fcf7094b85e88a04461","last_reissued_at":"2026-07-05T07:35:38.184856Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:38.184856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haian Yin, Jane J. Ye, Jin Zhang, Lucy L. Gao, Shangzhi Zeng","submitted_at":"2023-06-29T07:57:47Z","abstract_excerpt":"Bilevel programming has emerged as a valuable tool for hyperparameter selection, a central concern in machine learning. In a recent study by Ye et al. (2023), a value function-based difference of convex algorithm was introduced to address bilevel programs. This approach proves particularly powerful when dealing with scenarios where the lower-level problem exhibits convexity in both the upper-level and lower-level variables. Examples of such scenarios include support vector machines and $\\ell_1$ and $\\ell_2$ regularized regression. In this paper, we significantly expand the range of application"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16761","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/2306.16761/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.16761","created_at":"2026-07-05T07:35:38.184911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16761v2","created_at":"2026-07-05T07:35:38.184911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16761","created_at":"2026-07-05T07:35:38.184911+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVKPFXD3TJWO","created_at":"2026-07-05T07:35:38.184911+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVKPFXD3TJWOERRW","created_at":"2026-07-05T07:35:38.184911+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVKPFXD3","created_at":"2026-07-05T07:35:38.184911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.18929","citing_title":"Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09209","citing_title":"Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets","ref_index":186,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO","json":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO.json","graph_json":"https://pith.science/api/pith-number/JVKPFXD3TJWOERRWP6VMWMHAHO/graph.json","events_json":"https://pith.science/api/pith-number/JVKPFXD3TJWOERRWP6VMWMHAHO/events.json","paper":"https://pith.science/paper/JVKPFXD3"},"agent_actions":{"view_html":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO","download_json":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO.json","view_paper":"https://pith.science/paper/JVKPFXD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16761&json=true","fetch_graph":"https://pith.science/api/pith-number/JVKPFXD3TJWOERRWP6VMWMHAHO/graph.json","fetch_events":"https://pith.science/api/pith-number/JVKPFXD3TJWOERRWP6VMWMHAHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO/action/storage_attestation","attest_author":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO/action/author_attestation","sign_citation":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO/action/citation_signature","submit_replication":"https://pith.science/pith/JVKPFXD3TJWOERRWP6VMWMHAHO/action/replication_record"}},"created_at":"2026-07-05T07:35:38.184911+00:00","updated_at":"2026-07-05T07:35:38.184911+00:00"}