betaFeedback

WorksMathematics

Differentially Private Confidence Intervals for Relative Risk and Odds Ratio

Abstract

Ratio statistics, such as relative risk and odds ratio, are central tools for comparing outcome probabilities across populations, particularly in clinical and epidemiological studies. However, when the underlying counts are released under differential privacy, the resulting ratio estimators can exhibit nontrivial bias and variance, and principled methods for statistical inference in this setting remain limited. In this work, we study estimation and inference for ratio statistics computed from counts perturbed by additive Laplace or Gaussian noise. We show that the natural plug-in estimators based on privatized counts are consistent, and we derive confidence intervals that explicitly account for both sampling variability and privacy-induced noise, making our approach appealing for moderate sample sizes. Our analysis provides transparent variance decompositions that clarify when privacy meaningfully affects inference. Empirical results on simulated and real datasets demonstrate that, for moderate privacy levels and sample sizes, the proposed confidence intervals closely match their non-private counterparts, while properly reflecting additional uncertainty in small-sample regimes. Our results provide both theoretical guarantees and practical guidance for conducting statistical inference with ratio statistics under differential privacy.

Introduction

In many practical settings, analysts do not design the privacy mechanism themselves. Instead, they receive counts that have already been perturbed to satisfy differential privacy (DP), for example, by a statistical agency, hospital, or data curator, and must carry out standard downstream analyses using these noisy releases. A common example is the analysis of 2×22 \times2 contingency tables, where one wishes to compare event probabilities across two groups using ratio statistics such as the relative risk (RR) and the odds ratio (OR). These quantities are central in clinical trials, epidemiology, and public health, and they also arise broadly whenever event rates are compared across populations.

This raises a basic practical question: if the underlying counts have already been privatized, can one still form statistically meaningful estimates and confidence intervals (CIs) for RR and OR by plugging in the noisy counts? Since ratio statistics can be unstable when denominators are small, and since additive DP noise further perturbs the relevant counts, it is not a priori clear when such post-processed estimators remain reliable.

This paper is meant as a practical guide to that question. We study estimation and inference for RR and OR when the underlying counts are released under additive DP noise. We prove consistency of the private plug-in estimators (Lemma 1), derive asymptotically valid CIs under Gaussian perturbation (Theorems 2–4), and show how the same formulas extend naturally to Laplace noise by variance substitution. Our variance expressions separate sampling- and privacy-induced variability (Table 1), yielding a simple, practical rule: privacy has limited impact when effective cell counts are large, and becomes consequential mainly in sparse regimes. Our main message is simple: privacy has the largest effect precisely where inference was already difficult to begin with. Simulations and real-data examples (§ 4) support this picture, showing that, for moderate privacy levels and sample sizes, the private CIs are typically close to their non-private counterparts.

StatisticSampling errorPerturbation error
Log RR1X~−1nx+1Y~−1ny\frac{1}{\widetilde{X}}-\frac{1}{n_x}+\frac{1}{\widetilde{Y}}-\frac{1}{n_y}σ2(1X~2+1Y~2)\sigma^2\left(\frac{1}{\widetilde{X}^2}+\frac{1}{\widetilde{Y}^2}\right)
RR(X~/nxY~/ny)2(1X~−1nx+1Y~−1ny)\left(\frac{\widetilde{X}/n_x}{\widetilde{Y}/n_y}\right)^2\left(\frac{1}{\widetilde{X}}-\frac{1}{n_x}+\frac{1}{\widetilde{Y}}-\frac{1}{n_y}\right)σ2(X~/nxY~/ny)2(1X~2+1Y~2)\sigma^2\left(\frac{\widetilde{X}/n_x}{\widetilde{Y}/n_y}\right)^2\left(\frac{1}{\widetilde{X}^2}+\frac{1}{\widetilde{Y}^2}\right)
Log OR1X~+1nx−X~+1Y~+1ny−Y~\frac{1}{\widetilde{X}}+\frac{1}{n_x-\widetilde{X}}+\frac{1}{\widetilde{Y}}+\frac{1}{n_y-\widetilde{Y}}σ2[(1X~+1nx−X~)2+(1Y~+1ny−Y~)2]\sigma^2\left[\left(\frac{1}{\widetilde{X}}+\frac{1}{n_x-\widetilde{X}}\right)^2+\left(\frac{1}{\widetilde{Y}}+\frac{1}{n_y-\widetilde{Y}}\right)^2\right]

Table 1. Decomposition of the asymptotic variances in Theorems 2–4 into sampling and perturbation components.

Related work. Our perspective is closely connected to a growing literature on inference from privatized low-dimensional summaries. A substantial body of work studies DP methods for frequency tables and related contingency-table problems [4, 12, 17, 7, 2]. More recently, the deployment of DP in official statistics, especially by the U.S. Census Bureau for the 2020 Census, has sharpened attention on the needs of analysts who must consume already-noised releases and understand how privacy propagates into downstream estimands [10, 11, 14]. Our work fits squarely into this consumer-of-DP-data viewpoint.

Most closely related to our work is a paper by Lin et al. [8], wherein they study the problem of constructing CIs around proportion estimates when using stratified random sampling techniques under DP constraints. In situations where the denominator of their proportion estimate (the size of the relevant sample) is private information, they consider adding Gaussian noise for DP to both the numerator and the denominator. As a result, they end up with a mathematical object—a ratio of two Gaussian random variables—that is also central to our analysis. They provide a detailed analysis of this ratio and derive an asymptotically valid CI. In § 3, we use proof techniques similar to those of [8] to obtain another DP-CI for the RR (Theorem 4).

A longer version of this work appears on arXiv [15]. The full version includes additional mechanisms and extensions, including direct perturbation of the ratio, transformed estimators, local-sensitivity-based approaches, and a more detailed treatment of bias and finite-sample behavior.

Preliminaries

Unless stated otherwise, P\mathbb{P} denotes probability with respect to the joint distribution over all sources of randomness. We use →p\xrightarrow{p} for convergence in probability, and →d\xrightarrow{d} for convergence in distribution. Throughout the paper, non-private estimators are denoted by ⋅^\hat{\cdot} and their differentially private counterparts by ⋅~\tilde{\cdot}.

The Relative Risk and Odds Ratio Statistics

The relative risk (RR) and odds ratio (OR) are fundamental measures for comparing outcome probabilities between two groups. The RR quantifies the multiplicative change in the probability of an event, while the OR compares the corresponding odds. When event probabilities are small, the two measures are numerically similar, but they may differ substantially when probabilities are moderate or large. The RR is often preferred for interpretability in clinical settings, whereas the OR arises naturally in logistic modeling and case–control studies; see Agresti [1] for background.

We suppose that XX and YY are independent binomial random variables, X∼Bin⁡(nx,px)X \sim\operatorname{Bin}(n_x,p_x) and Y∼Bin⁡(ny,py)Y \sim\operatorname{Bin}(n_y,p_y), where px,py∈(0,1)p_x,p_y \in(0,1) and nx,ny∈Nn_x,n_y \in\mathbb{N} with nx+ny=nn_x+n_y=n. The sample sizes nxn_x and nyn_y are assumed known. Our goal is to estimate either RR:=px/py\mathrm{RR}:=p_x/p_y or OR:=px/(1−px)py/(1−py)\mathrm{OR}:=\frac{p_x/(1-p_x)}{p_y/(1-p_y)}.

