New algorithm reduces privacy cost of LDP to central privacy model.
problem Collecting sensitive statistics from multiple users over time.
method Privacy amplification technique using permutation-invariant algorithms.
result Privacy cost of LDP can be much lower in central model.
Paper introduces input perturbation for privacy in machine learning models.
problem Protecting both training data and model parameters while maintaining privacy.
method Add noise to training data and train with perturbed data for differential privacy.
result Achieves (ε,δ)-differential privacy on the final model with privacy on original data.
A privacy-preserving algorithm for high-dimensional bandits.
problem High-dimensional stochastic contextual linear bandits with sparse parameters under privacy constraints.
method PrivateLASSO algorithm based on sparse hard-thresholding and episodic thresholding.
result Minimax private lower bounds and utility guarantees for PrivateLASSO.
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.
This paper proves a central limit theorem for differential privacy in high dimensions.
problem Understanding optimal noise distributions for privacy-accuracy trade-offs in high-dimensional settings.
method Developed a central limit theorem approach to analyze differential privacy mechanisms.
result Gaussian mechanisms achieve the optimal privacy-accuracy trade-off in high dimensions.
FSL-BDP models time-to-default without centralizing data, improving privacy mechanisms in federated settings.
problem Traditional credit risk models ignore default timing and violate data-protection rules.
method Federated Survival Learning with Bayesian Differential Privacy (FSL-BDP).
result FSL-BDP improves privacy mechanisms in federated settings, outperforming classical DP in most clients.
Paper tackles federated learning with privacy, enhancing target data analysis.
problem Heterogeneity and privacy of distributed data in federated learning.
method Formulates federated differential privacy, studies statistical problems under privacy constraints.
result Federated differential privacy offers a balance between privacy and knowledge transfer.
ARA combines aggregated RAPPOR and Tf-Idf estimation for centralized DP analysis.
problem Gap between local and central DP approaches in terms of data storage, analysis speed, and amount of data.
method Collects RAPPOR reports from multiple clients, pushes them to a Tf-Idf estimation model, and analyzes them for centralized DP.
result Successfully and efficiently analyzed major truth values from multiple clients.
New framework for differential privacy in vertically partitioned multiparty learning.
problem Challenges in preserving differential privacy under multiparty, especially vertically partitioned, settings.
method Functional mechanism with noise addition and secure aggregation.
result Released model achieves the same utility as centralized setting with one round of noise addition and secure aggregation.
Three tools improve practical differential privacy.
problem Challenges in applying differential privacy to real-world data.
method Three tools: sanity checks, adaptive clipping, and large-batch training.
result Improves model performance and practicality of differential privacy.
Study compares federated and centralized learning for patient data privacy.
problem Ensuring privacy in machine learning models trained on electronic health records.
method Examined private and non-private federated learning for clinical prediction tasks.
result Differentially private stochastic gradient descent is effective in centralized learning but challenging in federated learning.
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.
Paper improves privacy-accuracy balance in federated learning.
problem Privacy-accuracy tradeoffs in federated learning.
method Personalized federated learning with joint differential privacy.
result Coordination of local and centralized learning improves accuracy while maintaining privacy.
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.
This paper analyzes user-level local differential privacy in distributed systems.
problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.
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.
Bayesian VFLMSP improves multimodal survival prediction with privacy.
problem Privacy and reliability in multimodal time-to-event prediction.
method Bayesian Vertical Federated Learning (VFL) with differential privacy.
result Consistent improvements in C-index compared to existing methods.
Optimal privacy-preserving ranking from noisy comparisons.
problem Protecting individual privacy in ranking from noisy comparisons.
method Differentially private ranking algorithms under edge and individual differential privacy.
result Achieved minimax optimal rates of convergence under privacy constraints.
Paper proposes a federated learning method for quantile inference with local differential privacy.
problem Federated learning of quantile inference under local differential privacy constraints.
method Local stochastic gradient descent with randomized mechanism for privacy and efficiency.
result Asymptotic normality and functional central limit theorem for the proposed estimator.
Paper optimizes federated PCA for covariance estimation under privacy constraints.
problem Privacy-preserving covariance estimation in federated learning.
method Federated PCA, matrix version of van Trees' inequality, three-layer spectral decomposition.
result Optimal rates of convergence for central server's estimation, robust to inconsistent local estimators.
New framework resolves central limit behavior in differential privacy.
problem Choosing appropriate privacy metrics in hypothesis testing.
method Infinitely divisible limit experiments and Le Cam's theory.
result Characterizes all limiting baseline trade-off functions in differential privacy.
Paper explores differential privacy in high-dimensional federated learning, tackling server trustworthiness and estimation.
problem Maintaining privacy in distributed environments with high-dimensional data.
method Investigates scenarios with untrusted and trusted central servers, introduces novel federated estimation algorithms for linear regression models.
result Tight minimax rates depend on high-dimensionality even with sparsity assumptions, and novel algorithms handle slight variations among distributed models.
Simpler, faster algorithm for uniformity testing in the shuffle model.
problem Testing uniformity of data in the shuffle model with privacy constraints.
method Simplified analysis and use of privacy amplification via shuffling.
result An algorithm with the same guarantees but simpler and more streamlined.
Sharp privacy bounds for sequential analysis of sensitive data.
problem Privacy degradation under sequential analysis of sensitive data.
method Edgeworth expansion in f-differential privacy framework.
result Improved privacy bounds under composition with refined approximation accuracy.
The exponential mechanism is extended to infinite dimensional outputs, leading to a Central Limit Theorem and a non-negligible privacy noise.
problem Extending the exponential mechanism to infinite dimensional outputs for privacy and statistical estimation.
method Designing the exponential mechanism with respect to a specific base measure over the output space, and proving a Central Limit Theorem.
result The magnitude of privacy noise is asymptotically non-negligible relative to the statistical estimation error.
Study privacy vs. utility in estimating network parameters with aggregated data.
problem Privacy-preserving estimation of network parameters from aggregated node degrees.
method β model, local and central differential privacy, minimax lower bounds, simple estimators.
result Achieved minimax-optimal risk bounds for parameter estimation under privacy constraints.
New privacy model improves data analysis utility.
problem Poor privacy-utility tradeoff in local differential privacy.
method Profile-based privacy, leveraging graph of data distributions.
result Achieves higher utility than local differential privacy.
In many signal processing and machine learning applications, datasets containing private information are held at different locations, requiring the development of distributed privacy-preserving algorithms. Tensor and matrix factorizations are key components of many processing pipelines. In the distributed setting, diff…
This paper addresses privacy concerns in ratio statistics using differential privacy.
problem Privacy concerns in ratio statistics across machine learning areas.
method Develops a simple algorithm for differentially private ratio statistics, proving consistency and constructing confidence intervals.
result A simple algorithm can provide excellent privacy, sample accuracy, and bias properties in ratio statistics.
A(DP)2SGD improves federated learning privacy and efficiency.
problem Privacy and efficiency in federated learning with asynchronous decentralized parallel SGD.
method Differentially private asynchronous decentralized parallel SGD (A(DP)2SGD) using R{é}nyi differential privacy. result Achieves optimal convergence rate and comparable model accuracy to SSGD but faster.
FedIRT enables privacy-preserving psychometric estimation without centralizing data.
problem Privacy and data governance concerns in centralized IRT estimation.
method Federated Item Response Theory (FedIRT) and FedIRT-DP for differentially private estimation.
result FedIRT matches accuracy of centralized estimators while preserving privacy.
Graph-based multimodal federated learning for HAR improves accuracy and privacy.
problem Challenges in HAR due to noisy data, incomplete measurements, and privacy concerns.
method Proposes GraMFedDHAR, a Graph-based Multimodal Federated Learning framework for HAR tasks, using modality-specific graphs, residual GCNs, and attention-based fusion.
result Experimental results show up to 13 percent performance improvement for MultiModalGCN under differential privacy constraints.
The paper extends statistical estimation techniques under differential privacy.
problem Establishing sample complexity bounds for estimation tasks under differential privacy.
method Proposes analogues of Le Cam's method, Fano's inequality, and Assouad's lemma under central differential privacy.
result Optimal sample complexity bounds for discrete distribution estimation under total variation and ℓ2 distances. 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.
FPFL mitigates unfairness in private federated learning.
problem Differential privacy degrades model performance on under-represented groups.
method Extends modified method of differential multipliers to private federated learning.
result FPFL reduces unfairness in trained models on private federated learning.
The paper proposes simple models for interpretable predictions while maintaining privacy.
problem Balancing interpretability and privacy in complex machine learning models.
method Locally linear maps per class to approximate complex models, ensuring differential privacy.
result High classification accuracy with differentially private explanations.
Tempered sigmoids improve deep learning privacy.
problem Privacy-preserving deep learning with strict differential privacy guarantees.
method Developed tempered sigmoid activation functions for deep learning models.
result Tempered sigmoids outperform ReLU in achieving state-of-the-art accuracy.
Noise-aware Bayesian inference framework for locally private data collection.
problem Privacy-preserving data collection with non-trustworthy aggregators.
method Noise-aware probabilistic modeling framework for Bayesian inference under LDP.
result Demonstrated efficacy in parameter estimation for various distributions and regression models.
Decor protects decentralized learning models from curious users.
problem Privacy violation in decentralized learning.
method Decor uses correlated Gaussian noises to protect local models in decentralized SGD with differential privacy guarantees.
result Decor matches central DP optimal privacy-utility trade-off for arbitrary connected graphs.
Myelin framework trains deep learning models on private data.
problem Training deep learning models on private data without revealing the data.
method Combines privacy-preserving techniques like differential privacy and trusted hardware enclaves.
result Establishes a baseline for fully private machine learning performance.
Study shows FL reduces unintended memorization by clustering data and using strong user-level privacy.
problem Unintended memorization in federated learning.
method Examined the effect of clustering data and using strong user-level differential privacy in FL.
result Clustering data and strong user-level differential privacy reduce unintended memorization.
Privacy-preserving reinforcement learning from human feedback using decoupled reward modeling.
problem Training large language models with sensitive user information while preserving privacy.
method Proposes a privacy-preserving framework that imposes differential privacy on reward learning only.
result Privacy contributes an additional additive term to the suboptimality gap, and the upper bound is rate-optimal up to logarithmic factors.
A new federated learning framework with sparsification and adaptive optimization for privacy and efficiency.
problem Lack of sufficient privacy protection in federated learning.
method Integrates random sparsification with gradient perturbation and acceleration techniques to enhance privacy and efficiency.
result Outperforms previous differentially-private federated learning approaches in privacy and efficiency.
This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.
problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.
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.
P2B improves local agent performance with differential privacy.
problem Improving local agent performance with differential privacy.
method Differential privacy technique to collect and update local agents' feedback.
result Competitive performance on synthetic and real-world data.
New method reduces communication in distributed learning, improving privacy and utility.
problem Distributed learning with minimal communication and privacy protection.
method Non-interactive blind model averaging (BlindAvg) with output perturbation.
result BlindAvg converges to centralized learning with strong L2-regularization and SoftmaxReg for better privacy-utility tradeoff.
Paper tackles privacy issues in LDA model training.
problem Privacy leakage in LDA model training.
method Developed privacy monitoring and locally private LDA training algorithms.
result Demonstrated effectiveness of locally private LDA training on crowdsourced data.