A new privacy accountant for Gaussian differential privacy measures individual privacy losses.
problem Bounding differential privacy loss for each participant in data analysis.
method Developed a privacy accountant for adaptive compositions of randomised mechanisms using Gaussian differential privacy.
result Provided optimal bounds for the Gaussian mechanism and constructed an approximative individual privacy accountant.
Edgeworth Accountant calculates privacy loss under differential privacy compositions efficiently.
problem Efficiently computing overall privacy loss under composition of private algorithms.
method Analytical approach using f-differential privacy framework and Edgeworth expansion. result Non-asymptotic (ε,δ)-differential privacy bounds with reduced computational cost. The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.
problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)-values, demonstrating up to 75% reduction in noise variance. Study on privacy leakage in noisy gradient descent algorithms.
problem Information leakage of iterative randomized learning algorithms about training data.
method Analyzes the dynamics of Rényi differential privacy loss in noisy gradient descent algorithms.
result Privacy loss converges exponentially fast for smooth and strongly convex loss functions.
Improved privacy-preserving methods for convex optimization with heavy-tailed data.
problem Privacy-preserving optimization of convex functions with heavy-tailed data.
method Developed algorithms for private mean estimation and convex optimization under concentrated differential privacy constraints.
result Achieved improved upper bounds on excess population risk for convex and strongly convex loss functions.
New mechanisms improve differential privacy for scalar queries.
problem Improving differential privacy for scalar, real-valued query functions.
method Mixing multiple Gaussian distributions to satisfy differential privacy.
result Mechanisms yield lower noise amplitudes and variances compared to the analytic Gaussian mechanism.
Study optimizes privacy in distributed optimization, balancing accuracy and communication.
problem Privacy-preserving distributed stochastic convex optimization.
method Distributed algorithm using Vaidya's plane cutting method, with privacy guarantees via differential privacy.
result Complete characterization of accuracy-communication-privacy trade-off.
Paper extends FFT-based differential privacy method to heterogeneous compositions.
problem Computing accurate differential privacy guarantees for mixed mechanisms.
method Uses Fast Fourier Transform (FFT) for error analysis and parameter selection.
result Provides tighter bounds for heterogeneous compositions compared to homogeneous cases.
Distributed machine learning is an approach allowing different parties to learn a model over all data sets without disclosing their own data. In this paper, we propose a weighted distributed differential privacy (WD-DP) empirical risk minimization (ERM) method to train a model in distributed setting, considering differ…
Paper studies optimal federated learning for nonparametric regression with privacy constraints.
problem Federated learning for nonparametric regression with heterogeneous differential privacy constraints.
method Proposes distributed privacy-preserving estimators and investigates their risk properties.
result Establishes matching minimax lower bounds for global and pointwise estimation.
Alternating direction method of multiplier (ADMM) is a popular method used to design distributed versions of a machine learning algorithm, whereby local computations are performed on local data with the output exchanged among neighbors in an iterative fashion. During this iterative process the leakage of data privacy a…
Constructs models to meet any DP requirement without retraining.
problem Evolving privacy requirements at inference time.
method Two post-processing techniques: random selection and linear combination.
result Final private models satisfying any target privacy parameter.
The paper analyzes and proposes methods for privately sharing individual privacy losses using per-instance differential privacy.
problem The standard differential privacy framework provides a worst-case bound that may not accurately reflect individual privacy losses.
method The paper analyzes per-instance differential privacy and proposes methods to privately and accurately publish per-instance privacy losses.
result The methods privately and accurately publish per-instance differential privacy losses with minimal additional privacy cost.
A new discrete privacy mechanism for federated learning.
problem Differentially private federated learning with communication constraints.
method Skellam mechanism based on Poisson distributions.
result Skellam mechanism provides similar privacy-accuracy trade-offs as Gaussian mechanism.
We consider the problem of reinforcing federated learning with formal privacy guarantees. We propose to employ Bayesian differential privacy, a relaxation of differential privacy for similarly distributed data, to provide sharper privacy loss bounds. We adapt the Bayesian privacy accounting method to the federated sett…
Combining differential privacy and federated learning improves data security.
problem Ensuring privacy in distributed machine learning.
method Integrating differential privacy with federated learning protocols.
result Achieved comparable prediction accuracy to non-distributed learning while maintaining strict privacy.
New mechanism protects neural network weights from privacy attacks during self-supervised learning.
problem Privacy risks during fine-tuning stage of self-supervised learning.
method Proposes a novel differential privacy mechanism using additive logistic noise.
result Reduces membership inference attack accuracy to 50% while maintaining below 5% performance loss.
This paper quantifies privacy loss in exploratory data analysis.
problem Privacy loss in exploratory data analysis is often overlooked in privacy budgets.
method Quantitative analysis of privacy loss for statistical functions.
result Privacy loss must be considered in calculating machine learning privacy budgets.
Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.
problem Privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand distribution and nonsmooth loss function.
method Developed a clipped noisy gradient descent algorithm based on convolution smoothing for optimal inventory estimation within f-differential privacy framework.
result Achieved privacy-preserving optimal inventory policy with provable privacy guarantees and desirable statistical precision.
A new method for tighter privacy loss accounting in adaptive analyses.
problem Ensuring individual privacy in adaptive analyses while staying within a privacy budget.
method A personalized privacy loss estimate and a Rényi differential privacy filter.
result Personalized privacy loss accounting can be practical and tighter than existing methods.
BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.
problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n1−1)S)]. Private statistics estimation faces a bias, accuracy, and privacy trilemma.
problem Balancing privacy, accuracy, and bias in statistical estimation.
method Use differential privacy (DP) for private statistics, but clip samples to control sensitivity and add noise for privacy, introducing bias.
result No algorithm can simultaneously have low bias, low error, and low privacy loss for arbitrary distributions.
Paper improves privacy and utility of SGD with bounded domain and smooth losses.
problem Lack of tight privacy bounds and practical assumptions in DPSGD.
method Rigorous privacy characterization for DPSGD with general L-smooth and non-convex loss functions, tracking privacy loss over iterations.
result Privacy loss converges without convexity assumption for bounded domain, improving utility.
Alternating Direction Method of Multipliers (ADMM) is a widely used tool for machine learning in distributed settings, where a machine learning model is trained over distributed data sources through an interactive process of local computation and message passing. Such an iterative process could cause privacy concerns o…
New algorithm optimizes privacy and utility in multi-task learning with skewed data.
problem Privacy constraints in multi-task learning with uneven data distribution.
method Adaptive reweighting of privacy budget allocation among tasks.
result Significant improvement in utility with state-of-the-art performance on benchmarks.
Paper simplifies DP composition for adaptive privacy budgets, enabling better privacy and accuracy in deep learning.
problem Tension between efficiency and flexibility in DP composition theorems.
method Rényi Differential Privacy (RDP) for adaptive privacy budgets, proving simpler composition theorem with smaller constants.
result Practical DP composition for adaptive privacy budgets, enabling better privacy and accuracy in deep learning.
Distributed learning systems have enabled training large-scale models over large amount of data in significantly shorter time. In this paper, we focus on decentralized distributed deep learning systems and aim to achieve differential privacy with good convergence rate and low communication cost. To achieve this goal, w…
Our study analyzes how neural network initialization affects privacy and utility in overparameterized models.
problem Privacy and utility trade-off in overparameterized neural networks.
method Analytical proof of KL divergence privacy bound, focusing on initialization, width, and depth.
result Privacy bound improvement with increasing depth under certain initializations, degradation under others.
Develops a privacy-preserving algorithm for sparse robust regression.
problem Privacy-preserving machine learning for sparse robust regression.
method Develops FRAPPE algorithm for non-smooth loss under differential privacy.
result Achieves better privacy and statistical accuracy trade-off.
RDP-GAN improves GAN privacy by adding random noises to loss function.
problem Protecting sensitive information in GANs while maintaining quality of generated samples.
method Integrates Rényi-differential privacy into GAN training process by adding random noises to loss function.
result Achieves better privacy protection with high-quality samples compared to existing methods.
Privacy-preserving synthetic data from EHRs for learning and inference.
problem Sharing sensitive EHR data while maintaining patient privacy.
method Differentially private normalizing flows for density estimation and variational inference.
result Privacy-preserving synthetic data can yield good utility at a reasonable privacy cost.
Optimal DP mechanisms for vector queries are found to be staircase distributions.
problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.
New analysis shows SGD with noise doesn't leak more privacy with more iterations.
problem Privacy loss in noisy SGD with more iterations.
method Privacy Amplification by Iteration and Sampled Gaussian Mechanism.
result Privacy loss remains constant after a burn-in period, not increasing with more iterations.
Paper improves privacy bounds for shuffle model using novel numerical techniques.
problem Improving privacy guarantees in the shuffle model of differential privacy.
method Develops and evaluates numerical techniques for tighter (ε,δ)-differential privacy bounds. result Accurately evaluates privacy loss distribution for adaptive compositions of shufflers.
Paper proposes a privacy-preserving method for estimating complex models.
problem Lack of flexibility in existing model classes for approximating data-generating processes.
method Privacy-preserving distributed estimation of generalized additive mixed models using component-wise gradient boosting.
result Proposed algorithm yields equivalent model estimates as component-wise gradient boosting on pooled data.
With the proliferation of training data, distributed machine learning (DML) is becoming more competent for large-scale learning tasks. However, privacy concerns have to be given priority in DML, since training data may contain sensitive information of users. In this paper, we propose a privacy-preserving ADMM-based DML…
Privacy-preserving SGD with heavy-tailed noise achieves differential privacy guarantees.
problem Privacy preservation in noisy SGD with heavy-tailed noise.
method Differential privacy guarantees for SGD with heavy-tailed noise.
result SGD with heavy-tailed perturbations achieves (0,O(1/n))-DP. Differential privacy is a strong notion for privacy that can be used to prove formal guarantees, in terms of a privacy budget, ε, about how much information is leaked by a mechanism. However, implementations of privacy-preserving machine learning often select large values of ε in order to get acceptable utility of …
Generative Adversarial Network (GAN) and its variants serve as a perfect representation of the data generation model, providing researchers with a large amount of high-quality generated data. They illustrate a promising direction for research with limited data availability. When GAN learns the semantic-rich data distri…
Log-Loss scores expose membership privacy breaches.
problem Privacy leakage from statistical aggregates like Log-Loss scores.
method Proved that Log-Loss scores enable full accuracy membership inference in a single query.
result Complete membership privacy breach is possible with Log-Loss scores.
Paper improves privacy-preserving measurement of advertising incrementality.
problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.
A new algorithm improves federated learning by combining knowledge distillation and weighted combination loss.
problem Non-IID client data in federated learning leads to model drift and poor generalization.
method pFedKD-WCL integrates knowledge distillation with bi-level optimization to address non-IID challenges.
result pFedKD-WCL outperforms state-of-the-art algorithms in accuracy and convergence speed.
New algorithm reduces privacy breach in posterior sampling.
problem Combining pure DP with MCMC for efficient sampling.
method ASAP algorithm that perturbs MCMC samples with Wasserstein-infinity noise.
result First nearly linear-time algorithm achieving optimal DP-ERM rates.
Federated learning is a recent advance in privacy protection. In this context, a trusted curator aggregates parameters optimized in decentralized fashion by multiple clients. The resulting model is then distributed back to all clients, ultimately converging to a joint representative model without explicitly having to s…
This paper shows how differential privacy can be achieved naturally in federated learning over fading channels without artificial noise.
problem Achieving differential privacy in federated learning over fading channels without artificial noise.
method Study of AirFL over multiple-access fading channels with a multi-antenna base station, deriving novel bounds on differential privacy.
result DP can be achieved naturally in federated learning over fading channels without artificial noise, revealing convergence-privacy trade-offs.
Paper proposes differentially private quantile regression for high-dimensional data.
problem Privacy concerns in big data with heterogeneous sensitive personal information.
method Newton-type transformation for reformulating quantile regression into an OLS problem; iterative updates for estimation; debiased estimator for inference; communication-efficient bootstrap.
result Near-optimal statistical accuracy and formal privacy guarantees achieved.
New algorithms protect user-level privacy in learning tasks.
problem Protecting user-level privacy in learning tasks with stringent constraints.
method Proposes algorithms for learning tasks under user-level differential privacy constraints.
result Privacy cost decreases as users provide more samples or as the number of users increases.
DPlis improves privacy in deep learning models by smoothing loss functions.
problem Privacy leakage in deep learning models trained on private data and low model performance.
method DPlis constructs a smooth loss function to favor noise-resilient models.
result DPlis effectively boosts model quality and training stability under privacy constraints.