Pith. sign in

REVIEW 2 cited by

DP-SIGNSGD: When Efficiency Meets Privacy and Robustness

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 2105.04808 v1 pith:7O3WDS4X submitted 2021-05-11 cs.CR

classification cs.CR
keywords dp-signsgdefficiencyrobustnessprivacypromisingproposedsignsgdaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning (FL) has emerged as a promising collaboration paradigm by enabling a multitude of parties to construct a joint model without exposing their private training data. Three main challenges in FL are efficiency, privacy, and robustness. The recently proposed SIGNSGD with majority vote shows a promising direction to deal with efficiency and Byzantine robustness. However, there is no guarantee that SIGNSGD is privacy-preserving. In this paper, we bridge this gap by presenting an improved method called DP-SIGNSGD, which can meet all the aforementioned properties. We further propose an error-feedback variant of DP-SIGNSGD to improve accuracy. Experimental results on benchmark image datasets demonstrate the effectiveness of our proposed methods.

Discussion (0). Continue with ORCID 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. Information-Theoretically Secure Aggregation for Lightweight Federated Learning: Resilient to Dropouts and Adversaries

    cs.LG 2026-07 reject novelty 5.0 of 10

    A secure aggregation protocol for sign-based federated learning computes the majority vote in one round with linear offline cost, but the claimed degree-halving simplification breaks at zero inputs and for inverse terms.

  2. Hi-SAFE: Hierarchical Secure Aggregation for Lightweight Federated Learning

    cs.LG 2025-11 conditional novelty 5.0 of 10

    Hi-SAFE privately computes the signSGD majority vote using a Fermat-based indicator polynomial evaluated with Beaver triples, and uses subgrouping to keep per-user cost independent of n.

Pith tools