REVIEW 2 cited by
Optimal Federated Learning for Nonparametric Regression with Heterogeneous Distributed Differential Privacy Constraints
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
read the original abstract
This paper studies federated learning for nonparametric regression in the context of distributed samples across different servers, each adhering to distinct differential privacy constraints. The setting we consider is heterogeneous, encompassing both varying sample sizes and differential privacy constraints across servers. Within this framework, both global and pointwise estimation are considered, and optimal rates of convergence over the Besov spaces are established. Distributed privacy-preserving estimators are proposed and their risk properties are investigated. Matching minimax lower bounds, up to a logarithmic factor, are established for both global and pointwise estimation. Together, these findings shed light on the tradeoff between statistical accuracy and privacy preservation. In particular, we characterize the compromise not only in terms of the privacy budget but also concerning the loss incurred by distributing data within the privacy framework as a whole. This insight captures the folklore wisdom that it is easier to retain privacy in larger samples, and explores the differences between pointwise and global estimation under distributed privacy constraints.
Forward citations
Cited by 2 Pith papers
-
A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning
Under clientwise sample-level zCDP, the Fisher information of any fully interactive public federated transcript contracts to a sum of per-client privacy-vs-sample terms, yielding matching minimax rates for mean, linea...
-
Differentially Private Nonparametric Modal Learning with Applications to Regression and Clustering
A private gradient-ascent algorithm estimates all density modes with nearly minimax-optimal error under differential privacy.
Discussion (0). Sign in to comment.