Pith. sign in

REVIEW 3 cited by

Differentially Private Meta-Learning

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 1909.05830 v2 pith:ZK7IU255 submitted 2019-09-12 cs.LG cs.AIcs.CRstat.ML

classification cs.LGcs.AIcs.CRstat.ML
keywords privacylearningclassificationcommonlydifferentiallyfederatedfew-shotmeta-learning
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Parameter-transfer is a well-known and versatile approach for meta-learning, with applications including few-shot learning, federated learning, and reinforcement learning. However, parameter-transfer algorithms often require sharing models that have been trained on the samples from specific tasks, thus leaving the task-owners susceptible to breaches of privacy. We conduct the first formal study of privacy in this setting and formalize the notion of task-global differential privacy as a practical relaxation of more commonly studied threat models. We then propose a new differentially private algorithm for gradient-based parameter transfer that not only satisfies this privacy requirement but also retains provable transfer learning guarantees in convex settings. Empirically, we apply our analysis to the problems of federated learning with personalization and few-shot classification, showing that allowing the relaxation to task-global privacy from the more commonly studied notion of local privacy leads to dramatically increased performance in recurrent neural language modeling and image classification.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Privacy-Aware Collaborative and Distributed Bayesian Optimization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    PACD-BO distributes PACOH meta-learning via gradient exchange to match centralized BO without raw data, but gradients leak client queries with worsening near-optima clustering, mitigated by task-level DP at a utility cost.

  2. Dyn-D$^2$P: Dynamic Differentially Private Decentralized Learning with Provable Utility Guarantee

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Dyn-D2P dynamically adjusts DP noise and gradient clipping in decentralized learning, with a 1/sqrt(n) utility rate on top of an unquantified clipping bias.

  3. FedRP: A Communication-Efficient Approach for Differentially Private Federated Learning Using Random Projection

    cs.LG 2025-09 reject novelty 5.0 of 10

    FedRP claims to preserve FedAvg-level accuracy while sending only a few numbers per client per round and providing an (epsilon, delta)-DP guarantee.

Pith tools