{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:B2TLPC5IB5M2FMDU55QUJGAKBE","short_pith_number":"pith:B2TLPC5I","schema_version":"1.0","canonical_sha256":"0ea6b78ba80f59a2b074ef6144980a0930871e1226208a16307a949b83cf74b8","source":{"kind":"arxiv","id":"2305.19442","version":5},"attestation_state":"computed","paper":{"title":"SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Peiyao Xiao, Yifan Yang","submitted_at":"2023-05-30T22:30:30Z","abstract_excerpt":"Federated bilevel optimization (FBO) has shown great potential recently in machine learning and edge computing due to the emerging nested optimization structure in meta-learning, fine-tuning, hyperparameter tuning, etc. However, existing FBO algorithms often involve complicated computations and require multiple sub-loops per iteration, each of which contains a number of communication rounds. In this paper, we propose a simple and flexible FBO framework named SimFBO, which is easy to implement without sub-loops, and includes a generalized server-side aggregation and update for improving communi"},"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":"2305.19442","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-30T22:30:30Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"3be5d47df5bf93ac025fe1d555f9a69d197083ed392150b2b6b3c8f35ced37dc","abstract_canon_sha256":"86ea6d7ff5fe3fd00ebe244f66dcb1a3ff593747c00612c2a79522d9748544cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:28.378008Z","signature_b64":"XL2GIC5tJD+aQ+ewMcaJiKOH1zHAtsuFUg9ZGk8lHeM+y6FxevYWe518ZC+N1XdxPxl/05uumYLguPBo6R8qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ea6b78ba80f59a2b074ef6144980a0930871e1226208a16307a949b83cf74b8","last_reissued_at":"2026-07-05T07:28:28.377569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:28.377569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Peiyao Xiao, Yifan Yang","submitted_at":"2023-05-30T22:30:30Z","abstract_excerpt":"Federated bilevel optimization (FBO) has shown great potential recently in machine learning and edge computing due to the emerging nested optimization structure in meta-learning, fine-tuning, hyperparameter tuning, etc. However, existing FBO algorithms often involve complicated computations and require multiple sub-loops per iteration, each of which contains a number of communication rounds. In this paper, we propose a simple and flexible FBO framework named SimFBO, which is easy to implement without sub-loops, and includes a generalized server-side aggregation and update for improving communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.19442","kind":"arxiv","version":5},"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/2305.19442/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":"2305.19442","created_at":"2026-07-05T07:28:28.377622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.19442v5","created_at":"2026-07-05T07:28:28.377622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.19442","created_at":"2026-07-05T07:28:28.377622+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2TLPC5IB5M2","created_at":"2026-07-05T07:28:28.377622+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2TLPC5IB5M2FMDU","created_at":"2026-07-05T07:28:28.377622+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2TLPC5I","created_at":"2026-07-05T07:28:28.377622+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/B2TLPC5IB5M2FMDU55QUJGAKBE","json":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE.json","graph_json":"https://pith.science/api/pith-number/B2TLPC5IB5M2FMDU55QUJGAKBE/graph.json","events_json":"https://pith.science/api/pith-number/B2TLPC5IB5M2FMDU55QUJGAKBE/events.json","paper":"https://pith.science/paper/B2TLPC5I"},"agent_actions":{"view_html":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE","download_json":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE.json","view_paper":"https://pith.science/paper/B2TLPC5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.19442&json=true","fetch_graph":"https://pith.science/api/pith-number/B2TLPC5IB5M2FMDU55QUJGAKBE/graph.json","fetch_events":"https://pith.science/api/pith-number/B2TLPC5IB5M2FMDU55QUJGAKBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE/action/storage_attestation","attest_author":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE/action/author_attestation","sign_citation":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE/action/citation_signature","submit_replication":"https://pith.science/pith/B2TLPC5IB5M2FMDU55QUJGAKBE/action/replication_record"}},"created_at":"2026-07-05T07:28:28.377622+00:00","updated_at":"2026-07-05T07:28:28.377622+00:00"}