aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorYuchen Pei <me@ypei.me>2019-03-14 09:56:12 +0100
committerYuchen Pei <me@ypei.me>2019-03-14 09:56:12 +0100
commitd667a457985edf012759e9fd12b66807583dcc1e (patch)
tree7ac59e1cfb8663525064cd0160081ec6fd310fef
parent2752d7936408b4f8c29a2625911173fb388c96aa (diff)
minor fix
-rw-r--r--posts/2019-03-13-a-tail-of-two-densities.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/posts/2019-03-13-a-tail-of-two-densities.md b/posts/2019-03-13-a-tail-of-two-densities.md
index aa23a6a..fbf3127 100644
--- a/posts/2019-03-13-a-tail-of-two-densities.md
+++ b/posts/2019-03-13-a-tail-of-two-densities.md
@@ -776,7 +776,7 @@ $M_i(y_{1 : i})$ as $M_i$, but keep in mind of the dependence on the
parameters.
It is time to state and prove the composition theorems. In this section
-we consider $2 \times 2 \times 2 = 8$ of them, i.e. theorems of three
+we consider $2 \times 2 \times 2 = 8$ cases, i.e. situations of three
dimensions, where there are two choices in each dimension:
1. Composition of $\epsilon$-dp or more generally
@@ -787,7 +787,7 @@ dimensions, where there are two choices in each dimension:
Note that in the first two dimensions the second choice is more general
than the first.
-The relation between proofs of these composition theorems is as follows:
+The proofs of these composition theorems will be laid out as follows:
1. Claim 10 - Basic composition theorem for $(\epsilon, \delta)$-dp
with adaptive mechanisms: by a direct proof with an induction