Struct opendp::measures::SmoothedMaxDivergence
source · pub struct SmoothedMaxDivergence<Q>(PhantomData<fn() -> Q>);
Expand description
$\epsilon(\delta)$-approximate differential privacy.
The greatest divergence between any randomly selected subset of the support, with an additive tolerance for error.
The distance $d$ is of type SMDCurve
, so it can be invoked with a $\delta$
to retrieve the tightest corresponding $\epsilon$.
§Proof Definition
§d
-closeness
For any two vectors $u, v \in \texttt{D}$ and any choice of $\epsilon, \delta$ such that $\epsilon \ge d(\delta)$, we say that $M(u), M(v)$ are $d$-close under the smoothed max divergence measure (abbreviated as $D_{S\infty}$) whenever
D_{S\infty}(M(u) \| M(v)) = \max_{S \subseteq \textrm{Supp}(Y)} \Big[\ln \dfrac{\Pr[M(u) \in S] + \delta}{\Pr[M(v) \in S]} \Big] \leq \epsilon.
Tuple Fields§
§0: PhantomData<fn() -> Q>
Trait Implementations§
source§impl<Q> Clone for SmoothedMaxDivergence<Q>
impl<Q> Clone for SmoothedMaxDivergence<Q>
source§impl<Q> Debug for SmoothedMaxDivergence<Q>
impl<Q> Debug for SmoothedMaxDivergence<Q>
source§impl<Q> Default for SmoothedMaxDivergence<Q>
impl<Q> Default for SmoothedMaxDivergence<Q>
source§impl<Q: Clone + Send + Sync> FixDeltaMeasure for SmoothedMaxDivergence<Q>
impl<Q: Clone + Send + Sync> FixDeltaMeasure for SmoothedMaxDivergence<Q>
type Atom = Q
type FixedMeasure = FixedSmoothedMaxDivergence<Q>
fn new_fixed_measure(&self) -> Fallible<Self::FixedMeasure>
fn fix_delta(&self, curve: &Self::Distance, delta: &Q) -> Fallible<(Q, Q)>
source§impl<Q> Measure for SmoothedMaxDivergence<Q>
impl<Q> Measure for SmoothedMaxDivergence<Q>
Auto Trait Implementations§
impl<Q> Freeze for SmoothedMaxDivergence<Q>
impl<Q> RefUnwindSafe for SmoothedMaxDivergence<Q>
impl<Q> Send for SmoothedMaxDivergence<Q>
impl<Q> Sync for SmoothedMaxDivergence<Q>
impl<Q> Unpin for SmoothedMaxDivergence<Q>
impl<Q> UnwindSafe for SmoothedMaxDivergence<Q>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.