research27 min studyLesson 926 in Engineering

Account for tuning and private release selection

Separate postprocessing of DP outputs from new access to private validation data.

On this page

What you’ll understand

  • Compose a conservative budget for several candidate training runs and private selection.
  • Identify when public evaluation is postprocessing and when a new private query occurs.
  • State the sensitivity and candidate-set assumptions of an exponential selector.

Training one differentially private model does not make an entire model-search workflow private at the same budget. Candidate training runs, private validation scores, early stopping and release decisions can each depend on protected data. Publishing only one winning model does not automatically erase the influence of the other trials. A release process needs an analysis of the complete selection mechanism, with the protected population and observable outputs defined explicitly.

Candidate generation and evaluation have different data paths

If several candidate models are individually DP for the same protected units, their joint outputs have a conservative sequential-composition bound. Selecting among those outputs using genuinely public validation data and public randomness is postprocessing of their joint DP transcript. That selection does not require an additional private-data query, but the transcript’s training cost still reflects the valid joint bound. A discarded candidate is not automatically free merely because its parameters are not published; a specialized analysis is needed to claim a smaller search cost.

Evaluating candidates on a private holdout introduces another protected data access. The score or selection must be privatized under the appropriate adjacency, including overlap of users between training and validation. Disjoint rows do not imply disjoint users. Logging raw validation scores or choosing an early-stop point from unsanitized metrics creates a path outside the training model’s postprocessing guarantee. Fixed public search budgets are easier to audit than raw-data-dependent stopping, whose privacy analysis must cover the stopping decision itself.

εtotal≤∑j=1kεj+εselect,δtotal≤∑j=1kδj+δselect\varepsilon_{\rm total}\le\sum_{j=1}^{k}\varepsilon_j+\varepsilon_{\rm select},\qquad\delta_{\rm total}\le\sum_{j=1}^{k}\delta_j+\delta_{\rm select}
This is conservative sequential composition for the same protected population and adjacency, with valid conditional component guarantees. It is not necessarily the tightest bound, and selection has zero additional cost only when it uses no fresh protected information.↔ Scroll wide equations horizontally.

A private selector needs a sensitivity contract

For a finite public candidate set and a utility function whose value changes by at most Delta_u for every candidate across neighboring validation datasets, the exponential mechanism samples according to the displayed distribution. Higher utility is preferred, and epsilon_select determines the privacy parameter of this selector under that utility-sensitivity bound. Releasing only the selected candidate does not mean releasing every raw utility is safe. Candidate models depending on earlier DP outputs are handled conditionally; their identity and score sensitivity must remain valid for each allowed prior transcript.

An accuracy count with one bounded contribution per protected validation unit has a simple sensitivity bound. A score combining several unbounded records from one user does not inherit the same user-level sensitivity. If candidate generation itself uses nonprivate validation statistics, privatizing the final index cannot retrospectively protect those exposed intermediate choices. Research on private hyperparameter tuning gives stronger results for specific search constructions; the elementary composition bound here remains a valid baseline when its stated components and scopes are satisfied.

Pr⁡[J=j]=exp⁡ ⁣(εselectu(D,j)/(2Δu))∑ℓ=1kexp⁡ ⁣(εselectu(D,ℓ)/(2Δu)),Δu>0\Pr[J=j]=\frac{\exp\!\left(\varepsilon_{\rm select}u(D,j)/(2\Delta_u)\right)}{\sum_{\ell=1}^{k}\exp\!\left(\varepsilon_{\rm select}u(D,\ell)/(2\Delta_u)\right)},\qquad\Delta_u>0
The candidate set is finite and public conditional on already accounted DP outputs. Utility has sensitivity at most Delta_u for every candidate under the declared adjacency, epsilon_select≥0, and the ratio is dimensionless. The exact exponential-mechanism theorem gives pure epsilon_select-DP for this selector.↔ Scroll wide equations horizontally.

Make the search plan auditable

