{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T6GKWIBTYT6X3JYIMBZJ77IGWR","short_pith_number":"pith:T6GKWIBT","schema_version":"1.0","canonical_sha256":"9f8cab2033c4fd7da70860729ffd06b467efde54e6688f407891002695d954c2","source":{"kind":"arxiv","id":"2409.05539","version":1},"attestation_state":"computed","paper":{"title":"CoBo: Collaborative Learning via Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Diba Hashemi, Lie He, Martin Jaggi","submitted_at":"2024-09-09T11:59:42Z","abstract_excerpt":"Collaborative learning is an important tool to train multiple clients more effectively by enabling communication among clients. Identifying helpful clients, however, presents challenging and often introduces significant overhead. In this paper, we model client-selection and model-training as two interconnected optimization problems, proposing a novel bilevel optimization problem for collaborative learning. We introduce CoBo, a scalable and elastic, SGD-type alternating optimization algorithm that efficiently addresses these problem with theoretical convergence guarantees. Empirically, CoBo ach"},"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":"2409.05539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-09T11:59:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7b22436aacdf9621fe5cf7bf44fc671f0046006640314d18d86c8a1cb1929461","abstract_canon_sha256":"83c8ff33ef4df7d1a465ce8f0ea96566c298c375b10aa7a1540d6c55c296a8b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:50.820055Z","signature_b64":"o/kZHoq3rcB7rFPWHxs931uKz04zNff1XHktegbhJSrQ6ZGH380R+GMMsTxng7okomA8wdayCDPgNqIxgEEXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f8cab2033c4fd7da70860729ffd06b467efde54e6688f407891002695d954c2","last_reissued_at":"2026-07-05T09:04:50.819636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:50.819636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoBo: Collaborative Learning via Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Diba Hashemi, Lie He, Martin Jaggi","submitted_at":"2024-09-09T11:59:42Z","abstract_excerpt":"Collaborative learning is an important tool to train multiple clients more effectively by enabling communication among clients. Identifying helpful clients, however, presents challenging and often introduces significant overhead. In this paper, we model client-selection and model-training as two interconnected optimization problems, proposing a novel bilevel optimization problem for collaborative learning. We introduce CoBo, a scalable and elastic, SGD-type alternating optimization algorithm that efficiently addresses these problem with theoretical convergence guarantees. Empirically, CoBo ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05539","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/2409.05539/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":"2409.05539","created_at":"2026-07-05T09:04:50.819688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05539v1","created_at":"2026-07-05T09:04:50.819688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05539","created_at":"2026-07-05T09:04:50.819688+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6GKWIBTYT6X","created_at":"2026-07-05T09:04:50.819688+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6GKWIBTYT6X3JYI","created_at":"2026-07-05T09:04:50.819688+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6GKWIBT","created_at":"2026-07-05T09:04:50.819688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07505","citing_title":"Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR","json":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR.json","graph_json":"https://pith.science/api/pith-number/T6GKWIBTYT6X3JYIMBZJ77IGWR/graph.json","events_json":"https://pith.science/api/pith-number/T6GKWIBTYT6X3JYIMBZJ77IGWR/events.json","paper":"https://pith.science/paper/T6GKWIBT"},"agent_actions":{"view_html":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR","download_json":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR.json","view_paper":"https://pith.science/paper/T6GKWIBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05539&json=true","fetch_graph":"https://pith.science/api/pith-number/T6GKWIBTYT6X3JYIMBZJ77IGWR/graph.json","fetch_events":"https://pith.science/api/pith-number/T6GKWIBTYT6X3JYIMBZJ77IGWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR/action/storage_attestation","attest_author":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR/action/author_attestation","sign_citation":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR/action/citation_signature","submit_replication":"https://pith.science/pith/T6GKWIBTYT6X3JYIMBZJ77IGWR/action/replication_record"}},"created_at":"2026-07-05T09:04:50.819688+00:00","updated_at":"2026-07-05T09:04:50.819688+00:00"}