PGFL framework learns personalized models with differential privacy.
problem Privacy-preserving personalized learning for diverse data.
method Exploits model similarities and differential privacy (zero-concentrated).
result Algorithm converges to optimal solutions with linear time complexity.
Paper addresses DP in bandits, focusing on zCDP and providing private algorithms.
problem Privacy concerns in recommender systems using user-sensitive data.
method Formalizes and compares different DP adaptations to bandits, proposes private algorithms for various bandit settings.
result Private algorithms ensure negligible privacy costs compared to non-private regret.
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.
Develops privacy-preserving multivariate median estimation methods.
problem Lack of rigorous privacy guarantees for robust multivariate location estimation.
method Novel finite-sample performance guarantees for differentially private multivariate depth-based medians.
result Sharp performance guarantees for multivariate depth-based medians under differential privacy.
New filters match advanced composition for adaptive privacy, with practical constants.
problem Limitations of existing adaptive composition methods.
method Constructed new filters and odometers that match advanced composition rates, including constants.
result Achieved fully adaptive privacy with practical filters and odometers.
The process of data mining with differential privacy produces results that are affected by two types of noise: sampling noise due to data collection and privacy noise that is designed to prevent the reconstruction of sensitive information. In this paper, we consider the problem of designing confidence intervals for the…
Large data collections required for the training of neural networks often contain sensitive information such as the medical histories of patients, and the privacy of the training data must be preserved. In this paper, we introduce a dropout technique that provides an elegant Bayesian interpretation to dropout, and show…
Paper develops a federated learning method to protect privacy without sacrificing model utility.
problem Privacy leakage in federated learning due to information exchange between edge devices and server.
method Combines local gradient perturbation, secure aggregation, and zCDP for privacy protection.
result Demonstrates superior trade-off between privacy and model utility through extensive experiments.
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.
New algorithm protects privacy in IVaR regression while maintaining accuracy.
problem Privacy leakage in classical IVaR methods.
method Noisy two-stage gradient descent with differential privacy guarantees.
result Achieves statistical efficiency and privacy in IVaR regression.
This paper improves privacy accounting in decentralized FL using f-Differential Privacy.
problem Challenges in accurately quantifying privacy budget in decentralized FL.
method Develops two new f-DP-based accounting methods for decentralized FL.
result Yields tighter (ε,δ) bounds and improved utility compared to existing methods.
We consider the problem of learning Markov Random Fields (including the prototypical example, the Ising model) under the constraint of differential privacy. Our learning goals include both structure learning, where we try to estimate the underlying graph structure of the model, as well as the harder goal of parameter l…
Paper develops privacy-preserving federated learning for nonsmooth objectives.
problem Solving nonsmooth objective functions in a privacy-preserving manner.
method Zero-concentrated differential privacy (zCDP) with Gaussian noise, distributed ADMM, and approximation of augmented Lagrangian.
result The algorithm achieves a competitive privacy-accuracy trade-off and converges to the exact solution.
Deep neural networks with their large number of parameters are highly flexible learning systems. The high flexibility in such networks brings with some serious problems such as overfitting, and regularization is used to address this problem. A currently popular and effective regularization technique for controlling the…
Generative Adversarial Network (GAN) and its variants have recently attracted intensive research interests due to their elegant theoretical foundation and excellent empirical performance as generative models. These tools provide a promising direction in the studies where data availability is limited. One common issue i…
Iteratively reweighted least squares (IRLS) is a widely-used method in machine learning to estimate the parameters in the generalised linear models. In particular, IRLS for L1 minimisation under the linear model provides a closed-form solution in each step, which is a simple multiplication between the inverse of the we…
The iterative nature of the expectation maximization (EM) algorithm presents a challenge for privacy-preserving estimation, as each iteration increases the amount of noise needed. We propose a practical private EM algorithm that overcomes this challenge using two innovations: (1) a novel moment perturbation formulation…
Iterative algorithms, like gradient descent, are common tools for solving a variety of problems, such as model fitting. For this reason, there is interest in creating differentially private versions of them. However, their conversion to differentially private algorithms is often naive. For instance, a fixed number of i…
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.
Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.
problem Minimizing regret in stochastic bandits under ε-global Differential Privacy.
method Developed DP versions of KLUCB and IMED, proving tighter lower bounds and matching upper bounds.
result DP-KLUCB and DP-IMED achieve asymptotically optimal regret under ε-global DP.
Optimal Gaussian noise mechanisms achieve nearly optimal error in unbiased mean estimation.
problem Efficiently estimating the mean of high-dimensional data while preserving privacy.
method Differential privacy mechanisms with Gaussian noise, focusing on optimal covariance.
result Gaussian noise mechanisms achieve nearly optimal error among all private unbiased mean estimation mechanisms.
Polynomial-time algorithm estimates mean with bounded covariance using differential privacy.
problem Estimating mean of a d-variate distribution with differential privacy constraints.
method Sum of Squares (SoS) exponential mechanism for polynomial-time differentially private estimation.
result First polynomial-time algorithm with O(d) samples for mean estimation under pure differential privacy. Novel PP-ADMM and IPP-ADMM algorithms improve differential privacy in distributed machine learning.
problem Privacy concerns in ADMM-based distributed machine learning.
method Proposes PP-ADMM and IPP-ADMM algorithms to provide differential privacy while improving model accuracy and convergence.
result The proposed algorithms achieve better model accuracy and convergence under the same privacy guarantee.
PACE-GGM uses Gaussian mechanism for private covariance estimation.
problem Private estimation of covariance matrices in high dimensions.
method Data-adaptive selection of entries, Gaussian mechanism, maximum-entropy reconstruction.
result Consistent improvements in estimation error compared to Gaussian mechanism and baselines.
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…
Unified bounds for DP risks reduce noise and improve accuracy.
problem Difficult interpretation and calibration of DP mechanisms.
method Hypothesis-testing interpretation of DP (f-DP) and unified bounds. result Unified bounds are tighter and tunable for specific risks.
The rapid adoption of machine learning has increased concerns about the privacy implications of machine learning models trained on sensitive data, such as medical records or other personal information. To address those concerns, one promising approach is Private Aggregation of Teacher Ensembles, or PATE, which transfer…
Due to massive amounts of data distributed across multiple locations, distributed machine learning has attracted a lot of research interests. Alternating Direction Method of Multipliers (ADMM) is a powerful method of designing distributed machine learning algorithm, whereby each agent computes over local datasets and e…
Optimizes privacy-preserving optimization for heavy-tailed data.
problem Privacy-preserving optimization with heavy-tailed gradients.
method Pure ε-differential privacy framework for Lipschitz extensions.
result Minimax optimal excess-risk rate for pure ε-DP heavy-tailed SCO.
Develops a computationally tractable differentially private mean estimator called the balloon mean.
problem Robust mean estimation in the presence of outliers and heavy-tailed distributions.
method Iterative clipping procedure over Mahalanobis balls.
result Balloon mean is robust to outliers and outperforms existing estimators in contaminated settings.
Noise addition prevents overfitting in adaptive data analysis.
problem Overfitting in repeated use of a data sample via adaptively chosen queries.
method Simple noise addition algorithms and differential privacy-based analysis.
result Noise-addition algorithms provide variance-dependent guarantees for unbounded queries.
Improves privacy amplification by shuffling for differential privacy.
problem Enhancing privacy guarantees in systems with anonymous data contributions.
method Theoretical and numerical analysis of Rényi differential privacy parameters and privacy amplification by shuffling.
result First asymptotically optimal analysis of Rényi differential privacy parameters for shuffled outputs.
New privacy framework tailored to specific data distributions.
problem Protecting individual data points in decision-making processes.
method Introducing tangent differential privacy, a new form of differential privacy.
result Entropic regularization guarantees tangent differential privacy under general conditions.
Differential privacy is a statistical concept that can be explained through hypothesis testing.
problem Formalizing differential privacy as a statistical concept.
method Using David Blackwell's informativeness theorem, the paper shows differential privacy can be understood through hypothesis testing.
result The definition of f-differential privacy provides a unified framework for analyzing privacy bounds. New federated f-differential privacy for collaborative learning.
problem Privacy in federated learning.
method Introducing federated f-differential privacy and proposing a generic private federated learning framework. result Proves federated f-differential privacy provides privacy guarantee on each record of one client's data. Addresses theoretical and practical aspects of Gaussian differential privacy.
problem Theoretical and practical challenges in privacy-preserving data analysis.
method Discussion of f-differential privacy and Gaussian differential privacy.
result Gaussian differential privacy can enhance privacy in various applications.
Improved BAI under DP reduces gap to constant.
problem Fixed-confidence BAI under global DP for Bernoulli distributions.
method New lower bound, stopping rule, and Top Two sampling rule.
result Reduces gap to a small multiplicative constant.
Proposes a privacy-preserving recommendation system using matrix factorization and differential privacy.
problem Privacy leakage in recommendation systems when anonymizing user data is not sufficient.
method Uses matrix factorization and differential privacy via the Gaussian mechanism.
result Demonstrates excellent utility for privacy-preserving recommendation systems.
Differential privacy improves AI security, fairness, and learning.
problem Privacy violations, security issues, and model fairness in AI.
method Application of differential privacy in various AI areas.
result Differential privacy enhances AI performance in multiple areas.
New method reduces privacy impact on model accuracy for underrepresented groups.
problem Privacy mechanisms disproportionately affect underrepresented groups in machine learning models.
method Proposes DPSGD-F, a modified DPSGD that adjusts group contributions based on clipping bias.
result DPSGD-F removes disparate impact of differential privacy on model accuracy for protected groups.
This paper benchmarks privacy-preserving machine learning on medical images.
problem Ensuring privacy in medical image analysis while maintaining model accuracy.
method Comparing Local-DP and DP-SGD for differential privacy in medical imagery.
result Theoretical privacy guarantees do not fully align with real-world performance.
Novel compression method preserves privacy while reducing communication costs.
problem Reducing communication costs in differential privacy mechanisms.
method Poisson private representation (PPR) for compressing and simulating local randomizers.
result Achieves compression within a logarithmic gap from theoretical lower bound.
Differentially private algorithms protect model explanations from leaking training data.
problem Model explanations can leak training data, compromising privacy.
method Adaptive differentially private gradient descent algorithm to produce accurate, private explanations.
result Privacy amplification and reduction of overall privacy loss on explanation data.
Differential privacy protects data privacy by adding noise to data.
problem Leakage of sensitive data through common methods like encryption and endpoint protection.
method Randomized response technique to add noise to data collection.
result Differential privacy ensures strong privacy with better utility.
Develops a computationally tractable high-dimensional differential privacy estimator.
problem Differential privacy in high dimensions is computationally intractable.
method Combines high-dimensional robust statistics with differential privacy techniques.
result A computationally tractable algorithm with dimension-independent privacy loss.
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.
Private minimum Hellinger distance estimators maintain robustness and efficiency while ensuring privacy.
problem Ensuring privacy in robust statistical estimation.
method Derive private minimum Hellinger distance estimators satisfying Hellinger differential privacy.
result Private minimum Hellinger distance estimators retain robustness and efficiency under privacy constraints.
This paper bounds min-entropy leakage for Blowfish privacy using graph symmetries.
problem Bounding min-entropy leakage for Blowfish privacy mechanisms.
method Organizing analysis over symmetrical partitions corresponding to orbits of graph automorphism groups.
result Demonstrates a construction meeting the bound with asymptotic equality, showing tightness.