Inferensys

Glossary

Gaussian Differential Privacy (GDP)

A privacy framework that characterizes the privacy loss of algorithms using hypothesis testing and f-divergences, providing tight composition bounds for subsampled mechanisms.
Finance professional using AI FP&A copilot on laptop, board presentation visible on screen, home office work session.
PRIVACY FRAMEWORK

What is Gaussian Differential Privacy (GDP)?

Gaussian Differential Privacy (GDP) is a mathematical framework for defining and quantifying the privacy loss of randomized algorithms using hypothesis testing and f-divergences, providing tight composition bounds for subsampled mechanisms.

Gaussian Differential Privacy (GDP) characterizes privacy guarantees by limiting the trade-off between Type I and Type II errors in a hypothesis test determining whether a specific individual's data was included in a computation. Unlike pure differential privacy, GDP is defined via the trade-off function between two probability distributions, making it a natural fit for analyzing the subsampled Gaussian mechanism central to DP-SGD. This approach yields exact privacy accounting rather than relying on loose over-approximations.

A key advantage of GDP is its central limit theorem for privacy, which states that the composition of many "private" mechanisms converges precisely to a Gaussian differential privacy guarantee. This property eliminates the need for complex moment accountants like those used in Rényi DP, providing tight, closed-form bounds on the cumulative privacy budget (epsilon). The framework is particularly powerful for analyzing iterative algorithms where Poisson sampling amplifies privacy, enabling practitioners to accurately track privacy expenditure across thousands of training steps.

PRIVACY FRAMEWORK

Key Features of Gaussian Differential Privacy

Gaussian Differential Privacy (GDP) provides a rigorous hypothesis-testing interpretation of privacy loss, offering tight and exact composition bounds for subsampled mechanisms that are critical for deep learning.

01

Hypothesis Testing Foundation

GDP defines privacy through the lens of hypothesis testing. It characterizes the difficulty of distinguishing between two neighboring datasets by bounding the trade-off between Type I (false positive) and Type II (false negative) errors. This is formalized using trade-off functions, providing an operational interpretation of the privacy guarantee.

02

f-Divergence Characterization

The framework leverages f-divergences to measure the discrepancy between output distributions. A mechanism satisfies μ-GDP if the trade-off function is bounded by the trade-off function of a Gaussian distribution. This connection allows for the use of powerful information-theoretic tools to analyze privacy loss.

03

Tight Composition Theorems

GDP provides a Central Limit Theorem (CLT) for privacy. When composing many independent differentially private mechanisms, the overall privacy loss converges precisely to a Gaussian trade-off function. This avoids the looseness of standard composition theorems, enabling more accurate privacy accounting.

04

Exact Subsampling Amplification

A key advantage of GDP is its ability to handle subsampling with exact analytical formulas. The privacy amplification from Poisson subsampling is characterized precisely, without the numerical integration or approximations required in other frameworks. This is essential for the tight accounting of DP-SGD.

05

Conversion to (ε, δ)-DP

GDP can be seamlessly converted to the classical (ε, δ)-differential privacy definition. A μ-GDP mechanism satisfies (ε, δ)-DP for a continuum of (ε, δ) pairs defined by a specific functional relationship. This allows practitioners to report guarantees in the more widely recognized standard while benefiting from GDP's tight composition.

06

Privacy Accountant Implementation

The analytical tractability of GDP makes it ideal for implementation as a privacy accountant. Libraries like Opacus use GDP-based accounting to track the cumulative privacy budget (μ) during training. The accountant computes the exact μ after each step, stopping training when the target privacy level is reached.

PRIVACY FRAMEWORK COMPARISON

GDP vs. Classical Differential Privacy Definitions

A technical comparison of Gaussian Differential Privacy against traditional DP definitions across key operational and compositional properties.

PropertyPure DP (ε, 0)Approximate DP (ε, δ)Gaussian DP (μ)

Divergence Metric

Max divergence

Max divergence with δ-slack

Trade-off function (f-divergence)

Privacy Parameter

ε (epsilon)

ε, δ (delta)

μ (mean of trade-off curve)

Composition Model

Basic linear (kε)

Advanced composition (O(√k) ε)

Exact Central Limit Theorem

Subsampling Amplification

Exact but complex

Moments accountant required

Exact analytical formula

Hypothesis Testing Interpretation

Tightness for Gaussian Mechanism

Loose bound

Moderate bound

Tight (exact characterization)

Numerical Composition Tool

Simple summation

Moments Accountant (RDP)

Privacy loss distribution

Interpretability

Strong semantic meaning

δ often misunderstood

Single parameter with operational meaning

GAUSSIAN DIFFERENTIAL PRIVACY

Frequently Asked Questions

Clear answers to common questions about the hypothesis-testing framework for differential privacy, its tight composition bounds, and its relationship to classical privacy definitions.

Gaussian Differential Privacy (GDP) is a privacy framework that characterizes the privacy loss of a randomized algorithm using hypothesis testing and f-divergences. Unlike classical differential privacy which bounds the max divergence of output distributions, GDP measures privacy through the trade-off between Type I and Type II errors in determining whether a specific individual's data was included in the input. The framework centers on the trade-off function f(P, Q), which maps false positive rates to false negative rates when distinguishing between two neighboring datasets. A mechanism satisfies μ-GDP if distinguishing its outputs is at least as hard as distinguishing between N(0,1) and N(μ,1). This single-parameter characterization provides tight composition bounds and naturally handles subsampled mechanisms, making it particularly powerful for analyzing iterative algorithms like DP-SGD.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.