Let p^x:=X/nx\widehat{p}_x:=X/n_x and p^y:=Y/ny\widehat{p}_y:=Y/n_y denote the maximum likelihood estimators of pxp_x and pyp_y. The corresponding plug-in estimators are

RR^:=p^x/p^yandOR^:=p^x/(1−p^x)p^y/(1−p^y).\widehat{\mathrm{RR}}:=\widehat{p}_x/\widehat{p}_y \qquad\text{and}\qquad \widehat{\mathrm{OR}}:=\frac{\widehat{p}_x/(1-\widehat{p}_x)}{\widehat{p}_y/(1-\widehat{p}_y)}.

These estimators are biased on finite samples but consistent for their respective population parameters; see, for example, van der Vaart [16].

To quantify uncertainty, one typically constructs CIs.

Definition 1 (Confidence Interval). Let FθF_\theta be a distribution on R\mathbb{R} and let X=(X1,…,Xn)X=(X_1,\ldots,X_n) be an i.i.d. sample from FθF_\theta. A (1−α)(1-\alpha) confidence interval for θ\theta is a data-dependent interval (u(X),v(X))(u(X),v(X)) satisfying

lim⁡n→∞P(u(X)≤θ≤v(X))=1−α,\lim_{n\to\infty}\mathbb{P}(u(X)\le\theta\le v(X))=1-\alpha,

where probability is taken with respect to both the sampling randomness and any additional randomness in u(⋅)u(\cdot) and v(⋅)v(\cdot).

Classical large-sample CIs for RR and OR are typically derived via normal approximations and the delta method; see Agresti [1, Ch. 2].

Differential privacy

We briefly review the notions from differential privacy that are used throughout the paper; see Dwork and Roth [6] for a comprehensive treatment.

Let X\mathcal{X} be a data domain. An unordered dataset of size nn is represented as a tuple D=(D1,…,Dn)∈XnD=(D_1,\ldots,D_n)\in\mathcal{X}^n, where nn is assumed public. Two datasets D,D′∈XnD,D'\in\mathcal{X}^n are called neighbors, written D∼D′D\sim D', if they differ in exactly one entry. DP requires that the output distribution of a randomized algorithm not change too much when applied to neighboring datasets.

Definition 2 (Differential privacy). A randomized algorithm M:Xn→Y\mathcal{M}:\mathcal{X}^n\to\mathcal{Y} is (ε,δ)(\varepsilon,\delta)-differentially private if for all neighboring datasets D∼D′D\sim D' and all measurable sets S⊆YS\subseteq\mathcal{Y}, P(M(D)∈S)≤eεP(M(D′)∈S)+δ\mathbb{P}(\mathcal{M}(D)\in S)\le e^\varepsilon\mathbb{P}(\mathcal{M}(D')\in S)+\delta.

Smaller values of ε\varepsilon and δ\delta correspond to stronger privacy guarantees. Two basic properties of DP are especially relevant in practice: privacy guarantees are preserved under arbitrary post-processing of the released output, and they degrade in a controlled way under composition of multiple private mechanisms; see Proposition 2.1 and Theorem 3.14 in [6]. The post-processing property is particularly important for our purposes, since throughout the paper we analyze ratio statistics constructed from already-privatized counts.

A standard way to ensure differential privacy for numerical queries is to add random noise calibrated to the query’s sensitivity. For f:Xn→Rkf:\mathcal{X}^{n}\to\mathbb{R}^{k}, define the ℓ1\ell_{1}- and ℓ2\ell_{2}-sensitivities by Δf,1:=max⁡D∼D′∥f(D)−f(D′)∥1\Delta_{f,1}:=\max_{D\sim D'}\lVert f(D)-f(D')\rVert_{1}, Δf,2:=max⁡D∼D′∥f(D)−f(D′)∥2\Delta_{f,2}:=\max_{D\sim D'}\lVert f(D)-f(D')\rVert_{2}. The following two classical additive-noise mechanisms will be used throughout.

Theorem 1 (Laplace and Gaussian mechanisms). Let f:Xn→Rkf:\mathcal{X}^{n}\to\mathbb{R}^{k}. Consider mechanisms of the form Mf(D)=f(D)+WM_f(D)=f(D)+W, where W∈RkW\in\mathbb{R}^{k} is a random noise vector independent of the data. Then the following guarantees hold.

  • Laplace mechanism: If W=(W1,…,Wk)W=(W_1,\ldots,W_k) has independent coordinates with Wj∼Lap⁡(Δf,1/ε)W_j\sim\operatorname{Lap}(\Delta_{f,1}/\varepsilon), j=1,…,kj=1,\ldots,k, then MfM_f is (ε,0)(\varepsilon,0)-DP [6 Thm. 3.6].

  • Gaussian mechanism: If W∼N(0,σ2Ik)W\sim\mathcal{N}(0,\sigma^{2}I_k), then MfM_f is (ε,δ)(\varepsilon,\delta)-DP if and only if Φ(Δf,22σ−εσΔf,2)−eεΦ(−Δf,22σ−εσΔf,2)≤δ\Phi\left(\frac{\Delta_{f,2}}{2\sigma}-\frac{\varepsilon\sigma}{\Delta_{f,2}}\right)-e^{\varepsilon}\Phi\left(-\frac{\Delta_{f,2}}{2\sigma}-\frac{\varepsilon\sigma}{\Delta_{f,2}}\right)\leq\delta, where Φ\Phi is the standard normal cumulative distribution function [3 Thm. 8].

Theoretical results

In this section, we characterize the joint impact of sampling variability and privacy-induced noise on the RR and OR. While classical CIs remain asymptotically valid when privacy perturbations are of a lower order than sampling error, they become insufficient in finite-sample regimes where privacy noise significantly alters the error distribution. We derive CIs for both RR and OR under Gaussian noise and establish their asymptotic validity. Finally, we demonstrate how this construction extends to the Laplace mechanism, providing a general framework for inference with privatized count data.

Setting

We consider independent binomial random variables X∼Bin⁡(nx,px)X\sim\operatorname{Bin}(n_x,p_x) and Y∼Bin⁡(ny,py)Y\sim\operatorname{Bin}(n_y,p_y) with px,py∈(0,1)p_x,p_y\in(0,1) and known sample sizes nx,ny>1n_x,n_y>1. Privatized counts are released as X~=X+Nx\widetilde{X}=X+N_x and Y~=Y+Ny\widetilde{Y}=Y+N_y, where (Nx,Ny)(N_x,N_y) are independent of (X,Y)(X,Y) and of each other.

Our analysis uses replacement adjacency: the sample sizes nxn_x and nyn_y are treated as public, and neighboring databases differ in the event of one individual. If nx,nyn_x,n_y are not public, one could instead estimate them privately, using part of the privacy budget. The RR and OR estimators could then be computed by post-processing these noisy counts. The resulting CIs would need to account for the additional uncertainty, but this extension does not conceptually change our results and is therefore omitted due to space limitations.

In this section, whenever we write p→p \to, d→d \to, O(⋅)O(\cdot), or o(⋅)o(\cdot), the asymptotic regime is understood to be nx→∞n_x \to\infty, ny→∞n_y \to\infty, nxnx+ny→λ∈(0,1)\frac{n_x}{n_x+n_y} \to\lambda\in(0,1).

