Inferensys

Glossary

Rényi Differential Privacy

Rényi Differential Privacy (RDP) is a relaxation of standard differential privacy based on Rényi divergence that provides tighter, more accurate composition bounds for tracking cumulative privacy loss in iterative algorithms like DP-SGD.
Stylish WeWork-like workspace with hot desks and document wall, professional searching through enterprise knowledge base on a mounted ultrawide display, warm industrial pendants overhead.
PRIVACY ACCOUNTING

What is Rényi Differential Privacy?

A relaxation of standard differential privacy based on Rényi divergence that provides tighter composition bounds and is commonly used for tracking privacy loss in DP-SGD.

Rényi Differential Privacy (RDP) is a privacy definition based on Rényi divergence that generalizes standard differential privacy to provide strictly tighter and more accurate composition bounds. Instead of tracking the single privacy loss parameter epsilon, RDP tracks a curve of privacy loss across multiple orders of the divergence parameter alpha, enabling precise accounting of cumulative privacy expenditure during iterative algorithms like Differentially Private Stochastic Gradient Descent (DP-SGD).

The key advantage of RDP over traditional Moments Accountant methods is its mathematical simplicity and composability. Privacy loss under RDP adds linearly across sequential mechanisms, and the framework cleanly handles the subsampling amplification inherent in mini-batch training. A final conversion step translates the accumulated RDP guarantee back into a standard (epsilon, delta)-differential privacy bound, making it the dominant privacy accounting technique in modern machine learning frameworks.

PRIVACY ACCOUNTING

Key Properties of Rényi Differential Privacy

Rényi Differential Privacy (RDP) provides a tighter, more flexible framework for tracking privacy loss in iterative algorithms like DP-SGD compared to standard (ε, δ)-differential privacy.

01

Rényi Divergence Foundation

RDP is based on Rényi divergence of order α, a measure of the difference between two probability distributions. A mechanism M satisfies (α, ε)-RDP if the Rényi divergence between the outputs on adjacent datasets is bounded by ε. This provides a moment-based view of privacy loss, capturing the entire distribution of the privacy loss random variable rather than just a tail bound.

02

Tight Composition

RDP's primary advantage is its tight composition theorem. When composing multiple RDP mechanisms, the privacy parameters simply add: applying mechanism M₁ with (α, ε₁)-RDP and M₂ with (α, ε₂)-RDP yields a combined (α, ε₁+ε₂)-RDP guarantee. This avoids the advanced composition overhead of standard DP, providing significantly tighter bounds for iterative training.

03

Conversion to Standard DP

RDP guarantees can be converted to standard (ε, δ)-DP at any point. For a given (α, ε)-RDP mechanism, the conversion yields (ε + (log 1/δ)/(α-1), δ)-DP. This allows practitioners to optimize the privacy budget in RDP space and convert to the more interpretable standard DP only when reporting final guarantees.

04

Gaussian Mechanism Under RDP

The Gaussian mechanism has a natural and exact RDP characterization. Adding Gaussian noise with variance σ² to a function with L2-sensitivity Δ yields (α, αΔ²/(2σ²))-RDP. This clean relationship makes RDP the preferred accounting method for DP-SGD, which relies heavily on Gaussian noise injection.

05

Subsampling Amplification

RDP handles subsampling amplification elegantly. When a mechanism is applied to a random subset of data, the RDP parameter is amplified by a factor dependent on the sampling rate q. For Poisson subsampling with rate q, the amplified RDP parameter is approximately O(q²αε) for small q, providing a significant privacy boost.

06

Moments Accountant Connection

The Moments Accountant, introduced by Abadi et al. for DP-SGD, is essentially an RDP accountant. It tracks the moment-generating function of the privacy loss random variable at multiple orders α, computing the tightest possible bound. RDP formalizes this approach, providing a unified mathematical framework for moment-based accounting.

PRIVACY FRAMEWORK COMPARISON

Rényi DP vs. Standard Differential Privacy

A technical comparison of Rényi Differential Privacy (RDP) against standard (ε, δ)-Differential Privacy across key operational dimensions for privacy accounting and composition.

FeatureRényi DP (RDP)Standard (ε, δ)-DP

Divergence Metric

Rényi divergence of order α

Max divergence (ε) with δ-failure probability

Privacy Loss Random Variable

Moment-generating function (MGF)

Tail bound on privacy loss

Composition Accounting

Additive in Rényi divergence; tighter bounds

Advanced composition theorem; looser bounds

Conversion to (ε, δ)-DP

Yes, via Proposition 3 of Mironov (2017)

Natively expressed as (ε, δ)

Gaussian Mechanism Calibration

Exact closed-form RDP parameter

Requires numerical composition for tightness

Subsampling Amplification

Tight analytical bounds via RDP

Requires privacy amplification by sampling theorems

Use in DP-SGD Accounting

Primary method (Moments Accountant is RDP-based)

Legacy; superseded by RDP-based accounting

Interpretability

Less intuitive; α-order parameter

More intuitive; ε is direct privacy loss bound

RÉNYI DP EXPLAINED

Frequently Asked Questions

Clear, technically precise answers to the most common questions about Rényi Differential Privacy and its role in modern privacy accounting.

Rényi Differential Privacy (RDP) is a relaxation of standard (ε, δ)-differential privacy that uses Rényi divergence to measure the similarity between output distributions on adjacent datasets. Unlike standard DP, which provides a worst-case bound on the privacy loss random variable, RDP parameterizes privacy loss by an order α > 1, offering a spectrum of guarantees. This formulation provides tighter composition bounds when tracking privacy loss over many iterations, making it the preferred accounting method for algorithms like Differentially Private Stochastic Gradient Descent (DP-SGD). The key operational difference is that RDP converts to standard (ε, δ)-DP after composition, yielding a significantly smaller ε for the same noise scale compared to basic composition theorems.

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.