Keep an irreversible release ledger across retries and deletion
Record the whole observable mechanism history and distinguish new data access from postprocessing.
On this page
The question for today
What you’ll understand
- Compose a conservative history across repeated releases for the same protected units.
- Preserve accountant state and mechanism metadata when a job resumes.
- Explain why deleting data or artifacts cannot revoke information already released.
A privacy ledger records what the system has already exposed under a declared protected unit and mechanism. It is not simply the epsilon stored beside the latest checkpoint. Retraining, evaluation, search and earlier released artifacts can all contribute to the observable history. Deleting a dataset or an unsuccessful model changes local storage, but cannot force an observer to forget a prior output or make that output’s influence on a later selection disappear.
Track releases at the correct population boundary
For mechanisms on the same protected population, conservative sequential composition adds component epsilons and deltas when their conditional guarantees and adjacency match. The sum is a sufficient bound, not necessarily optimal realized privacy loss. A user appearing in several datasets can be affected by all their releases, so a new file path, dataset version or row split does not reset the user’s ledger. Parallel composition requires proven disjoint privacy units under an applicable theorem, rather than assuming disjoint rows imply disjoint people.
An accountant should retain more than a final scalar: sampling law and rates, clipping unit and thresholds, noise schedules, logical update count, analysis orders, target delta, theorem and implementation version. Store private evaluation and selection entries as well as training. A release identifier should connect the ledger to the exact artifact and permitted metadata. Opacus v1.5.4 checkpoint support includes accountant state; a resumed optimizer without its prior accountant can otherwise report a misleading fresh-run budget for an accumulated history.
Deletion does not invert an observed release
Deleting raw data can prevent future access, and deleting local artifacts can reduce future accidental exposure. Neither action removes information from a model or metric already received by an observer. Retraining without a user creates a new artifact and a new data-access history; it does not retroactively retract the old model. Machine unlearning can target a different operational goal, but its guarantee must be stated separately from DP and cannot erase copies already distributed outside the system’s control.
Postprocessing is the useful contrasting boundary. A function of an already accounted DP output, public information and fresh randomness independent of protected data retains that output’s DP guarantee. It need not be charged as a fresh raw-data query. But accessing a private validation set, private normalization statistic or raw training cache while performing that function breaks the postprocessing premise. Document dependencies rather than labeling an entire inference or export job postprocessing simply because its main input is a private-trained model.
Cover failures and repeated attempts
A failed training attempt can still expose logs, partial models or data-dependent failure information. Whether it contributes privacy cost depends on the actual observable mechanism, not the word failed. Do not assume unlimited aborted retries are free, and do not publish raw diagnostic gradients outside the sanitized path. Preserve enough privacy-safe operational evidence to reconcile attempted, completed and released mechanisms. Noise reuse across supposedly independent attempts also needs analysis because an observer may combine outputs to cancel or reduce the intended randomization.
The modular lab offers a caution about counters. Reset and set both m=8 and additive step a=3. Predict residues 3,6,1 after three Steps, although the ordinary unwrapped accumulated amount is nine. The orbit wraps by definition and does not represent a privacy ledger. Its displayed return to a small residue cannot mean earlier cost vanished. This is only public integer arithmetic: the instrument has no epsilon, delta, dataset or accounting theorem, and a real ledger must preserve its nonwrapping mechanism history.
Work it through
An erased artifact is still part of an observed history
For the same protected population and adjacency, three released mechanisms have valid conditional guarantees (0.6,10⁻⁶), (0.4,2×10⁻⁶) and (0.2,0). Use basic composition. The second artifact is later deleted locally, and a new retraining release costs (0.3,10⁻⁶).
The first three releases have sufficient composed epsilon 0.6+0.4+0.2=1.2 and delta 10⁻⁶+2×10⁻⁶=3×10⁻⁶. This is a conservative bound on their joint observed history, not a claim of exact smallest epsilon.
Deleting the second artifact locally does not remove an observer’s copy or undo its contribution to that history. The recorded sufficient pair therefore remains (1.2,3×10⁻⁶), rather than dropping to the sum of files still present.
The new retraining mechanism adds epsilon 0.3 and delta 10⁻⁶, giving sufficient history bound (1.5,4×10⁻⁶). A later public-data transformation of an already accounted output would instead be postprocessing, provided it accesses no additional protected information.
The ledger follows observable mechanisms and protected units across storage changes. Deletion can stop future access, but it is not a privacy-budget refund for information already released.
The living notebook
Explore the model
Interactive lab · modular
A wrapping counter cannot represent release history
Reset → set m=8 and a=3 → predict residues 3,6,1 after three Steps. Compare with ordinary unwrapped accumulation 3+3+3=9.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forThe additive orbit wraps and is deliberately not a privacy accountant. A smaller residue does not erase previous releases or establish a smaller privacy bound.
Pause & reason
Check your understanding
Your turn
Try it yourself
Two releases for the same protected units cost (0.3,10⁻⁶) and (0.5,10⁻⁶). After local cleanup, a new private-data mechanism costs (0.2,0). Give the basic history bound. Does projecting the old released model onto a public constraint set require another private-data query?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Cleanup does not subtract prior observed releases. A projection using only the released model and public information satisfies the postprocessing premise.
Compare with the solution
The sufficient bound is epsilon 0.3+0.5+0.2=1.0 and delta 2×10⁻⁶. A public projection of an already accounted model uses no new protected data and retains its DP guarantee by postprocessing. It does not remove the other releases from the joint history, and a projection that consulted private constraints would require a separate analysis.
Keep the idea
Take it with you
- A ledger follows protected units and observable releases across jobs and datasets.
- Deletion cannot revoke previously distributed information or refund its history.
- Postprocessing avoids new data access only when every additional input is public or independent.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.