We consider either (i) Laplace noise Nx∼Lap⁡(bx)N_x \sim\operatorname{Lap}(b_x), Ny∼Lap⁡(by)N_y \sim\operatorname{Lap}(b_y) or (ii) Gaussian noise Nx∼N(0,σx2)N_x \sim\mathcal{N}(0,\sigma_x^2), Ny∼N(0,σy2)N_y \sim\mathcal{N}(0,\sigma_y^2), with parameters calibrated according to Theorem 1. We consider Var⁡(Nx)=o(nx2)\operatorname{Var}(N_x)=o(n_x^2) and Var⁡(Ny)=o(ny2)\operatorname{Var}(N_y)=o(n_y^2); equivalently sd⁡(Nx)=o(nx)\operatorname{sd}(N_x)=o(n_x) and sd⁡(Ny)=o(ny)\operatorname{sd}(N_y)=o(n_y). This allows privacy perturbations that may exceed the usual sampling fluctuations of order nx\sqrt{n_x} and ny\sqrt{n_y}, while still guaranteeing consistency. For example, the assumption Var⁡(N)=o(n2)\operatorname{Var}(N)=o(n^2) implies that if we were to use the Laplace mechanism (Theorem 1), we assume that ϵ=ω(n−1)\epsilon=\omega(n^{-1}).

Denote p~x=X~/nx\widetilde{p}_x=\widetilde{X}/n_x and p~y=Y~/ny\widetilde{p}_y=\widetilde{Y}/n_y. To ensure ratios are well defined, all statistics are computed using projected counts X~p=min⁡(max⁡(1,X~),nx−1)\widetilde{X}_p=\min(\max(1,\widetilde{X}),n_x-1) and Y~p=min⁡(max⁡(1,Y~),ny−1)\widetilde{Y}_p=\min(\max(1,\widetilde{Y}),n_y-1).1 Under px,py∈[η,1−η]p_x,p_y\in[\eta,1-\eta] for some fixed η>0\eta>0, together with Var⁡(Nx)=o(nx2)\operatorname{Var}(N_x)=o(n_x^2) and Var⁡(Ny)=o(ny2)\operatorname{Var}(N_y)=o(n_y^2), we have P(X~∉[1,nx−1])+P(Y~∉[1,ny−1])=o(1)\mathbb{P}(\widetilde{X}\notin[1,n_x-1])+\mathbb{P}(\widetilde{Y}\notin[1,n_y-1])=o(1). Thus, clipping affects the statistics with vanishing probability, and we omit the subscript pp for brevity.

With these definitions, we consider the private plug-in estimators

RR~:=p~xp~yOR~:=p~x/(1−p~x)p~y/(1−p~y).(1)\widetilde{RR}:=\frac{\widetilde{p}_x}{\widetilde{p}_y} \qquad \widetilde{OR}:=\frac{\widetilde{p}_x/(1-\widetilde{p}_x)}{\widetilde{p}_y/(1-\widetilde{p}_y)}. \tag*{(1)}

Lemma 1 (Consistency of the perturbed RR and OR). Under the standing assumptions of Subsection 3.1, RR~→pRR\widetilde{RR}\mathrel{\mathop{\to}^{p}}RR and OR~→pOR\widetilde{OR}\mathrel{\mathop{\to}^{p}}OR.

Proof. We write p~x−px=(X−nxpx)/nx+Nx/nx\widetilde{p}_x-p_x=(X-n_xp_x)/n_x+N_x/n_x. By the weak law of large numbers, (X−nxpx)/nx→p0(X-n_xp_x)/n_x\mathrel{\mathop{\to}^{p}}0. Since Var⁡(Nx)=o(nx2)\operatorname{Var}(N_x)=o(n_x^2), Chebyshev’s inequality implies Nx/nx→p0N_x/n_x\mathrel{\mathop{\to}^{p}}0. Hence p~x→ppx\widetilde{p}_x\mathrel{\mathop{\to}^{p}}p_x, and similarly p~y→ppy\widetilde{p}_y\mathrel{\mathop{\to}^{p}}p_y.

The mappings g(u,v)=u/vg(u,v)=u/v and h(u,v)=u/(1−u)v/(1−v)h(u,v)=\frac{u/(1-u)}{v/(1-v)} are continuous at (px,py)(p_x,p_y) when px,py∈(0,1)p_x,p_y\in(0,1). The result follows from the continuous mapping theorem.

Confidence Intervals

We derive asymptotically valid CIs under additive Gaussian noise. All results are stated under the standing assumptions of Subsection 3.1.

For a real-valued statistic TT and standard error estimate se⁡^(T)\widehat{\operatorname{se}}(T), define the Wald-type interval C1−α(T,se⁡^):=[T±z1−α/2se⁡^]C_{1-\alpha}(T,\widehat{\operatorname{se}}):=[T\pm z_{1-\alpha/2}\widehat{\operatorname{se}}], where z1−α/2z_{1-\alpha/2} is the (1−α/2)(1-\alpha/2) quantile of a standard normal.

With this in mind, we now state our main theorems for valid CIs under Gaussian noise addition.

Theorem 2. Under the standing assumptions of Subsection 3.1, define

ℓ~RR=log⁡(X~/nxY~/ny),ℓRR∗=log⁡(pxpy),\widetilde{\ell}_{RR}=\log\left(\frac{\widetilde{X}/n_x}{\widetilde{Y}/n_y}\right),\qquad\ell^*_{RR}=\log\left(\frac{p_x}{p_y}\right),
se⁡^RR2=(1X~−1nx)+(1Y~−1ny)+σx2X~2+σy2Y~2.\widehat{\operatorname{se}}^2_{RR}=\left(\frac{1}{\widetilde{X}}-\frac{1}{n_x}\right)+\left(\frac{1}{\widetilde{Y}}-\frac{1}{n_y}\right)+\frac{\sigma_x^2}{\widetilde{X}^2}+\frac{\sigma_y^2}{\widetilde{Y}^2}.

Then the interval C1−αlog⁡RR:=C1−α(ℓ~RR,se⁡^RR)C^{\log RR}_{1-\alpha}:=C_{1-\alpha}(\widetilde{\ell}_{RR},\widehat{\operatorname{se}}_{RR}) satisfies P(ℓRR∗∈C1−αlog⁡RR)→1−α\mathbb{P}(\ell^*_{RR}\in C^{\log RR}_{1-\alpha})\to1-\alpha. Consequently, C1−αRR:=exp⁡(C1−αlog⁡RR)C^{RR}_{1-\alpha}:=\exp(C^{\log RR}_{1-\alpha}) is an asymptotic (1−α)(1-\alpha) CI for RRRR.

An analogous result can be derived for the OR statistic.

Theorem 3. Under the standing assumptions of Subsection 3.1, define

