Privacy-preserving multi-party contextual bandits learn without sharing data.
problem Privacy-preserving learning for contextual bandits with multiple parties.
method Secure multi-party computation combined with epsilon-greedy differential privacy.
result Developed a privacy-preserving multi-party contextual bandit algorithm.
DP-NCB algorithm ensures privacy and fairness in bandit decisions.
problem Achieving both privacy and fairness in bandit algorithms.
method Differentially Private Nash Confidence Bound (DP-NCB) framework.
result DP-NCB achieves optimal Nash regret while maintaining privacy.
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.
Paper presents a privacy-preserving method for dynamic assortment selection.
problem Personalized assortment recommendations with data privacy concerns.
method Perturbed upper confidence bound method integrating calibrated noise.
result Policy satisfies Joint Differential Privacy (JDP) with near-optimal regret bound.
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.
Paper proposes no-regret algorithms for private GP bandit optimization.
problem Private Gaussian process bandit optimization.
method Combines uniform kernel approximator with random perturbations for differentially private GP bandit algorithms.
result Provable no-regret algorithms for stationary kernel functions in two DP settings.
We study a variant of the stochastic multi-armed bandit (MAB) problem in which the rewards are corrupted. In this framework, motivated by privacy preservation in online recommender systems, the goal is to maximize the sum of the (unobserved) rewards, based on the observation of transformation of these rewards through a…
FLIPHAT addresses joint differential privacy for high-dimensional sparse linear bandits.
problem Efficient sequential decision-making with high-dimensional sparse features and privacy concerns.
method FLIPHAT combines iterative forgetting and N-IHT for sparse linear regression, achieving optimal regret.
result FLIPHAT achieves optimal regret in terms of privacy parameters, context dimension, and time horizon.
This work improves privacy in federated combinatorial bandits by balancing regret and privacy.
problem Privacy-preserving learning in competitive online learning settings with quality constraints.
method Proposes P-FCB algorithm for federated combinatorial bandits, balancing regret and privacy.
result Improves regret while maintaining quality constraints and privacy guarantees.
Paper addresses privacy in combinatorial semi-bandits with improved bounds.
problem Privacy-preserving learning in combinatorial semi-bandits with additional dimension dependence.
method Proposes novel algorithms and proves optimal regret bounds for LDP and DP settings.
result Achieves nearly optimal regret bounds for LDP and DP settings, matching non-private rates.
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.
New algorithm for privacy-preserving nonconvex optimization.
problem Privacy-preserving nonconvex empirical risk minimization.
method Differentially private stochastic gradient descent algorithm.
result Achieves strong privacy guarantees efficiently with improved utility.
Paper tackles privacy-preserving data density issues using deconvolution.
problem Privacy-preserving noise affects data density, leading to under/over-estimation.
method Develops deconvoluting kernel density estimators and regression models.
result Demonstrates improved accuracy in estimating heavy-hitters with locally differential data.
Privacy-preserving deep learning for medical data across distributed platforms.
problem Data leakage in medical platforms.
method Separates hidden layers; first layer local, others centralized for training.
result Improved learning performance with all data used during training.
Privacy-preserving eye tracking framework using synthetic images.
problem Preserving sensitive personal information in eye tracking technology.
method Randomized encoding for privacy, Support Vector Regression model training on synthetic eye images.
result Framework achieves real-time gaze estimation with same accuracy as non-private version.
This paper analyzes privacy-preserving methods for collaborative forecasting.
problem Data owners' reluctance to share data due to competitive and privacy concerns.
method Examines three groups of privacy-preserving methods: data transformation, secure multi-party computations, and decomposition methods.
result State-of-the-art techniques have limitations in preserving data privacy, such as trade-offs between privacy and forecasting accuracy.
Paper discusses privacy issues in IoT and proposes a lightweight neural network approach.
problem Privacy concerns in IoT due to extensive data collection and processing.
method Developed a privacy-preserving inference approach for IoT objects and a deep neural network in the cloud.
result Satisfactory performance of the proposed approach on the MNIST dataset.
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.
We detail a new framework for privacy preserving deep learning and discuss its assets. The framework puts a premium on ownership and secure processing of data and introduces a valuable representation based on chains of commands and tensors. This abstraction allows one to implement complex privacy preserving constructs …
Proposes differentially private normalizing flows for privacy-preserving density estimation.
problem Privacy concerns in density estimation models when individuals are directly associated with the training data.
method Uses normalizing flow models with explicit differential privacy guarantees.
result Substantially outperforms previous state-of-the-art approaches in privacy-preserving density estimation.
Proposes using probabilistic models for privacy-preserving synthetic data.
problem Designing high-quality synthetic data for privacy preservation.
method Formulate the problem through probabilistic modelling, choosing a model for the data.
result Statistical discoveries can be reliably reproduced from synthetic data.
Gradient sparsification enhances privacy-preserving machine learning models.
problem Improving performance of differentially-private machine learning models under privacy constraints.
method Gradient sparsification combined with compressed sensing and additive Laplace noise.
result Gradient sparsification can improve performance of differentially-private machine learning models for small privacy budgets.
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.
Safeguarding privacy in machine learning is highly desirable, especially in collaborative studies across many organizations. Privacy-preserving distributed machine learning (based on cryptography) is popular to solve the problem. However, existing cryptographic protocols still incur excess computational overhead. Here,…
The use of inverse probability weighting (IPW) methods to estimate the causal effect of treatments from observational studies is widespread in econometrics, medicine and social sciences. Although these studies often involve sensitive information, thus far there has been no work on privacy-preserving IPW methods. We add…
FedGP uses GANs to generate private data samples in federated learning.
problem Privacy-preserving data release in federated learning.
method FedGP employs generative adversarial networks (GANs) with FedAvg for privacy-preserving data generation.
result FedGP generates high-quality labelled data that can train and validate supervised models securely.
Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.
problem Lack of formal proofs of privacy in PP-GANs for image sanitization.
method Subverted PP-GANs for facial expression recognition to hide sensitive data in sanitized images.
result It is possible to hide sensitive identification data in sanitized PP-GAN output images, even allowing reconstruction of entire input images.
Three privacy-preserving methods for median regression are proposed.
problem Protecting individual privacy in median regression analysis.
method Three privacy-preserving methods: finite smoothing, iterative, and greedy coordinate descent.
result Numerical results show varying performance across different sample sizes.
This paper applies secure multi-party computation to K-means clustering to protect private data.
problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.
Paper tightens privacy and generalization bounds for iterative learning.
problem Balancing privacy and generalization in iterative learning algorithms.
method Established alignment between generalization and privacy, derived composition theorems for iterative algorithms.
result Generalization bounds for iterative learning algorithms are strictly tighter than existing works.
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.
Efficiently preserves privacy in logistic regression for IoT data.
problem Balancing data privacy and utility in collaborative learning.
method Matrix encryption approach for secure multi-party computation.
result Proposes a privacy-preserving logistic regression model with fast convergence.
We propose a data-driven framework for optimizing privacy-preserving data release mechanisms to attain the information-theoretically optimal tradeoff between minimizing distortion of useful data and concealing specific sensitive information. Our approach employs adversarially-trained neural networks to implement random…
P3GM improves privacy-preserving data synthesis for high-dimensional data.
problem Mitigating privacy risks in releasing large volumes of sensitive data.
method Privacy-preserving phased generative model (P3GM) with two-phase learning process.
result P3GM significantly outperforms existing solutions in terms of noise reduction and data accuracy.
Paper presents privacy-preserving techniques for HD computing.
problem Privacy loss in HD computing due to reversible computation.
method Quantization and pruning of hypervectors for differential privacy.
result Differentially private HD model for cloud inference.
Despite the impressive performance of random forests (RF), its theoretical properties have not been thoroughly understood. In this paper, we propose a novel RF framework, dubbed multinomial random forest (MRF), to analyze the \emph{consistency} and \emph{privacy-preservation}. Instead of deterministic greedy split rule…
VFGNN tackles privacy-preserving node classification with federated GNN.
problem Data isolation problem in graph data.
method Vertically partitioned federated GNN, differential privacy.
result Demonstrates effectiveness of VFGNN on three benchmarks.
Deep Learning techniques have achieved remarkable results in many domains. Often, training deep learning models requires large datasets, which may require sensitive information to be uploaded to the cloud to accelerate training. To adequately protect sensitive information, we propose distributed layer-partitioned train…
Improves privacy guarantees by analyzing randomness in privacy-preserving mechanisms.
problem Balancing user privacy and business constraints in privacy-preserving mechanisms.
method Analyzes explicit and implicit randomness in privacy mechanisms and proposes a probabilistic calibration method.
result Proposes privacy at risk, providing stronger privacy guarantees with quantifiable risks.
Framework prevents data leakage in mobile cloud DNNs.
problem Data leakage from cloud DNNs poses privacy risks.
method Privacy-preserving reinforcement learning framework.
result Framework successfully defends against various privacy attacks.
Secure Multiparty Computation protects data privacy in Symbolic Regression.
problem Data privacy in Symbolic Regression models.
method Secure Multiparty Computation for vertical partitioning.
result Comparable performance to centralized model while preserving privacy.
Efficient privacy-preserving machine learning framework using random transformations.
problem Slow training and inference speed in privacy-preserving machine learning systems.
method Random transformations like linear and permutation, combined with arithmetic sharing.
result High efficiency and low computation cost in private machine learning.
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.
Efficient framework for training machine learning models at edge without data movement.
problem Lack of privacy-preserving and computationally efficient methods for deep learning model training.
method Privacy preserving FedCollabNN framework for federated learning.
result Framework is computationally efficient and robust against adversarial attacks.
Develops privacy-preserving methods for equivalence testing in healthcare.
problem Protecting patient data in healthcare studies.
method Differential privacy techniques for simulation-based calibration.
result Maintains type-I error control and comparable power to non-private methods.
Paper proposes a privacy-preserving RL algorithm for linear MDPs with theoretical guarantees.
problem Protecting users' private data in personalized services using RL.
method Local differential privacy (LDP) for RL with linear function approximation.
result Achieves a regret bound of $O(d^{5/4}H^{7/4}T^{3/4}\left(\log(1/δ)
ight)^{1/4}\sqrt{1/\varepsilon})$ for linear mixture MDPs.
Secure XGB for privacy-preserving machine learning in federated learning.
problem Privacy-preserving machine learning in federated learning with practical gradient tree boosting models.
method Secure multi-party computation, distributed model storage, secure permutation protocols.
result Our XGB models provide competitive accuracy and practical performance.
A framework for privacy-preserving DNN pruning and acceleration.
problem Privacy concerns in DNN weight pruning for mobile devices.
method ADMM-based iterative pruning with synthetic data, compiler optimizations.
result 4.2X, 2.5X, and 2.0X speedup with almost no accuracy loss.