Combinators#
Combinator constructors use Transformations or Measurements to produce a new Transformation or Measurement.
Chaining#
Two of the most essential constructors are the “chainers” that chain transformations with transformations, and transformations with measurements. Chainers are used to incrementally piece Transformations or Measurements together that represent longer computational pipelines.
The opendp.combinators.make_chain_tt()
constructor creates a new Transformation by combining an inner and an outer Transformation.
The resulting Transformation contains a function that sequentially executes the function of the constituent Transformations.
It also contains a privacy map that takes an input distance bound on the inner Transformation and emits an output distance bound on the outer transformation.
The opendp.combinators.make_chain_mt()
constructor similarly creates a new Measurement by combining an inner Transformation with an outer Measurement.
Notice that there is no make_chain_mm
for chaining measurements together!
Any computation beyond a measurement is postprocessing and need not be governed by relations.
Postprocessing functionality is provided by the opendp.combinators.make_chain_tm()
constructor that allows transformations to be chained onto a Measurement.
Since the outer Transformation is postprocessing, the metrics and stability map of the outer Transformation are ignored.
In this case, it is only necessary for the domains to conform.
In the following example we chain opendp.measurements.make_base_discrete_laplace()
with opendp.transformations.make_bounded_sum()
.
>>> from opendp.transformations import make_bounded_sum
>>> from opendp.measurements import make_base_discrete_laplace
>>> from opendp.combinators import make_chain_mt
...
>>> # call a constructor to produce a transformation
>>> bounded_sum = make_bounded_sum(bounds=(0, 1))
>>> # call a constructor to produce a measurement
>>> base_dl = make_base_discrete_laplace(scale=1.0)
>>> noisy_sum = make_chain_mt(base_dl, bounded_sum)
...
>>> # investigate the privacy relation
>>> symmetric_distance = 1
>>> epsilon = 1.0
>>> assert noisy_sum.check(d_in=symmetric_distance, d_out=epsilon)
...
>>> # invoke the chained measurement's function
>>> dataset = [0, 0, 1, 1, 0, 1, 1, 1]
>>> release = noisy_sum(dataset)
In practice, these chainers are used so frequently that we’ve written a shorthand (>>
).
The syntax automatically chooses between make_chain_mt
,
make_chain_tt
,
and make_chain_tm
.
>>> noisy_sum = bounded_sum >> base_dl
In this example the chaining was successful because:
bounded_sum’s output domain is equivalent to base_dl’s input domain
bounded_sum’s output metric is equivalent to base_dl’s input metric
Chaining fails if we were to adjust the domains such that they won’t match.
In the below example, the adjustment is subtle, but the bounds were adjusted to floats.
make_bounded_sum
is equally capable of summing floats,
but the chaining fails because the sum emits floats and the discrete laplace mechanism expects integers.
>>> from opendp.mod import OpenDPException
>>> try:
... make_bounded_sum(bounds=(0., 1.)) >> base_dl
... except OpenDPException as err:
... print(err.message[:1])
Intermediate domains don't match. See https://github.com/opendp/opendp/discussions/297
output_domain: AllDomain(f64)
input_domain: AllDomain(i32)
Note that noisy_sum
’s input domain and input metric come from bounded_sum
’s input domain and input metric.
This is intended to enable further chaining with preprocessors like make_cast
, make_impute_constant
, make_clamp
and make_bounded_resize
.
See the section on Transformations for more information on how to preprocess data in OpenDP.
Composition#
OpenDP has a basic composition combinator for composing a list of measurements into a new measurement:
opendp.combinators.make_basic_composition()
.
>>> from opendp.combinators import make_basic_composition
>>> noisy_sum_pair = make_basic_composition([noisy_sum, noisy_sum])
>>> release_1, release_2 = noisy_sum_pair(dataset)
This kind of composition primitive gives a structural guarantee that all statistics are computed together in a batch. Thus the privacy map simply sums the constituent output distances.
>>> noisy_sum_pair.map(1)
2.0
This combinator can compose Measurements with ZeroConcentratedDivergence
, MaxDivergence
and FixedSmoothedMaxDivergence
output measures.
Measure Casting#
These combinators are used to cast the output measure of a Measurement.
Input Measure 
Output Measure 
Constructor 