ℓ~OR=log⁡(X~nx−X~)−log⁡(Y~ny−Y~),ℓOR∗=log⁡(px1−px)−log⁡(py1−py),\widetilde{\ell}_{OR}=\log\left(\frac{\widetilde{X}}{n_x-\widetilde{X}}\right)-\log\left(\frac{\widetilde{Y}}{n_y-\widetilde{Y}}\right),\qquad\ell^*_{OR}=\log\left(\frac{p_x}{1-p_x}\right)-\log\left(\frac{p_y}{1-p_y}\right),
se⁡^OR2=(1X~+1nx−X~)+(1Y~+1ny−Y~)+σx2(1X~+1nx−X~)2+σy2(1Y~+1ny−Y~)2.\widehat{\operatorname{se}}^2_{OR}=\left(\frac{1}{\widetilde{X}}+\frac{1}{n_x-\widetilde{X}}\right)+\left(\frac{1}{\widetilde{Y}}+\frac{1}{n_y-\widetilde{Y}}\right)+\sigma_x^2\left(\frac{1}{\widetilde{X}}+\frac{1}{n_x-\widetilde{X}}\right)^2+\sigma_y^2\left(\frac{1}{\widetilde{Y}}+\frac{1}{n_y-\widetilde{Y}}\right)^2.

Then the interval C1−αlog⁡OR:=C1−α(ℓ~OR,se⁡^OR)C^{\log OR}_{1-\alpha}:=C_{1-\alpha}(\widetilde{\ell}_{OR},\widehat{\operatorname{se}}_{OR}) satisfies P(ℓOR∗∈C1−αlog⁡OR)→1−α\mathbb{P}(\ell^*_{OR}\in C^{\log OR}_{1-\alpha})\to1-\alpha. Consequently, C1−αOR:=exp⁡(C1−αlog⁡OR)C^{OR}_{1-\alpha}:=\exp(C^{\log OR}_{1-\alpha}) is an asymptotic (1−α)(1-\alpha) CI for OROR.

The proofs of Theorems 2 and 3 are given in the Appendix. At a high level, the argument has three steps: first, clipping the noisy counts is asymptotically negligible under px,py∈[η,1−η]p_x,p_y\in[\eta,1-\eta] and σx2=o(nx2)\sigma_x^2=o(n_x^2), σy2=o(ny2)\sigma_y^2=o(n_y^2); second, the privatized counts are asymptotically normal (binomial + independent Gaussian noise); and third, applying the delta method to the log-RR and log-OR yields asymptotic normality with the stated variances. The proposed standard-error formulas are then shown to be consistent plug-in estimators of these asymptotic variances, and Slutsky’s theorem gives the validity of the resulting CIs.

A Direct Normal Confidence Interval for the Relative Risk In addition to the log-scale construction above, we also establish a CI based on a direct normal approximation of the ratio itself. While related in spirit to the approach of [8], our result is tailored to the two-sample setting with known group sizes. For completeness, we state the result below; a full proof appears as Theorem 4.2 in our extended manuscript [15].

Theorem 4 (Direct normal CI for RRRR). Under the standing assumptions of Subsection 3.1, let RR~=X~/nxY~/ny\widetilde{RR}=\frac{\widetilde{X}/n_x}{\widetilde{Y}/n_y}, and define

se⁡^RR2=RR~ 2(1X~−1nx+1Y~−1ny+σx2X~2+σy2Y~2).\widehat{\operatorname{se}}^2_{RR}=\widetilde{RR}^{\,2}\left(\frac{1}{\widetilde{X}}-\frac{1}{n_x}+\frac{1}{\widetilde{Y}}-\frac{1}{n_y}+\frac{\sigma_x^2}{\widetilde{X}^2}+\frac{\sigma_y^2}{\widetilde{Y}^2}\right).

Then the interval C1−αRR:=C1−α(RR~,se⁡^RR)C^{RR}_{1-\alpha}:=C_{1-\alpha}(\widetilde{RR},\widehat{\operatorname{se}}_{RR}) satisfies P(RR∈C1−αRR)→1−α\mathbb{P}(RR\in C^{RR}_{1-\alpha})\to1-\alpha.

Laplace perturbations. The preceding theorems are stated for Gaussian perturbations, for which the privatized counts remain asymptotically normal after variance adjustment. For Laplace perturbations, the same plug-in variance formulas can be used as a finite-sample approximation by replacing σx2,σy2\sigma_x^2,\sigma_y^2 with 2bx2,2by22b_x^2,2b_y^2. Formally, if bx2=o(nx)b_x^2=o(n_x) and by2=o(ny)b_y^2=o(n_y), so that the privacy perturbation is lower order than the sampling error, then the Laplace noise is asymptotically negligible and the resulting intervals remain asymptotically valid. When the Laplace noise is not lower order than the sampling error, asymptotic normality no longer follows from negligibility of the privacy perturbation. In this case, our interval is best understood as a moment-matched Gaussian approximation, obtained by replacing the Laplace noise with Gaussian noise of the same variance.

When does privacy materially affect inference?

A central concern for analysts using DP statistics is whether privacy-induced perturbation can severely reduce statistical power. Our variance formulas (Table 1) show that, in the settings we study, this concern is often less severe than it may first appear.

Table 1 decomposes the asymptotic variance into a sampling component and a perturbation component, for simplicity setting σx=σy:=σ\sigma_x=\sigma_y:=\sigma. The key structural feature is that the sampling terms scale like 1/X~1/\tilde{X} and 1/Y~1/\tilde{Y}, whereas the perturbation terms scale like σ2/X~2\sigma^2/\tilde{X}^2 and σ2/Y~2\sigma^2/\tilde{Y}^2. Thus, for fixed (ε,δ)(\varepsilon,\delta), the sampling standard error decreases at rate O(n−1/2)O(n^{-1/2}), while the additional error due to privacy decreases faster, at rate O(n−1)O(n^{-1}).

This gap in rates has an important consequence. In high-power regimes, where the counts are large, privacy adds only a lower-order term to the overall uncertainty. Conversely, when the privacy term is non-negligible, the sampling variance is already large, meaning that the corresponding non-private statistic is itself unstable. Thus, a large privacy-induced contribution to the interval width should not be interpreted as privacy alone creating the difficulty; rather, it indicates a regime in which the underlying non-private inference is already fragile. Indeed, taking the ratio between the DP CI width (sampling plus perturbation error) and the non-private width (sampling error only), we obtain

WidthDPlog⁡RRWidthNPlog⁡RR≈WidthDPRRWidthNPRR≈1+O(σ2min⁡{nxpx,nypy}).\frac{\mathrm{Width}_{DP}^{\log RR}}{\mathrm{Width}_{NP}^{\log RR}} \approx\frac{\mathrm{Width}_{DP}^{RR}}{\mathrm{Width}_{NP}^{RR}} \approx\sqrt{1+O\left(\frac{\sigma^2}{\min\{n_xp_x,n_yp_y\}}\right)}.

Similarly, for the odds ratio,

WidthDPlog⁡ORWidthNPlog⁡OR≈1+O(σ2min⁡{nxpx(1−px),nypy(1−py)}).\frac{\mathrm{Width}_{DP}^{\log OR}}{\mathrm{Width}_{NP}^{\log OR}} \approx\sqrt{1+O\left(\frac{\sigma^2}{\min\{n_xp_x(1-p_x),n_yp_y(1-p_y)\}}\right)}.

