Theorem 3.2 [MT07] — the exponential mechanism is ε-differentially private
ProvedPrivateRelease.NetMechanism.theorem_3_2differential-privacyexponential-mechanismp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a finite data universe, an input size, a finite nonempty range and a quality score with . For every the exponential mechanism is -differentially private: for all inputs differing in one entry and every set of outputs,
and each output law is a probability distribution on .
This is the privacy guarantee of McSherry and Talwar's exponential mechanism, of which the Net mechanism is an instance.
Formalization Note The hypothesis is where the paper's formula is defined. Neighbours differ in exactly one entry. The probability-measure clause is stated because the platform's privacy predicate alone does not require it.
Preamble
import Mathlib import Definitions.Def_PrivateRelease_NetMechanism_ExpMech
Formal statement
namespace PrivateRelease.NetMechanism
open MeasureTheory
/-- Theorem 3.2 ([MT07], p. 8): the exponential mechanism `M_E(·, q, R)` over a finite nonempty
range `R`, with a quality score of positive sensitivity `GS_q`, preserves ε-differential
privacy; each of its output laws is a probability measure. -/
theorem theorem_3_2 {X O : Type} [Fintype X] [MeasurableSpace O] {n : ℕ} (R : Finset O)
(q : (Fin n → X) → O → ℝ) (ε : ℝ) (hR : R.Nonempty) (hq : 0 < scoreSens R q)
(hε : 0 < ε) :
PrivLearn.Generic.IsDP (expMech R q ε) ε ∧
∀ z : Fin n → X, IsProbabilityMeasure (expMech R q ε z) := by sorry
end PrivateRelease.NetMechanism
Source
Blum, Ligett, Roth, A Learning Theory Approach to Non-Interactive Database Privacy, arXiv:1109.2229v1 (2011), p. 8, Theorem 3.2 (citing McSherry–Talwar 2007)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.