What does Differential Privacy for Business Statistics conclude, in numbers, about “Composition and Budget Accounting: Basic, Advanced and Optimal Books”?
Answer: Chapter 4 computes basic, advanced and optimal composition side by side; for a daily release over a year the optimal bound is only 0.283 of the basic one.
Scope of the numbers: Chapter 3 deals with sensitivity: revenue clipped per person has a root mean square error of 6545 yuan in the illustrative data, 4.09 % of revenue, and a customer profile spends the budget only once by parallel composition. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.283
| total eps after k releases, delta = 1e-6 | |||||
| eps0 | k | basic | advanced | exact exact/basic | |
| 0.10 | 1 | 0.100 | 0.536 | 0.100 | 1.000 |
| 0.10 | 4 | 0.400 | 1.093 | 0.400 | 1.000 |
| 0.10 | 12 | 1.200 | 1.947 | 1.198 | 0.998 |
| 0.10 | 52 | 5.200 | 4.337 | 3.241 | 0.623 |
| 0.10 | 365 | 36.500 | 13.881 | 10.314 | 0.283 |
| 0.10 | 1000 | 100.000 | 27.140 | 19.345 | 0.193 |
| 0.01 | 1 | 0.010 | 0.053 | 0.010 | 1.000 |
| 0.01 | 4 | 0.040 | 0.106 | 0.040 | 1.000 |
| 0.01 | 12 | 0.120 | 0.183 | 0.116 | 0.968 |
| 0.01 | 52 | 0.520 | 0.384 | 0.274 | 0.526 |
| 0.01 | 365 | 3.650 | 1.041 | 0.790 | 0.216 |
| 0.01 | 1000 | 10.000 | 1.763 | 1.365 | 0.137 |
Show the full program
# Chapter 4. p41: what k releases at eps0 each cost in total.
# Basic composition: k * eps0. Advanced composition (Dwork, Rothblum and
# Vadhan 2010): sqrt(2 k ln(1/d)) * eps0 + k * eps0 * (e**eps0 - 1),
# valid with failure probability d. Exact optimum (Kairouz, Oh and
# Viswanath): randomized response is the worst eps0 mechanism, its loss
# is +eps0 or -eps0 per release, and
# delta(E) = sum_j Binom(k, j) p**j q**(k-j) (1 - e**(E - (2j - k) eps0))+
# with p = e**eps0 / (1 + e**eps0). Bisection finds the least E with
# delta(E) <= d. d = 1e-6 throughout.
import math
D = 1e-6
def advanced(k, e0, d=D):
return math.sqrt(2.0 * k * math.log(1.0 / d)) * e0 + \
k * e0 * (math.exp(e0) - 1.0)
def delta_exact(k, e0, big_e):
lp = e0 - math.log1p(math.exp(e0))
lq = -math.log1p(math.exp(e0))
terms = []
for j in range(k + 1):
loss = (2 * j - k) * e0
if loss <= big_e:
continue
lw = (math.lgamma(k + 1) - math.lgamma(j + 1)
- math.lgamma(k - j + 1) + j * lp + (k - j) * lq)
terms.append(math.exp(lw) * (1.0 - math.exp(big_e - loss)))
return math.fsum(terms)
def exact(k, e0, d=D):
lo, hi = 0.0, k * e0
if delta_exact(k, e0, 0.0) <= d:
return 0.0
for _ in range(80):
mid = 0.5 * (lo + hi)
if delta_exact(k, e0, mid) <= d:
hi = mid
else:
lo = mid
return hi
print("total eps after k releases, delta = 1e-6")
print("%6s %6s %9s %10s %9s %10s"
% ("eps0", "k", "basic", "advanced", "exact", "exact/basic"))
for e0 in (0.1, 0.01):
for k in (1, 4, 12, 52, 365, 1000):
b, a, x = k * e0, advanced(k, e0), exact(k, e0)
print("%6.2f %6d %9.3f %10.3f %9.3f %10.3f"
% (e0, k, b, a, x, x / b))Single source and citation
Fan, Y. (2026). Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual (Version 1.0.0), Chapter 4: Composition and Budget Accounting: Basic, Advanced and Optimal Books. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-296 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026296,
author = {Fan, Yafu},
title = {Differential Privacy, the Laplace Mechanism and Privacy-Budget Accounting: Publishing Business Statistics without Exposing Any Individual},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · "Anonymous" Is Not Anonymous: Quasi-Identifiers, Differencing and Reconstruction
- Chapter 2 · The Laplace Mechanism: Epsilon Is a Ceiling on the Likelihood Ratio
- Chapter 3 · Sensitivity: Clip Revenue First, and Spend the Budget Once on a Customer Profile
- Chapter 5 · Randomized Response and the Local Model: Letting Customers Add the Noise
- Chapter 6 · How Large Should Epsilon Be: the Dispute over the 2020 United States Census and the Price of Small Numbers
- Chapter 7 · Classical Sources East and West: Han Feizi on the Difficulty of Persuasion and Warner's Randomized Response
- Chapter 8 · A Noisy Release Procedure for the Public Statistics of a Pay-per-Use Service, and a Plan for Refutation