Estimating privacy-induced inflation. The same variance decomposition can also be used as a simple diagnostic after the privatized table has been released. Since both the sampling component and the perturbation component in Table 1 are functions of the released noisy counts and the known noise variance, an analyst can estimate the relative contribution of privacy noise without needing to incur any additional privacy cost. In particular, one can compare the perturbation component to the sampling component. For Laplace perturbations, the same diagnostic is obtained by replacing the Gaussian variance by the Laplace variance. This provides a practical way to assess, from the released table itself, whether the privacy mechanism materially changes the inferential conclusion.

Empirical evaluation

We empirically study the bias of the private estimators, as well as the width and coverage of the proposed CIs, on both simulated and real data. Throughout the simulation study we set nx=nyn_x=n_y for simplicity. We also ran additional experiments with unequal group sizes and observed qualitatively similar behavior; these results are omitted for brevity.

Bias. In general, it is known that the RR and OR non-private estimators are biased. We examine how additive noise further affects this bias. We fix nx=ny=150n_x=n_y=150 and consider three parameter configurations, representing decreasing, null, and increasing signal regimes, (px,py)∈{(1/3,2/3),(1/2,1/2),(2/3,1/3)}(p_x,p_y)\in\{(1/3,2/3),(1/2,1/2),(2/3,1/3)\}. For each configuration and each privacy level ε∈[0.5,2]\varepsilon\in[0.5,2], we run N=105N=10^5 independent repetitions. In each repetition, we generate fresh data X∼Bin⁡(nx,px)X\sim\operatorname{Bin}(n_x,p_x) and Y∼Bin⁡(ny,py)Y\sim\operatorname{Bin}(n_y,p_y), and then independently perturb the counts using either Gaussian or Laplace noise. Gaussian noise is calibrated using the analytic Gaussian mechanism to satisfy (ε,δ)(\varepsilon,\delta)-DP with δ=10−5\delta=10^{-5}, while Laplace noise uses scale b=1/εb=1/\varepsilon (Theorem 1). We then compute the privatized plug-in estimator for RR or OR from the perturbed counts, with projection to [1,n−1][1,n-1], and estimate its expectation by averaging across repetitions. For reference, we also report the mean of the corresponding non-private plug-in estimator and the true parameter value.

Empirical Evaluation

Figure 1 depicts the bias of the private and non-private estimators. The private estimators exhibit a small upward bias relative to their non-private counterparts, particularly in the strong-privacy regime (small ε\varepsilon). As expected, the bias decreases as ε\varepsilon increases. Across all three parameter settings, the private estimators remain close to the non-private ones, and the discrepancy becomes negligible for moderate privacy levels. Notably, under Laplace noise addition, the bias induced by perturbation is of a lower order than the inherent sampling bias. For example, when ε=1.25\varepsilon= 1.25, the bias due to privacy (the gap between the dotted line and the blue line) is negligible, while the bias due to sampling is clearly manifested (the gap between the dotted line and the dashed line).

Empirical mean of the privatized plug-in estimator for RR and OR under Laplace and Gaussian noise addition

Figure 1. Empirical mean of the privatized plug-in estimator for RR and OR (1) under Laplace and Gaussian noise addition. The dashed horizontal line indicates the true parameter value. Top row: RR. Bottom row: OR.

Confidence interval width and coverage. We evaluate the empirical coverage and average width of CIs for both the RR and the OR as functions of the privacy parameter ε\varepsilon under the same setting as in the previous experiment. For RR we compare two interval constructions: one based on Theorem 2, and the second on Theorem 4. For OR, we use Theorem 3. A noiseless baseline (setting the noise variances to zero) is included for reference.

Figures 2(a) and 2(b) summarize the empirical coverage and mean width of the proposed CIs. Across all parameter configurations, the empirical coverage of the private intervals remains close to the nominal level 1−α=0.951 - \alpha= 0.95. The behavior is stable even in asymmetric signal regimes, suggesting that the delta-method-based approximation remains accurate after noise addition.

As expected, the average width of the intervals decreases monotonically with ε\varepsilon. In the strong-privacy regime, perturbation variance dominates, leading to visibly wider intervals. As ε\varepsilon increases, the widths approach those of the noiseless baseline, reflecting the fact that the additional variance from privacy becomes negligible relative to sampling variability. The Gaussian mechanism yields systematically wider intervals than the Laplace mechanism. This is expected, since for small δ\delta the Gaussian noise scale is proportional to log⁡(1/δ)/ε\sqrt{\log(1/\delta)}/\varepsilon, whereas the Laplace scale is proportional to 1/ε1/\varepsilon. With δ=10−5\delta=10^{-5}, this constant factor is non-negligible at moderate sample sizes.

Odds Ratio mean width and coverage plots for three combinations of $p_x$ and $p_y$

Figure 2a. Odds Ratio: Mean width and coverage for CI construction. The dashed horizontal line marks the nominal coverage 1−α1-\alpha.

Relative Risk mean width and coverage plots for three combinations of $p_x$ and $p_y$

Figure 2b. Relative Risk: Mean width and coverage for CI construction. The dashed horizontal line marks the nominal coverage 1−α1-\alpha.

Overall, the simulations confirm the theoretical predictions: even in these relatively small datasets, privacy-induced variability inflates interval width primarily when sampling variability is already substantial, while coverage remains well-controlled across privacy levels.

Real Data Application. In this subsection, we illustrate the practical behavior of the proposed CIs using real 2×22 \times2 contingency tables. We study both the RR and the OR, and compare their non-private and private releases to understand how DP noise affects statistical inference in practice. Since the RR intervals from

Empirical Evaluation

Theorems 4 and 2 lead to very similar conclusions, we report only the interval of Theorem 2 for simplicity.

We consider three representative 2×22 \times2 tables, displayed in Panels (a)–(c) of Table 2. These examples span three different regimes. Panel (a) is a large-sample rare-event table: the total sample size is in the tens of thousands, while the event counts themselves are only in the hundreds. Panel (b) is an intermediate-scale table, with all four cells in the hundreds and a moderate association between exposure and outcome. Panel (c) is a much smaller table, with one cell in the single digits and a strong treatment effect. This progression from large counts, to moderate counts, to very small counts allows us to highlight how the magnitude of the cell counts governs the robustness of private inference. For the case-control table in Panel (b), the odds ratio is the epidemiologically natural estimand; we also report the RR-style plug-in ratio only as a numerical benchmark for the behavior of ratio statistics under privatization.

PanelGroup / Smoking / TreatmentYes / CaseNo / Control
(a)Placebo18910,845
(a)Aspirin10410,933
(b)Ever smoked163150
(b)Never smoked124161
(c)Streptomycin514
(c)Control3814

Table 2. Three 2×22 \times2 contingency tables used in the experiments. (a) Table 2.1 in [1] (aggregated): Aspirin use vs. myocardial infarction. (b) Table 2 in [13]: tobacco smoking vs. breast cancer. (c) Table IX in [9]: MRC streptomycin RCT (tuberculosis).

For each table, we release the two event counts as a two-dimensional count query and add independent Laplace noise with scale b=1/εb = 1/\varepsilon to each coordinate. This vector release is ε\varepsilon-DP by the Laplace mechanism. We then construct CIs using Theorems 2 and 3, setting the perturbation variance to σ2=2b2=2/ε2\sigma^{2} = 2b^{2} = 2/\varepsilon^{2}.