Keep candidate configurations, training and evaluation data boundaries, accountant states, selected artifact identifiers and any private stopping decisions in the release record. Choose public development data for exploratory debugging when possible, and reserve private evaluation access for a declared procedure. If a candidate fails a utility target, a retry on the same protected population is still part of the search history. Reusing an already released DP model for a public benchmark is different from retraining or querying fresh private holdout labels.

The optimization lab permits a public-data selection exercise. Reset and set both η=0.25 and x₀=2; one Step predicts x=1.5 and f=1.125. Separately Reset and set both η=0.5 and x₀=2; one Step predicts x=1 and f=0.5. Choosing the lower displayed public toy loss needs no private access here. The lab contains no protected training data, exponential selector or privacy accountant, so its choice says nothing about the budget of tuning a real model on private validation records.

Include candidate runs and the private selector

Three candidate-training mechanisms each have a valid conditional (0.4,10⁻⁶) guarantee for the same protected population and adjacency. A valid private validation selector costs (0.2,0). Use basic sequential composition and assume no other protected outputs are released.

  1. The three training mechanisms contribute epsilon 3×0.4=1.2 and delta 3×10⁻⁶=3×10⁻⁶ under the conservative joint bound. Releasing only the eventual winner does not by itself justify replacing that joint analysis with a single-run cost.

  2. The selector accesses protected validation information, so add its pure epsilon 0.2. The resulting sufficient bound is epsilon 1.4 and delta 3×10⁻⁶, under the common-population and conditional-guarantee premises.

  3. If selection instead used only genuinely public validation and the already accounted candidate outputs, its additional cost would be zero by postprocessing. The same conservative training-transcript bound would then remain (1.2,3×10⁻⁶), unless a separately justified tighter search analysis were used.

The result

Private selection and public postprocessing are different data paths. The basic sufficient pair is (1.4,3×10⁻⁶) for the stated private-selector workflow, not automatically the winner’s single-run pair.

Explore the model

Interactive lab

Interactive lab · optimization

Selecting on an entirely public toy loss

Reset → set η=0.25 and x₀=2 → Step predicts x=1.5, f=1.125. Separate Reset → set η=0.5 and x₀=2 → Step predicts x=1, f=0.5.

Selecting on an entirely public toy lossGradient descent on f(x) = x²/2: xₙ = (1 − η)ⁿx₀. Playback advances two discrete iterations per second. Values outside |x| ≤ 4 are explicitly reported. Current readings: Position x0: 2; Objective x²/2: 2; Iteration behavior: Stable step. All parameters are adjustable with the labeled controls below.−4−202402.174.356.528.7Parameter xf(x) = x²/2n = 0
ObjectiveDiscrete iterate
Position x0
2
Objective x²/2
2
Iteration behavior
Stable step
n = 0 · t = 0 s

Gradient descent on f(x) = x²/2: xₙ = (1 − η)ⁿx₀. Playback advances two discrete iterations per second. Values outside |x| ≤ 4 are explicitly reported. 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 exact quadratic is public and deterministic. It does not simulate private validation, an exponential selector or privacy-cost composition.

Check your understanding

When does selecting a candidate add no new private-data access by postprocessing?

Try it yourself

Four candidate runs each have conditional (0.3,2×10⁻⁶) guarantees on the same protected population. A valid private selector costs (0.1,0). Give the basic sufficient composed pair and explain why deleting three candidates does not automatically reduce it.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Add component epsilons and deltas. The selected index can still depend on every trial.

Compare with the solution

The bound is epsilon 4×0.3+0.1=1.3 and delta 4×2×10⁻⁶=8×10⁻⁶. Deleting unsuccessful artifacts does not undo their influence on the selection mechanism. A tighter bound may exist for a specifically analyzed search algorithm, but cannot be inferred merely from the number of models left on disk.

Take it with you

  • Candidate search is a mechanism with its own complete information path.
  • Public postprocessing differs from private validation access.
  • Specialized tuning results require their own assumptions; conservative composition remains an explicit baseline.

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.