New DP-CD method outperforms DP-SGD in solving composite DP-ERM problems.
problem Privacy-preserving machine learning with differential privacy.
method Differentially Private proximal Coordinate Descent (DP-CD) for composite Empirical Risk Minimization (ERM).
result DP-CD outperforms DP-SGD due to larger step sizes and better gradient exploitation.
Differentially private random block coordinate descent improves utility in machine learning.
problem Lack of privacy in classical CD methods when handling sensitive information.
method Proposes a differentially private random block coordinate descent method using sketch matrices and importance sampling.
result Demonstrates improved convergence rates and utility guarantees compared to non-private methods.
This work improves privacy-generalization bounds for DP-SGD.
problem Understanding the trade-off between privacy and generalization in machine learning.
method Proved a linear max-information bound for DP-SGD, derived PAC-Bayes and generalization bounds.
result Explicit and controlled complexity terms for DP-SGD-trained models.
Recent developments in differentially private (DP) machine learning and DP Bayesian learning have enabled learning under strong privacy guarantees for the training data subjects. In this paper, we further extend the applicability of DP Bayesian learning by presenting the first general DP Markov chain Monte Carlo (MCMC)…
Paper bridges statistical inference for DP-SGD, a privacy-preserving machine learning method.
problem Asymptotic statistical inference for Differentially Private Stochastic Gradient Descent (DP-SGD).
method Established asymptotic properties of SGD under randomized subsampling, extended to DP-SGD, proposed methods for constructing valid confidence intervals.
result Valid confidence intervals for DP-SGD output achieve nominal coverage rates while maintaining privacy.
DP-SGD provides privacy guarantees for all data points, but we propose output-specific DP to better account for individual examples.
problem Accounting for individual privacy guarantees in DP-SGD.
method Output-specific (ε,δ)-DP and an efficient algorithm to investigate individual privacy across datasets. result Most examples enjoy stronger privacy guarantees than the worst-case bound, and there is a correlation between training loss and privacy parameter.
DIFF2 improves differential privacy in nonconvex optimization with better utility bounds.
problem Improving differential privacy in nonconvex optimization with better utility bounds.
method DIFF2 constructs a differential private global gradient estimator using gradient differences.
result DIFF2 achieves a utility of \(\widetilde O(d^{2/3}/(n\varepsilon_{\mathrm{DP}})^{4/3})\), significantly better than \(\widetilde O(\sqrt{d}/(n\varepsilon_{\mathrm{DP}}))\).
DOPPLER optimizes DP training with low-pass filtering, improving model accuracy.
problem Privacy concerns in deep learning models and performance degradation of DP optimizers.
method Developed DOPPLER, a low-pass filter for DP optimizers, to reduce privacy noise and enhance model quality.
result DOPPLER optimizers outperform non-DOPPLER counterparts by 3%-10% in test accuracy.
DP-RandP improves privacy-utility tradeoff in DP-SGD by learning priors from random processes.
problem Improving the performance of differentially private stochastic gradient descent (DP-SGD) on private data.
method A three-phase approach that learns priors from images generated by random processes and transfers these priors to private data.
result New state-of-the-art accuracy on CIFAR10, CIFAR100, MedMNIST, and ImageNet for various privacy budgets.
Develops DP-SCD for stochastic coordinate descent, making it differentially private.
problem Privacy leak in auxiliary information during stochastic coordinate descent training.
method Develops DP-SCD, leveraging independent noise addition and decoupling/parallelizing coordinate updates.
result Demonstrates competitive performance against DP-SGD with less tuning.
DPDMs use DP-SGD to generate private synthetic data.
problem Generating private synthetic data from sensitive datasets.
method Introduced DP-SGD for DMs, investigated DM parameterization and sampling, proposed noise multiplicity.
result Achieved state-of-the-art performance in image generation benchmarks.
Differentially private learning avoids iterative optimization in parameter space.
problem Differentially private training of neural networks
method Hypernetworks trained on public datasets
result Significantly reduces noise in parameter space
Differentially private hyperparameter tuning improves privacy in machine learning.
problem Hyperparameter tuning leaks private information through selected configurations.
method Local Bayesian optimization using Gaussian Process surrogate for private gradient approximation.
result DP-GIBO converges to locally optimal hyperparameters with polynomial dimensional dependence.
Proposes a method for differentially private linear regression and synthetic data generation.
problem Lack of valid inference and synthetic data generation methods for small-scale datasets in privacy-aware settings.
method Gaussian differentially private linear regression with bias-corrected estimator and SDG procedure.
result Improves accuracy and provides valid confidence intervals for downstream tasks.
Large batch sizes reduce gradient variance in DP-SGD, improving privacy.
problem Understanding why large batch sizes work in DP-SGD.
method Decomposed total gradient variance into subsampling and noise-induced variances, proving batch size independence in the limit.
result Large batch sizes reduce effective total gradient variance, improving privacy in DP-SGD.
New framework for DP-SMO with near-optimal privacy-loss trade-off.
problem Optimal trade-off between privacy and population loss in DP-SMO.
method General framework using Phased-ERM method and black-box optimization.
result Near-linear time algorithms with near-optimal guarantees.
Researchers developed a differentially private method for computing Wasserstein distances.
problem Computing divergences between distributions while preserving privacy.
method They focused on the Sliced Wasserstein Distance and added Gaussian perturbations to make it differentially private.
result They introduced a new differentially private distance, the Smoothed Sliced Wasserstein Distance, which performs well in generative models and domain adaptation.
The paper develops methods to create private synthetic spatial point patterns.
problem Generating private synthetic spatial point patterns.
method Developed differentially private Poisson and Cox point synthesizers.
result The synthesizers effectively maintain privacy and utility of synthetic data.
Paper develops DP methods for low-rank matrix estimation with near-optimal performance.
problem Estimating a low-rank matrix under differential privacy constraints.
method Introduced computationally efficient DP-initialization and Riemannian optimization-based DP-RGrad algorithm.
result DP-RGrad achieves near-optimal convergence rate under weak differential privacy constraints.
New DP optimization methods for sparse gradients, improving on existing algorithms.
problem Differentially private optimization with sparse gradients in high-dimensional settings.
method Improved bounds for mean estimation, pure- and approximate-DP algorithms for stochastic convex optimization.
result First nearly dimension-independent rates for DP optimization with sparse gradients.
Paper revisits DP-SCO in Euclidean and ℓpd spaces, focusing on constrained and bounded sets.
problem Differentially private stochastic convex optimization in constrained and bounded sets in Euclidean and ℓpd spaces. method Proposes methods achieving excess population risks dependent on Gaussian width of the constraint set, and novel algorithms for unconstrained and heavy-tailed data.
result Theoretical results for DP-SCO in ℓpd spaces, including optimal bounds for strongly convex functions. New DP algorithms with margin guarantees for various hypothesis sets.
problem Differential privacy in machine learning with margin guarantees.
method Developed pure and efficient DP learning algorithms for linear, kernel-based, and neural network hypotheses.
result Margin guarantees are independent of input dimension and hypothesis type.
A major challenge for machine learning is increasing the availability of data while respecting the privacy of individuals. Here we combine the provable privacy guarantees of the differential privacy framework with the flexibility of Gaussian processes (GPs). We propose a method using GPs to provide differentially priva…
Improved DP-SGD for variational inference reduces noise and variance.
problem Poor convergence and high variance in variational parameter outputs due to gradient noise in DP-SGD.
method Introduced aligned gradients and iterate averaging to reduce DP-induced noise, and noise-aware posteriors.
result Less noisy gradient estimator and improved parameter estimates for variational inference.
New DP EM algorithm with statistical guarantees for mixture models.
problem Preserving privacy in EM algorithms for mixture models.
method Proposed a DP EM algorithm with statistical guarantees.
result Near optimal estimation error for GMM in DP model.
Differentially-private FNAS protects privacy while collaboratively searching for neural architectures.
problem Collaborative neural architecture search with privacy concerns.
method Federated Neural Architecture Search (FNAS) with differential privacy (DP-FNAS).
result DP-FNAS can search for highly-performant neural architectures while protecting individual parties' privacy.
This paper improves privacy bounds for DP algorithms using f-DP.
problem Difficulty in analyzing randomness in DP algorithms due to mixture distributions.
method Derives a closed-form expression for trade-off functions and analyzes f-DP. result Enhances privacy of DP-GD with random initialization and shuffling models.
This paper provides a method for noise-calibrated inference from DP synthetic data.
problem Inference from DP synthetic data is often miscalibrated and lacks principled uncertainty quantification.
method Release DP sufficient statistics, perform noise-calibrated likelihood-based inference, and optional synthetic data generation.
result Asymptotic normality and valid confidence intervals for the plug-in DP MLE.
New algorithm improves privacy in high-dimensional machine learning models.
problem Privacy issues in learning large machine learning models.
method Differentially private greedy coordinate descent (DP-GCD) algorithm.
result Achieves logarithmic dependence on dimension for quasi-sparse solutions.
Broad adoption of machine learning techniques has increased privacy concerns for models trained on sensitive data such as medical records. Existing techniques for training differentially private (DP) models give rigorous privacy guarantees, but applying these techniques to neural networks can severely degrade model per…
New DP algorithm improves privacy and efficiency for convex optimization.
problem Efficient, DP algorithms for convex optimization with strong excess risk bounds.
method Output perturbation for a broad class of tilted loss functions.
result Near optimal DP excess risk and runtime bounds for convex optimization.
Generative Adversarial Networks (GANs) are one of the well-known models to generate synthetic data including images, especially for research communities that cannot use original sensitive datasets because they are not publicly accessible. One of the main challenges in this area is to preserve the privacy of individuals…
Study on privacy-preserving health care models that sacrifice accuracy for data protection.
problem Privacy-preserving models in health care neglect data from the tails, reducing accuracy for small groups.
method Used state-of-the-art differentially private learning methods for clinical prediction tasks.
result Privacy-preserving models in health care exhibit steep tradeoffs between privacy and utility, and disproportionately influence large demographic groups.
Differentially private log-location-scale regression models improve privacy in statistical analysis.
problem Ensuring privacy in statistical regression models while maintaining accuracy.
method Integrates differential privacy into LLS regression using the functional mechanism.
result Proposed DP-LLS models satisfy ε-differential privacy and perform well under various conditions.
New privacy bounds for DP-SGD's last iterate, even with cyclic sampling.
problem Privacy of the last iterate in DP-SGD with cyclic sampling.
method Established new RDP upper bounds for the last iterate under realistic assumptions.
result Privacy bounds for DP-SGD's last iterate with cyclic sampling and clipping, even for nonconvex losses.
Proposes a method to generate private synthetic data in a decentralized setting using correlated noise.
problem Challenges of generating private synthetic data in a decentralized setting with limited client data.
method Integrates CAPE protocol into federated DP-CDA framework to generate anti-correlated noise.
result Improves privacy-utility trade-off in federated setting compared to centralized approach.
Second-order methods improve differential privacy in convex optimization.
problem Improving differential privacy in convex optimization.
method Developed a private variant of the regularized cubic Newton method for strongly convex loss functions.
result Achieves quadratic convergence and optimal excess loss for strongly convex loss functions.
Paper addresses DP-SCO on heavy-tailed data, providing methods and results.
problem Designing DP algorithms for SCO on heavy-tailed data.
method Sample-and-aggregate framework, gradient smoothing and trimming.
result Achieved DP guarantees for various loss functions with different excess population risks.
New DP bootstrap method for statistical inference with improved privacy and accuracy.
problem Lack of general techniques for conducting statistical inference under differential privacy.
method DP bootstrap procedure to infer sampling distribution and construct confidence intervals.
result DP bootstrap estimates provide consistent point estimates and asymptotically valid standard CIs.
Differentially private graph learning via bounded sensitivity PPR.
problem Protecting user data in graph learning algorithms.
method Proposes a sensitivity-bounded personalized PageRank (PPR) algorithm.
result Achieves similar accuracy to non-private algorithms with large degrees.
Develops privacy-preserving methods for longitudinal linear regression.
problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.
Paper proposes DP-SGD and DP-NSGD for differentially private non-convex optimization.
problem Mitigating privacy risks in large model learning.
method Clip or normalize per-sample gradients and add noise for differential privacy.
result Achieved convergence rate of gradient norm for non-convex optimization.
The paper proposes a method to learn differentially private variational autoencoders with term-wise gradient aggregation.
problem Learning variational autoencoders with differential privacy constraints and multiple divergences.
method Term-wise Differentially Private SGD (DP-SGD) that crafts randomized gradients for each loss term, keeping sensitivity at O(1).
result The method reduces the amount of noise needed for differential privacy, allowing better learning.
First DP algorithm for Wasserstein barycenters on private data.
problem Computing Wasserstein barycenters on private datasets.
method Differentially private algorithms for Wasserstein barycenters.
result High-quality private barycenters with strong accuracy-privacy tradeoffs.
Projective DP-SGD reduces privacy error by identifying low-dimensional gradient subspaces.
problem Differentially private SGD's error rate scales with model's dimensionality, problematic for over-parameterized models.
method Projective DP-SGD, projecting noisy gradients to a low-dimensional subspace identified from a public dataset.
result The method reduces the dependence on model dimensionality, improving accuracy in high privacy regimes.
Enhances DP linear regression using public data moments.
problem Limited utility of traditional DP methods in linear regression.
method Transform private data using public second-moment matrix for a better OLSE.
result Improved accuracy and robustness of OLSE in DP linear regression.
Improved DP-SGD on large models achieves high accuracy on image classification tasks.
problem Differentially private image classification often degrades performance.
method Careful hyper-parameter tuning and signal propagation techniques.
result Achieved 81.4% top-1 accuracy on CIFAR-10 under (8, 10^{-5})-DP.
Companies increasingly expose machine learning (ML) models trained over sensitive user data to untrusted domains, such as end-user devices and wide-access model stores. We present Sage, a differentially private (DP) ML platform that bounds the cumulative leakage of training data through models. Sage builds upon the ric…