For each dataset and each privacy level, we record the average value of the private estimator and the average width of the corresponding CI. These averages are computed over N=105N = 10^{5} independent noise draws, so as to isolate the effect of the privacy mechanism itself. The results are summarized in Table 3.

Panelε\varepsilonRR^\widehat{RR}RR‾\overline{RR}WidthWidth PrivOR^\widehat{OR}OR‾\overline{OR}WidthWidth Priv
(a)0.50.5510.2980.5460.299
(a)10.5500.5500.2640.2730.5460.5460.2650.274
(a)20.5500.2660.5460.268
(b)0.51.1790.4351.4201.126
(b)11.1781.1780.3620.3811.4111.4130.9260.979
(b)21.1780.3671.4120.939
(c)0.51.282140.9289.08661735.705
(c)11.2691.2710.4610.6684.6976.96613.9771101.317
(c)21.2700.5195.52844.206

Table 3. Non-private and private point estimates and CI widths under Laplace-perturbed counts. For RR we use the log-scale CI of Theorem 2; for OR we use Theorem 3. Width denotes the noiseless CI width, and Width Priv denotes the average private CI width.

Table 3 shows that the impact of DP depends strongly on the scale of the underlying counts. In Panel (a), the total sample size is very large, and even the event counts are in the hundreds, so the perturbation has only a minor effect. Both RR‾\overline{RR} and OR‾\overline{OR} are essentially identical to their non-private counterparts across all privacy levels, and the increase in interval width is modest. In Panel (b), the effect of privacy is visible, but remains well-controlled. The private point estimates are very close to the non-private ones for both RR and OR, and the CIs widen only moderately. Thus, when the cell counts are in the hundreds, Laplace perturbation introduces some additional uncertainty, but does not qualitatively distort the inferential conclusions.

The most dramatic behavior appears in Panel (c). In this case, the additive noise is no longer negligible relative to the observed counts, and the ratio estimators become highly unstable under strong privacy. For RR, the average private estimate increases only slightly, from 1.269 to 1.282 at ε=0.5\varepsilon= 0.5, but the average private CI width explodes from 0.461 to 140.928. The effect is even more pronounced for OR: the average private CI width becomes enormous. This instability is exactly what one expects when noise can move a small count close to the boundary, causing ratios and log-ratios to vary dramatically.

Conclusion

We studied estimation and inference for relative risk and odds ratio when the underlying event counts are released under additive DP mechanisms. We showed how to construct plug-in estimators and variance-adjusted CIs that explicitly account for both sampling variability and privacy-induced noise. Empirically, the proposed intervals preserve coverage across a range of privacy levels, with widths close to their non-private counterparts in well-powered settings. Our variance decompositions further clarify when privacy affects inference: privacy has modest effects in high-count regimes, while sparse regimes remain fragile, both with and without privacy. These findings support simple plug-in inference from privatized counts as a practical tool, while also clarifying its limitations under sparse data.

Acknowledgments. This work was supported in part by a gift to the McCourt School of Public Policy and Georgetown University, Simons Foundation Collaboration 733792, Israel Science Foundation (ISF) grant 2861/20, Apple, ERC grant 101125913, and a grant from the Israeli Council of Higher Education. Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them.

Disclosure of Interests. The authors have no competing interests to declare that are relevant to the content of this article.

Appendix

Proof of Theorem 2

Proof. We begin by showing that trimming the noisy counts has no asymptotic effect. Denote μx=pxnx\mu_x = p_x n_x and μy=pyny\mu_y = p_y n_y, and define Ax:={X~∉[1,nx−1]}A_x := \{\widetilde{X} \notin[1,n_x-1]\}, Ay:={Y~∉[1,ny−1]}A_y := \{\widetilde{Y} \notin[1,n_y-1]\}. Since px∈[η,1−η]p_x \in[\eta,1-\eta], we have min⁡(μx,nx−μx)≥ηnx\min(\mu_x,n_x-\mu_x) \ge\eta n_x. By the triangle inequality,

P(Ax)≤P(∣X−μx∣≥η4nx)+P(∣Nx∣≥η4nx).\mathbb{P}(A_x) \le\mathbb{P}\left(|X-\mu_x| \ge\frac{\eta}{4}n_x\right) + \mathbb{P}\left(|N_x| \ge\frac{\eta}{4}n_x\right).

The first term tends to 0 exponentially fast by Hoeffding's inequality for binomials. The second tends to 0 because Nx∼N(0,σx2)N_x \sim\mathcal{N}(0,\sigma_x^2) and σx=o(nx)\sigma_x = o(n_x), implying ηnx/(4σx)→∞\eta n_x/(4\sigma_x) \to\infty. Thus P(Ax)→0\mathbb{P}(A_x) \to0, and similarly P(Ay)→0\mathbb{P}(A_y) \to0. Consequently, P(X~p≠X~)→0\mathbb{P}(\widetilde{X}_p \ne\widetilde{X}) \to0, P(Y~p≠Y~)→0\mathbb{P}(\widetilde{Y}_p \ne\widetilde{Y}) \to0, and in particular

X~pnx→ppx,Y~pny→ppy.(2)\frac{\widetilde{X}_p}{n_x} \xrightarrow{p} p_x,\qquad\frac{\widetilde{Y}_p}{n_y} \xrightarrow{p} p_y. \tag*{(2)}

Next, we follow the construction of the delta method. Define g(u,v)=log⁡(u/nxv/ny)g(u,v) = \log\left(\frac{u/n_x}{v/n_y}\right). The function gg is twice continuously differentiable in a neighborhood of (μx,μy)(\mu_x,\mu_y), with ∇g(μx,μy)=(1μx,−1μy)\nabla g(\mu_x,\mu_y) = \left(\frac{1}{\mu_x},-\frac{1}{\mu_y}\right). Write

X~−μx=(X−μx)+Nx,Y~−μy=(Y−μy)+Ny,\widetilde{X}-\mu_x=(X-\mu_x)+N_x,\qquad\widetilde{Y}-\mu_y=(Y-\mu_y)+N_y,

where (X,Nx)(X,N_x) is independent of (Y,Ny)(Y,N_y). Since X∼Bin⁡(nx,px)X \sim\operatorname{Bin}(n_x,p_x), X−μxVar⁡(X)→dN(0,1)\frac{X-\mu_x}{\sqrt{\operatorname{Var}(X)}} \xrightarrow{d} \mathcal{N}(0,1), Var⁡(X)=nxpx(1−px)\operatorname{Var}(X)=n_xp_x(1-p_x), and analogously for YY. To identify the asymptotic law of X~−μx\widetilde{X}-\mu_x, write

X~−μxVar⁡(X)+σx2=an,xX−μxVar⁡(X)+bn,xNxσx,\frac{\widetilde{X}-\mu_x}{\sqrt{\operatorname{Var}(X)+\sigma_x^2}}=a_{n,x}\frac{X-\mu_x}{\sqrt{\operatorname{Var}(X)}}+b_{n,x}\frac{N_x}{\sigma_x},

where

an,x=Var⁡(X)Var⁡(X)+σx2,bn,x=σx2Var⁡(X)+σx2.a_{n,x}=\sqrt{\frac{\operatorname{Var}(X)}{\operatorname{Var}(X)+\sigma_x^2}},\qquad b_{n,x}=\sqrt{\frac{\sigma_x^2}{\operatorname{Var}(X)+\sigma_x^2}}.