opendp.combinators.make_pureDP_to_fixed_approxDP()
is used for casting an output measure from MaxDivergence
to FixedSmoothedMaxDivergence
.
This is useful if you want to compose pureDP measurements with approximateDP measurements.
>>> from opendp.measurements import make_base_laplace
>>> from opendp.combinators import make_pureDP_to_fixed_approxDP
>>> meas_pureDP = make_base_laplace(scale=10.)
>>> # convert the output measure to `FixedSmoothedMaxDivergence`
>>> meas_fixed_approxDP = make_pureDP_to_fixed_approxDP(meas_pureDP)
...
>>> # FixedSmoothedMaxDivergence distances are (ε, δ) tuples
>>> meas_fixed_approxDP.map(d_in=1.)
(0.1, 0.0)
Similarly, opendp.combinators.make_pureDP_to_zCDP()
is used for casting an output measure from MaxDivergence
to ZeroConcentratedDivergence
.
opendp.combinators.make_zCDP_to_approxDP()
is used for casting an output measure from ZeroConcentratedDivergence
to SmoothedMaxDivergence
.
>>> from opendp.measurements import make_base_gaussian
>>> from opendp.combinators import make_zCDP_to_approxDP
>>> meas_zCDP = make_base_gaussian(scale=0.5)
>>> # convert the output measure to `SmoothedMaxDivergence`
>>> meas_approxDP = make_zCDP_to_approxDP(meas_zCDP)
...
>>> # SmoothedMaxDivergence distances are ε(δ) curves
>>> curve = meas_approxDP.map(d_in=1.)
>>> curve.epsilon(delta=1e6)
11.688596249354896
opendp.combinators.make_fix_delta()
changes the output measure from SmoothedMaxDivergence
to FixedSmoothedMaxDivergence
.
It fixes the delta parameter in the curve, so that the resulting measurement can be composed with other FixedSmoothedMaxDivergence
measurements.
>>> from opendp.combinators import make_fix_delta
>>> # convert the output measure to `FixedSmoothedMaxDivergence`
>>> meas_fixed_approxDP = make_fix_delta(meas_approxDP, delta=1e8)
...
>>> # FixedSmoothedMaxDivergence distances are (ε, δ) tuples
>>> meas_fixed_approxDP.map(d_in=1.)
(13.3861046488579, 1e08)
These last two combinators allow you to convert output distances in terms of ρzCDP to ε(δ)approxDP, and then to (ε, δ)approxDP.
Amplification#
If your dataset is a simple sample from a larger population,
you can make the privacy relation more permissive by wrapping your measurement with a privacy amplification combinator:
opendp.combinators.make_population_amplification()
.
The amplifier requires a looser trust model, as the population size can be set arbitrarily.
enable_features("honestbutcurious")
In order to demonstrate this API, we’ll first create a measurement with a sized input domain. The resulting measurement expects the size of the input dataset to be 10.
>>> from opendp.transformations import make_sized_bounded_mean
>>> from opendp.measurements import make_base_laplace
>>> meas = make_sized_bounded_mean(size=10, bounds=(0., 10.)) >> make_base_laplace(scale=0.5)
>>> print("standard mean:", amplified([1.] * 10)) # > 1.03
We can now use the amplification combinator to construct an amplified measurement. The function on the amplified measurement is identical to the standard measurement.
>>> from opendp.combinators import make_population_amplification
>>> amplified = make_population_amplification(meas, population_size=100)
>>> print("amplified mean:", amplified([1.] * 10)) # > .97
The privacy relation on the amplified measurement takes into account that the input dataset of size 10 is a simple sample of individuals from a theoretical larger dataset that captures the entire population, with 100 rows.
>>> # Where we once had a privacy utilization of ~2 epsilon...
>>> assert meas.check(2, 2. + 1e6)
...
>>> # ...we now have a privacy utilization of ~.4941 epsilon.
>>> assert amplified.check(2, .4941)
The efficacy of this combinator improves as n gets larger.