Pith. sign in

REVIEW 2 cited by

CoBo: Collaborative Learning via Bilevel Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.05539 v1 pith:T6GKWIBT submitted 2024-09-09 cs.LG cs.DC

classification cs.LGcs.DC
keywords clientsoptimizationcobocollaborativelearningbilevelproblemaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 achieves superior performance, surpassing popular personalization algorithms by 9.3% in accuracy on a task with high heterogeneity, involving datasets distributed among 80 clients.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach

    cs.LG 2025-08 reject novelty 6.0 of 10

    DPMixSGD injects calibrated Gaussian noise into local gradient estimates to make decentralized nonconvex-strongly-concave min-max optimization differentially private, while claiming to preserve the STORM convergence rate.

  2. Adaptive collaboration for online personalized distributed learning with heterogeneous clients

    stat.ML 2025-07 conditional novelty 6.0 of 10

    An adaptive gradient-similarity criterion dynamically selects collaboration partners in personalized federated learning, provably recovering the oracle-optimal sample complexity of All-for-one without knowing client h...

Pith tools