Let

Un,x=X−μxVar⁡(X),Gx=Nxσx∼N(0,1).U_{n,x}=\frac{X-\mu_x}{\sqrt{\operatorname{Var}(X)}},\qquad G_x=\frac{N_x}{\sigma_x}\sim\mathcal{N}(0,1).

Then Un,x→dN(0,1)U_{n,x}\xrightarrow{d}\mathcal{N}(0,1) by the classical CLT, and GxG_x is independent of Un,xU_{n,x}. Hence, for each fixed t∈Rt \in\mathbb{R}, the characteristic function of an,xUn,x+bn,xGxa_{n,x}U_{n,x}+b_{n,x}G_x is

φn(t)=Eeitan,xUn,x⋅Eeitbn,xGx=φUn,x(an,xt)exp⁡(−bn,x2t22).\varphi_n(t)=\mathbb{E}e^{it a_{n,x}U_{n,x}}\cdot\mathbb{E}e^{it b_{n,x}G_x}=\varphi_{U_{n,x}}(a_{n,x}t)\exp\left(-\frac{b_{n,x}^2t^2}{2}\right).

Since Un,x→dN(0,1)U_{n,x} \xrightarrow{d} \mathcal{N}(0,1), its characteristic functions converge to s↦exp⁡(−s2/2)s \mapsto\exp(-s^2/2), uniformly for ss in compact sets; see, e.g., Lévy’s continuity theorem [5 Sec. 26]. Because an,x∈[0,1]a_{n,x} \in[0,1], this gives φUn,x(an,xt)=exp⁡(−an,x2t22)+o(1)\varphi_{U_{n,x}}(a_{n,x}t) = \exp\left(-\frac{a_{n,x}^{2}t^{2}}{2}\right) + o(1). Therefore,

φn(t)=exp⁡(−(an,x2+bn,x2)t22)+o(1)=exp⁡(−t22)+o(1),\varphi_n(t) = \exp\left(-\frac{(a_{n,x}^{2}+b_{n,x}^{2})t^{2}}{2}\right) + o(1) = \exp\left(-\frac{t^{2}}{2}\right) + o(1),

where we used an,x2+bn,x2=1a_{n,x}^{2}+b_{n,x}^{2}=1. By Lévy’s continuity theorem,

X~−μxVar⁡(X)+σx2=an,xUn,x+bn,xGx→dN(0,1).\frac{\widetilde{X}-\mu_x}{\sqrt{\operatorname{Var}(X)+\sigma_x^{2}}} = a_{n,x}U_{n,x}+b_{n,x}G_x \xrightarrow{d} \mathcal{N}(0,1).

The same argument applies to Y~\widetilde{Y}.

Let sx2=Var⁡(X)+σx2s_x^{2}=\operatorname{Var}(X)+\sigma_x^{2} and sy2=Var⁡(Y)+σy2s_y^{2}=\operatorname{Var}(Y)+\sigma_y^{2}. Define

Vnx,ny=sx2μx2+sy2μy2=(1nxpx−1nx)+(1nypy−1ny)+σx2nx2px2+σy2ny2py2.V_{n_x,n_y}=\frac{s_x^{2}}{\mu_x^{2}}+\frac{s_y^{2}}{\mu_y^{2}} =\left(\frac{1}{n_xp_x}-\frac{1}{n_x}\right) +\left(\frac{1}{n_yp_y}-\frac{1}{n_y}\right) +\frac{\sigma_x^{2}}{n_x^{2}p_x^{2}}+\frac{\sigma_y^{2}}{n_y^{2}p_y^{2}}.

Since sx/nx→0s_x/n_x \to0 and sy/ny→0s_y/n_y \to0, a Taylor expansion around (μx,μy)(\mu_x,\mu_y) gives

ℓ~−ℓ∗=∇g(μx,μy)⊤(X~−μxY~−μy)+Op(sx2nx2+sy2ny2).\widetilde{\ell}-\ell^* =\nabla g(\mu_x,\mu_y)^\top \begin{pmatrix} \widetilde{X}-\mu_x\\ \widetilde{Y}-\mu_y \end{pmatrix} +O_p\left(\frac{s_x^{2}}{n_x^{2}}+\frac{s_y^{2}}{n_y^{2}}\right).

By independence of the two counts and their perturbations, the leading linear term is asymptotically normal with variance Vnx,nyV_{n_x,n_y}. Moreover,

sx2nx2+sy2ny2=o(sx2nx2+sy2ny2),\frac{s_x^{2}}{n_x^{2}}+\frac{s_y^{2}}{n_y^{2}} =o\left(\sqrt{\frac{s_x^{2}}{n_x^{2}}+\frac{s_y^{2}}{n_y^{2}}}\right),

because sx/nx→0s_x/n_x \to0 and sy/ny→0s_y/n_y \to0. Hence the Taylor remainder is op(Vnx,ny)o_p(\sqrt{V_{n_x,n_y}}).

Finally, by (2) and continuity of t↦1/tt \mapsto1/t and t↦1/t2t \mapsto1/t^2 on (0,∞)(0,\infty), s^e2/Vnx,ny→p1\widehat{s}_e^2/V_{n_x,n_y} \xrightarrow{p} 1. Slutsky’s theorem therefore implies

ℓ~−ℓ∗s^e→dN(0,1),\frac{\widetilde{\ell}-\ell^*}{\widehat{s}_e}\xrightarrow{d}\mathcal{N}(0,1),

which yields

P(ℓ∗∈[ℓ~±z1−α/2s^e])→1−α.\mathbb{P}\left(\ell^* \in[\widetilde{\ell}\pm z_{1-\alpha/2}\widehat{s}_e]\right)\to1-\alpha.

Exponentiating the endpoints preserves coverage for RR=px/py\mathrm{RR}=p_x/p_y.

Proof of Theorem 3

Proof. The trimming argument is identical to the beginning of the proof of Theorem 2. In particular, clipping has no asymptotic effect, and

X~/nx→ppx,Y~/ny→ppy.(3)\widetilde{X}/n_x \xrightarrow{p} p_x,\qquad\widetilde{Y}/n_y \xrightarrow{p} p_y. \tag*{(3)}

Moreover, by the same argument as in that proof,

X~−μxVar⁡(X)+σx2→dN(0,1),Y~−μyVar⁡(Y)+σy2→dN(0,1),\frac{\widetilde{X}-\mu_x}{\sqrt{\operatorname{Var}(X)+\sigma_x^2}} \xrightarrow{d} \mathcal{N}(0,1), \qquad\frac{\widetilde{Y}-\mu_y}{\sqrt{\operatorname{Var}(Y)+\sigma_y^2}} \xrightarrow{d} \mathcal{N}(0,1),

where μx=pxnx, μy=pyny\mu_x=p_xn_x,\ \mu_y=p_yn_y.

We now apply the delta method with g(u,v)=log⁡(unx−u)−log⁡(vny−v)g(u,v)=\log\left(\frac{u}{n_x-u}\right)-\log\left(\frac{v}{n_y-v}\right). The function gg is twice continuously differentiable in a neighborhood of (μx,μy)(\mu_x,\mu_y), with

