Pith. sign in

REVIEW 2 cited by

Minimax And Adaptive Transfer Learning for Nonparametric Classification under 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

arxiv 2406.20088 v1 pith:CHWYVA2M submitted 2024-06-28 math.ST stat.MEstat.MLstat.TH

classification math.STstat.MEstat.MLstat.TH
keywords privacyclassificationconstraintsadaptivedifferentialminimaxaccuracyacross
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper considers minimax and adaptive transfer learning for nonparametric classification under the posterior drift model with distributed differential privacy constraints. Our study is conducted within a heterogeneous framework, encompassing diverse sample sizes, varying privacy parameters, and data heterogeneity across different servers. We first establish the minimax misclassification rate, precisely characterizing the effects of privacy constraints, source samples, and target samples on classification accuracy. The results reveal interesting phase transition phenomena and highlight the intricate trade-offs between preserving privacy and achieving classification accuracy. We then develop a data-driven adaptive classifier that achieves the optimal rate within a logarithmic factor across a large collection of parameter spaces while satisfying the same set of differential privacy constraints. Simulation studies and real-world data applications further elucidate the theoretical analysis with numerical results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. A Van Trees Lower Bound for Fully Interactive Differentially Private Federated Learning

    cs.LG 2026-05 unverdicted novelty 8.0 of 10

    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...

  2. Sufficiency-principled Transfer Learning via Model Averaging

    stat.ME 2025-07 conditional novelty 6.0 of 10

    A sufficiency-penalized model averaging transfer learning method that adaptively selects informative domains, with convergence rates, optimality, and asymptotic normality.

Pith tools