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).
Glossary
Rényi Differential Privacy

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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
| Feature | Ré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 |
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.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Rényi Differential Privacy (RDP) provides a tighter composition framework for tracking privacy loss. These related concepts form the mathematical and operational backbone of modern differentially private machine learning.
Moments Accountant
The Moments Accountant is the privacy accounting algorithm that made RDP practical for deep learning. It tracks the moment-generating function of the privacy loss random variable at multiple orders (α), enabling the computation of tight bounds on the overall privacy cost after many iterations of DP-SGD.
- Computes the log moment for each α at every training step
- Converts accumulated RDP guarantees to standard (ε, δ)-DP bounds
- Provides significantly tighter composition than basic or advanced composition theorems
- Enables training deep neural networks with meaningful privacy guarantees
Privacy Loss Distribution
The Privacy Loss Distribution characterizes the full probabilistic behavior of the privacy loss random variable when a mechanism is applied to adjacent datasets. Rather than relying on worst-case bounds, it captures the entire distribution of possible privacy losses.
- Defined as the log-ratio of output probabilities on adjacent datasets
- Rényi divergence of order α is the α-moment of this distribution
- Tails of the distribution determine the (ε, δ)-DP parameters
- Precise characterization enables tight privacy accounting without overestimating risk
Subsampling Amplification
Subsampling amplification is a phenomenon where randomly selecting a subset of data before applying a differentially private mechanism yields a stronger overall privacy guarantee. Under RDP, subsampling provides a privacy amplification by sampling effect.
- If a mechanism satisfies (α, ε)-RDP, applying it to a random q-fraction subsample yields improved bounds
- The amplified RDP parameter depends on the sampling probability q and the order α
- Essential for DP-SGD, where each step operates on a random mini-batch
- Enables training on large datasets with per-example privacy guarantees
Gaussian Mechanism
The Gaussian Mechanism is the fundamental building block for achieving Rényi differential privacy. It adds isotropic Gaussian noise calibrated to the L2 sensitivity of the query function.
- For a function f with L2 sensitivity Δ₂, adding noise from N(0, σ²) achieves (α, αΔ₂²/2σ²)-RDP
- The RDP parameter grows linearly with the order α
- Forms the noise injection step in DP-SGD after per-sample gradient clipping
- Preferred over the Laplace mechanism for high-dimensional queries due to L2 sensitivity scaling
Privacy Budget (Epsilon Budget)
The Privacy Budget is the cumulative limit on privacy loss that a system is permitted to expend. RDP provides a more accurate ledger for tracking this expenditure across composed mechanisms.
- Parameterized by ε (privacy loss) and δ (failure probability)
- RDP tracks privacy loss at multiple orders α simultaneously
- Conversion from RDP to (ε, δ)-DP allows selecting the optimal α for the tightest bound
- Exceeding the budget triggers training termination or data access restrictions
Differentially Private SGD (DP-SGD)
DP-SGD is the training algorithm where Rényi differential privacy finds its most critical application. It modifies standard stochastic gradient descent by clipping per-sample gradients and adding Gaussian noise, with RDP providing the tight composition analysis.
- Per-sample gradient clipping bounds the L2 sensitivity to a fixed constant C
- Gaussian noise with scale σ is added to the summed clipped gradients
- The Moments Accountant tracks RDP loss across thousands of training iterations
- Enables training deep neural networks with provable membership inference resistance

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us