∇g(μx,μy)=(1μx+1nx−μx,−(1μy+1ny−μy)).\nabla g(\mu_x,\mu_y)=\left(\frac{1}{\mu_x}+\frac{1}{n_x-\mu_x},-\left(\frac{1}{\mu_y}+\frac{1}{n_y-\mu_y}\right)\right).

Hence

ℓ~−ℓ∗=∇g(μx,μy)⊤(X~−μxY~−μy)+Rnx,ny,\widetilde{\ell}-\ell^*=\nabla g(\mu_x,\mu_y)^\top\begin{pmatrix}\widetilde{X}-\mu_x\\\widetilde{Y}-\mu_y\end{pmatrix}+R_{n_x,n_y},

Denote

sx2:=Var⁡(X)+σx2,sy2:=Var⁡(Y)+σy2.s_x^2:=\operatorname{Var}(X)+\sigma_x^2,\qquad s_y^2:=\operatorname{Var}(Y)+\sigma_y^2.

The leading linear term has variance

Vnx,ny=(1μx+1nx−μx)2sx2+(1μy+1ny−μy)2sy2.V_{n_x,n_y}=\left(\frac{1}{\mu_x}+\frac{1}{n_x-\mu_x}\right)^2s_x^2+\left(\frac{1}{\mu_y}+\frac{1}{n_y-\mu_y}\right)^2s_y^2.

and the remainder satisfies Rnx,ny=op(Vnx,ny)R_{n_x,n_y}=o_p\left(\sqrt{V_{n_x,n_y}}\right).

Indeed, on an event whose probability tends to one, X~\widetilde{X} and Y~\widetilde{Y} remain in fixed interior fractions of their ranges, and the second derivatives of gg are of order O(nx−2)O(n_x^{-2}) and O(ny−2)O(n_y^{-2}). Moreover, since sx/nx→0s_x/n_x\to0 and sy/ny→0s_y/n_y\to0, the displayed remainder is op(Vnx,ny)o_p\left(\sqrt{V_{n_x,n_y}}\right). By independence of the two counts and their perturbations, the leading linear term is asymptotically normal with variance

Vnx,ny=(1μx+1nx−μx)2(Var⁡(X)+σx2)+(1μy+1ny−μy)2(Var⁡(Y)+σy2)=1nxpx(1−px)+1nypy(1−py)+σx2nx2(1px+11−px)2+σy2ny2(1py+11−py)2.\begin{aligned} V_{n_x,n_y} &=\left(\frac{1}{\mu_x}+\frac{1}{n_x-\mu_x}\right)^2\left(\operatorname{Var}(X)+\sigma_x^2\right)+\left(\frac{1}{\mu_y}+\frac{1}{n_y-\mu_y}\right)^2\left(\operatorname{Var}(Y)+\sigma_y^2\right)\\ &=\frac{1}{n_xp_x(1-p_x)}+\frac{1}{n_yp_y(1-p_y)}+\frac{\sigma_x^2}{n_x^2}\left(\frac{1}{p_x}+\frac{1}{1-p_x}\right)^2+\frac{\sigma_y^2}{n_y^2}\left(\frac{1}{p_y}+\frac{1}{1-p_y}\right)^2. \end{aligned}

Therefore ℓ~−ℓ∗Vnx,ny→dN(0,1)\frac{\widetilde{\ell}-\ell^*}{\sqrt{V_{n_x,n_y}}}\xrightarrow{d}\mathcal{N}(0,1), and by (3) and continuity of t↦1/tt\mapsto1/t and t↦1/(1−t)t\mapsto1/(1-t) on (0,1)(0,1), se^2/Vnx,ny→p1\widehat{se}^2/V_{n_x,n_y}\xrightarrow{p}1. Slutsky’s theorem then yields ℓ~−ℓ∗se^→dN(0,1)\frac{\widetilde{\ell}-\ell^*}{\widehat{se}}\xrightarrow{d}\mathcal{N}(0,1), and therefore

P(ℓ∗∈[ℓ~±z1−α/2se^])→1−α.\mathbb{P}\left(\ell^*\in[\widetilde{\ell}\pm z_{1-\alpha/2}\widehat{se}]\right)\to1-\alpha.

Exponentiating the endpoints preserves coverage for OR.

References

  1. [1]Agresti, A.: Categorical data analysis, vol. 792. John Wiley & Sons (2012)
  2. [2]Awan, J., Slavković, A.: Differentially private uniformly most powerful tests for binomial data. Advances in Neural Information Processing Systems 31 (2018)arxiv.org/abs/1805.09236
  3. [3]Balle, B., Wang, Y.X.: Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising. In: International Conference on Machine Learning. pp. 394–403. PMLR (2018)arxiv.org/abs/1805.06530
  4. [4]Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., Talwar, K.: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. pp. 273–282 (2007)DOI
  5. [5]Billingsley, P.: Probability and Measure. Wiley, 3 edn. (1995)
  6. [6]Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science 9(3–4), 211–407 (2014)
  7. [7]Gaboardi, M., Lim, H., Rogers, R., Vadhan, S.: Differentially private chi-squared hypothesis testing: Goodness of fit and independence testing. In: International conference on machine learning. pp. 2111–2120. PMLR (2016)arxiv.org/abs/1602.03090
  8. [8]Lin, S., Bun, M., Gaboardi, M., Kolaczyk, E.D., Smith, A.: Differentially private confidence intervals for proportions under stratified random sampling. Electronic Journal of Statistics 18(1), 1455–1494 (2024)DOI
  9. [9]Medical Research Council Streptomycin in Tuberculosis Trials Committee: Streptomycin treatment of pulmonary tuberculosis. British Medical Journal 2(4582), 769–782 (1948). https://doi.org/10.1136/bmj.2.4582.769
  10. [10]Mervis, J.: Can a set of equations keep us census data private. Science 10 (2019)DOI
  11. [11]Mueller, J.T., Santos-Lozada, A.R.: The 2020 us census differential privacy method introduces disproportionate discrepancies for rural and non-white populations. Population Research and Policy Review 41(4), 1417–1430 (2022)
  12. [12]Rinott, Y., O’Keefe, C.M., Shlomo, N., Skinner, C.: Confidentiality and differential privacy in the dissemination of frequency tables. Statistical Science 33(3), 358–385 (2018)DOI
  13. [13]Rollison, D.E., Brownson, R.C., Hathcock, H.L., Newschaffer, C.J.: Case-control study of tobacco smoke exposure and breast cancer risk in delaware. BMC cancer 8(1), 157 (2008)
  14. [14]Santos-Lozada, A.R., Howard, J.T., Verdery, A.M.: How differential privacy will affect our understanding of health disparities in the united states. Proceedings of the National Academy of Sciences 117(24), 13405–13412 (2020)
  15. [15]Shoham, T., Liggett, K.: Differentially private ratio statistics. arXiv preprint arXiv:2505.20351 (2025)arxiv.org/abs/2505.20351
  16. [16]Van der Vaart, A.W.: Asymptotic statistics, vol. 3. Cambridge university press (2000)
  17. [17]Vu, D., Slavkovic, A.: Differential privacy for clinical trial data: Preliminary evaluations. In: 2009 IEEE International Conference on Data Mining Workshops. pp. 138–143. IEEE (2009)DOI

Paper details

vlnc:W_699gw3fj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents