Pith. sign in

REVIEW 5 cited by

Protection Against Reconstruction and Its Applications in Private Federated 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 1812.00984 v2 pith:IQBI2R7P submitted 2018-12-03 stat.ML cs.LG

Protection Against Reconstruction and Its Applications in Private Federated Learning

classification stat.ML cs.LG
keywords dataprivacylearninglocalprotectionsstatisticallarge-scaleprivate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In large-scale statistical learning, data collection and model fitting are moving increasingly toward peripheral devices---phones, watches, fitness trackers---away from centralized data collection. Concomitant with this rise in decentralized data are increasing challenges of maintaining privacy while allowing enough information to fit accurate, useful statistical models. This motivates local notions of privacy---most significantly, local differential privacy, which provides strong protections against sensitive data disclosures---where data is obfuscated before a statistician or learner can even observe it, providing strong protections to individuals' data. Yet local privacy as traditionally employed may prove too stringent for practical use, especially in modern high-dimensional statistical and machine learning problems. Consequently, we revisit the types of disclosures and adversaries against which we provide protections, considering adversaries with limited prior information and ensuring that with high probability, ensuring they cannot reconstruct an individual's data within useful tolerances. By reconceptualizing these protections, we allow more useful data release---large privacy parameters in local differential privacy---and we design new (minimax) optimal locally differentially private mechanisms for statistical learning problems for \emph{all} privacy levels. We thus present practicable approaches to large-scale locally private model training that were previously impossible, showing theoretically and empirically that we can fit large-scale image classification and language models with little degradation in utility.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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

  1. Robust Statistical Estimators with Bounded Empirical Sensitivity

    math.ST 2026-05 conditional novelty 7.0

    Defines empirical sensitivity and proves Ω(η + √(η d/n)) lower bound (tight up to logs) for any Gaussian mean estimator achieving optimal O(√(d/n)) ℓ₂ error.

  2. Shuffling-Aware Optimization for Private Vector Mean Estimation

    cs.LG 2026-04 unverdicted novelty 7.0

    Using the shuffle index, the authors formulate and solve an optimization problem for post-shuffle minimax-optimal unbiased mean estimation, yielding an asymptotically optimal mechanism whose privacy-utility tradeoff a...

  3. Multi-tier Differential Private Query Release

    cs.CR 2026-06 unverdicted novelty 6.0

    A framework for multi-tier differential private query release that bounds cumulative privacy loss to the maximum budget while achieving optimal utility comparable to single-tier mechanisms.

  4. Deep Privacy Funnel Model: From a Discriminative to a Generative Approach with an Application to Face Recognition

    cs.LG 2024-04 unverdicted novelty 6.0

    Introduces Generative Privacy Funnel (GenPF) and deep variational PF (DVPF) models that extend the privacy funnel to generative settings and provide a controllable privacy-utility trade-off with reduced sensitive attr...

  5. Enhanced Privacy and Communication Efficiency in Non-IID Federated Learning with Adaptive Quantization and Differential Privacy

    cs.CV 2026-04 unverdicted novelty 5.0

    Adaptive bit-length schedulers plus Laplacian DP in non-IID FL reduce communicated data by up to 52.64% on MNIST and 45% on CIFAR-10 while keeping competitive accuracy and privacy.