Pith. sign in

REVIEW 1 cited by

Theoretically Principled Federated Learning for Balancing Privacy and Utility

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 2305.15148 v2 pith:2FMKYYFV submitted 2023-05-24 cs.LG cs.AIcs.CR

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

We propose a general learning framework for the protection mechanisms that protects privacy via distorting model parameters, which facilitates the trade-off between privacy and utility. The algorithm is applicable to arbitrary privacy measurements that maps from the distortion to a real value. It can achieve personalized utility-privacy trade-off for each model parameter, on each client, at each communication round in federated learning. Such adaptive and fine-grained protection can improve the effectiveness of privacy-preserved federated learning. Theoretically, we show that gap between the utility loss of the protection hyperparameter output by our algorithm and that of the optimal protection hyperparameter is sub-linear in the total number of iterations. The sublinearity of our algorithm indicates that the average gap between the performance of our algorithm and that of the optimal performance goes to zero when the number of iterations goes to infinity. Further, we provide the convergence rate of our proposed algorithm. We conduct empirical results on benchmark datasets to verify that our method achieves better utility than the baseline methods under the same privacy budget.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Fed-AugMix: Balancing Privacy and Utility via Data Augmentation

    cs.CR 2024-12 conditional novelty 4.0 of 10

    Fed-AugMix applies AugMix data augmentation with a Jensen-Shannon consistency loss at federated clients, empirically degrading gradient-inversion reconstruction quality while preserving or improving model accuracy.

Pith tools