Poisson sampling is a probabilistic selection method where each data record is independently chosen for a training batch with a fixed probability q, rather than shuffling and partitioning the dataset into deterministic batches. This independence is critical because it creates uncertainty about whether any specific record participated in a given training step, forming the mathematical basis for privacy amplification by subsampling in the subsampled Gaussian mechanism.
Glossary
Poisson Sampling

What is Poisson Sampling?
Poisson sampling is a subsampling method used in DP-SGD where each example is independently included in a batch with a fixed probability, enabling privacy amplification via the subsampled Gaussian mechanism.
Under the DP-SGD framework, the privacy accountant tracks the amplified privacy loss, which is significantly tighter than processing the full dataset. The Rényi Differential Privacy (RDP) accountant computes the composition of multiple Poisson-sampled Gaussian mechanisms, yielding a total privacy budget (epsilon) that scales with O(q * sqrt(T)) rather than O(sqrt(T)), where T is the number of training iterations.
Frequently Asked Questions
Clear, technical answers to the most common questions about Poisson sampling and its critical role in amplifying privacy guarantees within differentially private machine learning workflows.
Poisson sampling is a probabilistic subsampling method where each data example in a training set is independently included in a batch with a fixed probability q, determined by a coin flip for every record. Unlike deterministic shuffling, this process creates a random batch size that follows a binomial distribution. In the context of differentially private stochastic gradient descent (DP-SGD), this specific randomness is the engine of privacy amplification by subsampling. Because an adversary cannot definitively know if a specific record contributed to a model update, the formal privacy guarantee is significantly strengthened. The mechanism works by first selecting a subset via independent Bernoulli trials, then applying the Gaussian mechanism to the aggregated gradient of that subset, making it much harder to isolate a single user's contribution.
Key Properties of Poisson Sampling
Poisson sampling is the stochastic engine behind the privacy amplification of DP-SGD. By flipping a coin for every data point, it creates the uncertainty that makes differential privacy computationally feasible.
The Subsampling Mechanism
In Poisson sampling, each example in a dataset is independently included in a batch with a fixed probability q. This contrasts with uniform random shuffling, where batch membership is correlated. The independence of the coin flips is the critical property that enables tight privacy accounting. A batch is formed by iterating over the entire dataset and accepting each record with probability q, resulting in variable batch sizes with an expected size of qN.
Privacy Amplification by Subsampling
The core value of Poisson sampling is privacy amplification. A mechanism that is (ε, δ)-differentially private becomes significantly more private when applied to a random subset. Specifically, applying a Gaussian mechanism to a Poisson-sampled batch yields an amplified privacy guarantee of roughly O(qε, qδ). This means an adversary is uncertain whether a specific record's influence came from its inclusion in the batch or from the random noise, as the record might not have been sampled at all.
Tight Accounting with RDP and GDP
Modern privacy accountants like Rényi Differential Privacy (RDP) and Gaussian Differential Privacy (GDP) are essential for Poisson sampling. They provide tight, closed-form expressions for the privacy loss of a subsampled Gaussian mechanism. Unlike basic composition theorems, these frameworks precisely track the moment accountant's bounds, preventing overestimation of the privacy budget (ε). This allows for more training iterations under a fixed privacy spend.
Variable Batch Size Dynamics
Unlike fixed-size batching, Poisson sampling produces variable batch sizes following a binomial distribution. This variance is a feature, not a bug, as it adds another layer of uncertainty for an adversary. However, it requires the DP-SGD implementation to handle dynamic tensor shapes. The expected batch size qN is the primary tuning knob, balancing privacy amplification (lower q) against training stability and convergence speed (higher q).
Distinction from Uniform Sampling
Standard SGD with uniform random shuffling (sampling without replacement) creates dependent batches where the presence of one example excludes another. This correlation complicates privacy analysis and yields looser bounds. Poisson sampling (sampling with replacement) ensures complete independence between all inclusion events, which is the mathematical property that unlocks the tightest privacy amplification theorems and is the standard for state-of-the-art DP-SGD implementations.
Subsampled Gaussian Mechanism
The combination of Poisson sampling and Gaussian noise addition is formally known as the Subsampled Gaussian Mechanism. It is the foundational building block of DP-SGD. The process follows a strict sequence:
- Step 1: Sample a batch using independent Bernoulli trials with probability q.
- Step 2: Compute per-sample gradients for the sampled batch.
- Step 3: Clip each gradient to an L2 norm bound C.
- Step 4: Sum the clipped gradients and add Gaussian noise with scale σC. This sequence provides the formal (ε, δ) guarantee.
Poisson Sampling vs. Uniform Shuffling
Comparison of the two primary subsampling methods used in DP-SGD for privacy amplification, detailing their statistical properties and operational trade-offs.
| Feature | Poisson Sampling | Uniform Shuffling | Deterministic Batching |
|---|---|---|---|
Selection Mechanism | Each example included independently with fixed probability q | Dataset randomly permuted then partitioned into fixed-size batches | Dataset partitioned into fixed sequential batches without randomization |
Privacy Amplification | Strong amplification via subsampled Gaussian mechanism | Amplification via shuffle model; tighter bounds than deterministic | No amplification; privacy loss equivalent to full dataset processing |
Batch Size Variability | Variable; follows Binomial(n, q) distribution | Fixed; all batches equal size except possibly the last | Fixed; all batches equal size except possibly the last |
Per-Example Selection Probability | Exactly q for every example in every epoch | Exactly 1 per epoch; each example appears in exactly one batch | Exactly 1 per epoch; each example appears in exactly one batch |
Privacy Accounting Complexity | Tight RDP/GDP composition; well-characterized moments accountant | Requires shuffle model accounting; more complex than Poisson | Standard composition; no subsampling benefit |
Implementation Complexity | Requires per-example random sampling per batch | Requires global shuffle per epoch; simpler data pipeline | Simplest; no randomization required |
Epsilon Reduction at epsilon=1 | ~4x reduction vs. no subsampling at q=0.01 | ~2-3x reduction vs. deterministic; depends on shuffle analysis | Baseline; no reduction |
Typical Use Case | Theoretical privacy research; tightest DP guarantees | Practical federated and centralized DP training | Non-private training; deprecated for privacy-sensitive applications |
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
Poisson sampling is a cornerstone of privacy amplification in DP-SGD. These related concepts define the mathematical guarantees, alternative mechanisms, and defensive context surrounding subsampled privacy.
Privacy Amplification by Subsampling
The core phenomenon that makes Poisson sampling powerful. When a differentially private mechanism is applied to a random subset of the data rather than the full dataset, the privacy guarantee is amplified—the effective epsilon becomes significantly smaller. This occurs because an adversary cannot be certain whether a specific record's information appeared in the output, as the record may not have been sampled at all. The amplification factor is approximately proportional to the sampling rate q, enabling much stronger privacy for the same noise level.
Subsampled Gaussian Mechanism
The formal name for the privacy analysis of applying Gaussian noise to a randomly sampled batch. In DP-SGD, Poisson sampling selects each example with probability q = B/N (batch size over dataset size), and Gaussian noise is added to the aggregated gradient. The privacy guarantee is computed by analyzing the worst-case privacy loss across all possible neighboring datasets under this subsampled noise injection. Tight accounting for this mechanism is essential for accurate privacy budget tracking.
Rényi Differential Privacy (RDP)
A relaxation of pure differential privacy based on Rényi divergence that provides tight composition bounds for iterative algorithms. RDP is commonly used to track privacy loss in DP-SGD with Poisson sampling because it handles the subsampled Gaussian mechanism elegantly. The privacy accountant computes the RDP guarantee at each order alpha, then converts to a standard (ε, δ)-DP bound at the end of training.
Shuffle Model Privacy
An alternative amplification approach where a trusted shuffler randomly permutes user submissions before the aggregator processes them. Shuffling provides privacy amplification comparable to subsampling: if each user applies local differential privacy with epsilon ε₀, the shuffler amplifies the total guarantee to approximately O(ε₀/√n). This model bridges the gap between local and central DP, and can be combined with Poisson sampling for layered amplification.

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