pith. sign in

arxiv: 2601.21959 · v2 · pith:T3L6AALPnew · submitted 2026-01-29 · 📊 stat.ML · cs.LG

Near-Optimal Private Tests for Simple and MLR Hypotheses

classification 📊 stat.ML cs.LG
keywords privatetestsestimatornear-optimalnon-privatepowerfulprivacysimple
0
0 comments X
read the original abstract

We develop a near-optimal testing procedure under the framework of Gaussian differential privacy for simple as well as one- and two-sided tests under monotone likelihood ratio conditions. Our mechanism is based on a private mean estimator with data-driven clamping bounds, whose population risk matches the private minimax rate up to logarithmic factors. Using this estimator, we construct private test statistics that achieve the same asymptotic relative efficiency as the non-private, most powerful tests while maintaining conservative type I error control. In addition to our theoretical results, our numerical experiments show that our private tests outperform competing DP methods and offer comparable power to the non-private most powerful tests, even at moderately small sample sizes and privacy loss budgets.

This paper has not been read by Pith yet.

discussion (0)

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