{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YO234LLMMCCXJUG2ZJF45VL775","short_pith_number":"pith:YO234LLM","schema_version":"1.0","canonical_sha256":"c3b5be2d6c608574d0daca4bced57fff44f53f1091331e2bc39cc7bfbc332fe5","source":{"kind":"arxiv","id":"2411.16081","version":1},"attestation_state":"computed","paper":{"title":"Exploring the Generalization Capabilities of AID-based Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Congliang Chen, Li Shen, Peilin Zhao, Wei Liu, Zhiqiang Xu, Zhi-Quan Luo","submitted_at":"2024-11-25T04:22:17Z","abstract_excerpt":"Bi-level optimization has achieved considerable success in contemporary machine learning applications, especially for given proper hyperparameters. However, due to the two-level optimization structure, commonly, researchers focus on two types of bi-level optimization methods: approximate implicit differentiation (AID)-based and iterative differentiation (ITD)-based approaches. ITD-based methods can be readily transformed into single-level optimization problems, facilitating the study of their generalization capabilities. In contrast, AID-based methods cannot be easily transformed similarly but"},"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":"2411.16081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-25T04:22:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3f37db8aedb1c6f7f7a5aa24a5bbdea7c88c8c630ae6ce6f9108247a3d3a5269","abstract_canon_sha256":"1184520e43cfd2a746abb38435cfe88737540dbefe35a34bc61663a2617443eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:03.638877Z","signature_b64":"C2RZ6iYfoknkqIRFoS9RvHG1c2QIgAr3Q1BA1fQdbzh6DNI6SyDygNlvEnutyXhid01rMtxTXazvEJHoSBO1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3b5be2d6c608574d0daca4bced57fff44f53f1091331e2bc39cc7bfbc332fe5","last_reissued_at":"2026-07-05T09:40:03.638385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:03.638385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Generalization Capabilities of AID-based Bi-level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Congliang Chen, Li Shen, Peilin Zhao, Wei Liu, Zhiqiang Xu, Zhi-Quan Luo","submitted_at":"2024-11-25T04:22:17Z","abstract_excerpt":"Bi-level optimization has achieved considerable success in contemporary machine learning applications, especially for given proper hyperparameters. However, due to the two-level optimization structure, commonly, researchers focus on two types of bi-level optimization methods: approximate implicit differentiation (AID)-based and iterative differentiation (ITD)-based approaches. ITD-based methods can be readily transformed into single-level optimization problems, facilitating the study of their generalization capabilities. In contrast, AID-based methods cannot be easily transformed similarly but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16081","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/2411.16081/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":"2411.16081","created_at":"2026-07-05T09:40:03.638442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16081v1","created_at":"2026-07-05T09:40:03.638442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16081","created_at":"2026-07-05T09:40:03.638442+00:00"},{"alias_kind":"pith_short_12","alias_value":"YO234LLMMCCX","created_at":"2026-07-05T09:40:03.638442+00:00"},{"alias_kind":"pith_short_16","alias_value":"YO234LLMMCCXJUG2","created_at":"2026-07-05T09:40:03.638442+00:00"},{"alias_kind":"pith_short_8","alias_value":"YO234LLM","created_at":"2026-07-05T09:40:03.638442+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20115","citing_title":"On the Stability and Generalization of First-order Bilevel Minimax Optimization","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775","json":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775.json","graph_json":"https://pith.science/api/pith-number/YO234LLMMCCXJUG2ZJF45VL775/graph.json","events_json":"https://pith.science/api/pith-number/YO234LLMMCCXJUG2ZJF45VL775/events.json","paper":"https://pith.science/paper/YO234LLM"},"agent_actions":{"view_html":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775","download_json":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775.json","view_paper":"https://pith.science/paper/YO234LLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16081&json=true","fetch_graph":"https://pith.science/api/pith-number/YO234LLMMCCXJUG2ZJF45VL775/graph.json","fetch_events":"https://pith.science/api/pith-number/YO234LLMMCCXJUG2ZJF45VL775/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775/action/storage_attestation","attest_author":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775/action/author_attestation","sign_citation":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775/action/citation_signature","submit_replication":"https://pith.science/pith/YO234LLMMCCXJUG2ZJF45VL775/action/replication_record"}},"created_at":"2026-07-05T09:40:03.638442+00:00","updated_at":"2026-07-05T09:40:03.638442+00:00"}