Skip to content
NewA calmer, faster ZeroHour

Contraction and Statistical Inference under Privacy for Uniformly Bounded Distributions

arXiv cs.CRby Leonhard Grosse ()1 min read4 · 4 reads
AI summary · grok-4.7Summaries by Vani AI

Researchers study c-interior pointwise maximal leakage for tighter privacy contraction and private statistical inference.

The paper studies c-interior pointwise maximal leakage as a disclosure constraint that generalizes local differential privacy for distributions whose densities are bounded away from zero by c. Treating the constraint algebraically, the authors give tight Dobrushin-coefficient bounds, bound Hockeystick-divergence contraction, and derive strong data-processing inequalities for f-divergences, including kernels outside pure LDP. They apply the results to minimax binary hypothesis testing and mean estimation, and note that when c is large, private inference need not increase sample complexity.

Key facts
  • c-interior PML generalizes local differential privacy for densities bounded below by c.
  • Authors bound the Dobrushin coefficient and Hockeystick-divergence contraction.
  • Data-processing inequalities cover f-divergences and kernels beyond pure LDP.
  • They derive optimal hypothesis testing and mean estimation under the constraint.
Analyze this story with Vani AIImpact, who is affected and what defenders should do, in a new chat

From the original article

1 min read at arxiv.org

We investigate $c$-interior pointwise maximal leakage (PML) as a tool for contraction analyses and disclosure control. Based on the strong adversarial threat models from maximal leakage, $c$-interior PML generalizes local differential privacy (LDP) to data-generating distributions with densities uniformly bounded away from zero by $c>0$.

arXiv cs.CR

By Leonhard Grosse · arxiv.org

Read the full article at arXiv cs.CR

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.