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, linear, and nonparametric regression.
Minimax and adaptive transfer learn- ing for nonparametric classification under distributed differential privacy constraints.arXiv preprint arXiv:2406.20088
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
A random-projection differentially private kernel ERM method attains minimax-optimal excess risk bounds for squared and Lipschitz-smooth convex losses under local strong convexity, plus the first dimension-free bounds for objective-perturbation private linear ERM.
Introduces FedHybrid and FedNewton for DP federated M-estimation, with finite-sample MSE bounds, minimax lower bound, and evaluations on vision datasets.
citing papers explorer
-
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, linear, and nonparametric regression.
-
Optimal differentially private kernel learning with random projection
A random-projection differentially private kernel ERM method attains minimax-optimal excess risk bounds for squared and Lipschitz-smooth convex losses under local strong convexity, plus the first dimension-free bounds for objective-perturbation private linear ERM.
-
Statistical Limits and Efficient Algorithms for Differentially Private Federated Learning
Introduces FedHybrid and FedNewton for DP federated M-estimation, with finite-sample MSE bounds, minimax lower bound, and evaluations on vision datasets.