Pith. sign in

REVIEW 6 cited by

Cronus: Robust and Heterogeneous Collaborative Learning with Black-Box Knowledge Transfer

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 1912.11279 v1 pith:KM5PX5GO submitted 2019-12-24 stat.ML cs.CRcs.LG

Cronus: Robust and Heterogeneous Collaborative Learning with Black-Box Knowledge Transfer

classification stat.ML cs.CRcs.LG
keywords learningmodelsattackscronusfederatedinformationcollaborativelocal
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Collaborative (federated) learning enables multiple parties to train a model without sharing their private data, but through repeated sharing of the parameters of their local models. Despite its advantages, this approach has many known privacy and security weaknesses and performance overhead, in addition to being limited only to models with homogeneous architectures. Shared parameters leak a significant amount of information about the local (and supposedly private) datasets. Besides, federated learning is severely vulnerable to poisoning attacks, where some participants can adversarially influence the aggregate parameters. Large models, with high dimensional parameter vectors, are in particular highly susceptible to privacy and security attacks: curse of dimensionality in federated learning. We argue that sharing parameters is the most naive way of information exchange in collaborative learning, as they open all the internal state of the model to inference attacks, and maximize the model's malleability by stealthy poisoning attacks. We propose Cronus, a robust collaborative machine learning framework. The simple yet effective idea behind designing Cronus is to control, unify, and significantly reduce the dimensions of the exchanged information between parties, through robust knowledge transfer between their black-box local models. We evaluate all existing federated learning algorithms against poisoning attacks, and we show that Cronus is the only secure method, due to its tight robustness guarantee. Treating local models as black-box, reduces the information leakage through models, and enables us using existing privacy-preserving algorithms that mitigate the risk of information leakage through the model's output (predictions). Cronus also has a significantly lower sample complexity, compared to federated learning, which does not bind its security to the number of participants.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. TallyTrain: Communication-Efficient Federated Distillation

    cs.LG 2026-06 unverdicted novelty 7.0

    TallyTrain is a hard-label distillation protocol for federated learning that uses argmax transmission and optional sparse merges to match soft-label performance at up to 1000x lower communication cost.

  2. XFED: Non-Collusive Model Poisoning Attack Against Byzantine-Robust Federated Classifiers

    cs.CR 2026-04 unverdicted novelty 7.0

    XFED is the first aggregation-agnostic non-collusive model poisoning attack that bypasses eight state-of-the-art defenses on six benchmark datasets without attacker coordination.

  3. Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems

    cs.CL 2026-05 unverdicted novelty 6.0

    Nexa learns a response-conditioned policy that starts with parallel agent execution and adds at most one round of sequential message passing via a predicted sparse DAG, strictly subsuming pure parallel mode.

  4. Function-Space ADMM for Decentralized Federated Learning: A Control Theoretic Perspective

    cs.LG 2026-05 unverdicted novelty 6.0

    FedF-ADMM uses function-space ADMM updates projected via knowledge distillation plus a PI-like stabilization term to deliver faster, more stable convergence and higher accuracy than prior decentralized FL methods unde...

  5. Optimized Federated Knowledge Distillation with Distributed Neural Architecture Search

    cs.LG 2026-05 unverdicted novelty 5.0

    FedKDNAS combines client-side neural architecture search with knowledge distillation from aggregated server predictions to improve accuracy and efficiency in heterogeneous federated learning.

  6. Knowledge Distillation in Federated Learning: a Survey on Long Lasting Challenges and New Solutions

    cs.LG 2024-06 unverdicted novelty 2.0

    A survey organizing knowledge distillation techniques for addressing privacy, heterogeneity, communication, and personalization challenges in federated learning.