Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

71141212282 · Jun 202019922001200920172026
48 results for Privacy Utility Trade-off

Differential privacy is a mathematical framework for privacy-preserving data analysis. Changing the hyperparameters of a differentially private algorithm allows one to trade off privacy and utility in a principled way. Quantifying this trade-off in advance is essential to decision-makers tasked with deciding how much p…

2019-05-26abs ↗pdf ↗

LDP is equivalent to contraction of E_γ-divergence, impacting privacy and utility.

problem Analyzing trade-offs between privacy and utility in estimation problems.
method Equivalence of LDP constraints to contraction coefficients of E_γ-divergence, using f-divergences and estimation-theoretic tools.
result LDP guarantees can be expressed in terms of contraction coefficients of arbitrary f-divergences.

The Sampled Gaussian Mechanism's noise level decreases with larger subsampling rates, improving privacy-utility trade-offs.

problem Improving privacy-utility trade-offs in differentially private stochastic optimization.
method Proof of a conjecture about the Sampled Gaussian Mechanism's noise level and subsampling rate relationship.
result A rigorous proof of the conjecture, completing the proof of Theorem 6.2 in the original paper.

Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.

problem Standard differential privacy ignores feature correlation, leading to suboptimal privacy-utility balance.
method Introduces CorrDP framework that accounts for feature correlation, using total variation distance for quantification.
result CorrDP algorithms outperform standard DP in synthetic and real-world datasets with insensitive features.

Differentially private GANs improve image privacy without significant quality loss.

problem Anonymizing image data sets while maintaining image quality.
method Training GANs with differential privacy on MNIST, analyzing privacy-utility trade-offs and explaining optimization methods.
result An increasing privacy budget adds little to generated image quality, revealing a saturated training regime.

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.

Paper assesses the market value of sharing privacy-protected smart meter data.

problem Value of sharing privacy-protected smart meter data between consumers and load serving entities.
method Discounted differential privacy model, ANN-based load forecasting, optimal procurement problem.
result Significant value in sharing smart meter data while retaining individual consumer privacy.

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 …

2019-02-24abs ↗pdf ↗

Normalization layers improve the accuracy of Differentially Private training of deep neural networks.

problem Reduced accuracy in deep neural networks with Differentially Private training.
method Proposed a novel method for integrating batch normalization with Differentially Private Stochastic Gradient Descent (DPSGD) without additional privacy loss.
result Training deeper networks with better utility-privacy trade-off is possible.

Link prediction (LP) algorithms propose to each node a ranked list of nodes that are currently non-neighbors, as the most likely candidates for future linkage. Owing to increasing concerns about privacy, users (nodes) may prefer to keep some of their connections protected or private. Motivated by this observation, our …

2019-07-20abs ↗pdf ↗

Novel privacy model for decentralized data analysis.

problem Achieving good privacy-utility trade-off in federated learning.
method Introducing network Differential Privacy (network DP) for decentralized algorithms.
result Privacy-utility trade-offs of network DP algorithms significantly improve upon LDP and trusted curator model.

Regularization can improve both privacy and performance in machine learning models.

problem Privacy vs. Utility trade-off in machine learning models.
method The study uses logistic regression with ridge regularization and a leave-one-out analysis tool.
result Increasing the number of parameters can improve both privacy and performance when coupled with proper regularization.

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.

Paper improves privacy-utility trade-off in federated learning.

problem Repeated parameter sharing in federated learning leaks private data.
method Proposes a new representation federated learning objective with differential privacy guarantees.
result Algorithm \DPFEDREP\ converges to a global optimal solution with a linear rate and privacy budget-dependent radius.

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.

Conformal-DP improves differential privacy on manifold data by calibrating perturbations based on local densities.

problem Lack of density-awareness in existing differential privacy mechanisms for manifold data leads to biased and suboptimal privacy-utility trade-offs.
method Proposes Conformal-DP, a density-aware differential privacy mechanism using conformal transformations to calibrate perturbations based on local densities.
result Demonstrates improved privacy-utility trade-off in heterogeneous data distribution settings compared to state-of-the-art mechanisms.

Generative text classifiers are most vulnerable to membership inference attacks.

problem Privacy threat from Membership Inference Attacks on generative text classifiers.
method Comprehensive empirical evaluation of generative, discriminative, and pseudo-generative classifiers across various datasets.
result Generative classifiers explicitly modeling P(X,Y)P(X,Y) are most vulnerable to membership leakage.

PrAda-GAN improves synthetic data generation under differential privacy.

problem Generating synthetic data under differential privacy with marginal-based methods.
method Sequential generator architecture integrating GAN and marginal-based approaches, with adaptive regularization of Bayes network structure.
result PrAda-GAN outperforms existing methods in privacy-utility trade-off on synthetic and real-world datasets.

Improved privacy and utility in machine learning with adaptive differential privacy.

problem Enhancing privacy in machine learning models while maintaining utility.
method Adaptive differentially private (ADP) learning method that optimally adapts noise to stepsize.
result ADP method significantly improves utility compared to standard differentially private methods.

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.

DP-CDA generates synthetic data to enhance privacy in high-dimensional datasets.

problem Privacy concerns in anonymized datasets, especially in high-dimensional data.
method Randomized mixing of privacy-sensitive data in a class-specific manner with carefully tuned randomness.
result DP-CDA provides stronger privacy guarantees compared to existing methods, maintaining utility.

Paper analyzes trade-offs between fairness, privacy, and accuracy using Chernoff Information.

problem The relationship between fairness and privacy in machine learning.
method Utilizes Chernoff Information to characterize trade-offs, proposes Chernoff Difference and Noisy Chernoff Difference, develops CINE for neural estimation.
result Shows three distinct behaviors of Noisy Chernoff Difference based on data distribution.

The paper analyzes and improves privacy in machine learning through importance sampling.

problem Ensuring privacy in machine learning while maintaining utility and efficiency.
method Individualized privacy analysis of importance sampling, proposing two approaches for constructing sampling distributions.
result Proposed approaches optimize privacy-efficiency trade-off and outperform uniform sampling.

Enhanced privacy, utility, and efficiency through MUST subsampling.

problem Balancing privacy, utility, and computational efficiency in data analysis.
method MUltistage Sampling Technique (MUST) for privacy amplification in differential privacy.
result MUST offers stronger privacy guarantees (ϵ\epsilon) than one-stage subsampling methods while maintaining similar utility and computational efficiency.

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.

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 two-sample tests under LDP achieve minimax rates for multinomial and continuous data.

problem Achieving statistical utility while maintaining privacy in two-sample testing.
method Private permutation tests for multinomial data and adaptive tests for continuous data.
result Minimax optimal tests for private two-sample testing under LDP.

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.

Significant success has been realized recently on applying machine learning to real-world applications. There have also been corresponding concerns on the privacy of training data, which relates to data security and confidentiality issues. Differential privacy provides a principled and rigorous privacy guarantee on mac…

2017-12-25abs ↗pdf ↗

This work improves federated learning privacy and accuracy with non-private data sharing and approximate gradient coding.

problem Challenges of non-IID data and stragglers in federated learning.
method Data-driven strategy combining offline data sharing and approximate gradient coding.
result Achieves a trade-off between privacy and utility, leading to improved model convergence and accuracy.

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two objectives are antagonistic and leaking this information might be more rewarding than concealing it. Unlike classical solutions that focus on …

2019-05-27abs ↗pdf ↗

New method calibrates noise for attack risk, improving ML model accuracy.

problem Improving accuracy of privacy-preserving ML models while maintaining privacy.
method Directly calibrates noise scale to a desired attack risk level, bypassing the standard ε\varepsilon-calibration.
result Significantly decreases noise scale, leading to increased utility at the same risk level.

Paper develops novel privacy mechanism for Riemannian manifold data using geometric analysis and heat diffusion.

problem Privacy-preserving estimation of generalized Frechet mean on Riemannian manifolds.
method Characterizes Renyi divergence via Harnack inequalities, introduces mechanisms based on heat diffusion and Langevin process.
result Proposes mechanisms for nonnegative and general Riemannian manifolds with detailed utility analyses.

Hybrid approach protects privacy while analyzing smart meter data.

problem Privacy concerns in AMI data analysis under CPUC regulations.
method Anonymization, differential privacy, federated learning, synthetic data, cryptography.
result Comprehensive privacy-preserving analytics framework for AMI data.

Enhances privacy in data annotation and inspection with synthetic data.

problem Improving privacy in machine learning tasks like data annotation and inspection.
method Employing Bayesian differential privacy to generate higher-fidelity synthetic data.
result Produces higher-fidelity samples, detecting more subtle data errors and biases.

This work proposes a novel privacy-preserving method for synthetic replacement of sensitive data.

problem Privacy-preserving transformations of sensitive data.
method Adversarial representation learning for synthetic replacement of private attributes.
result Our method provides stronger privacy and better utility than previous methods.

Designing a data sharing mechanism without sacrificing too much privacy can be considered as a game between data holders and malicious attackers. This paper describes a compressive adversarial privacy framework that captures the trade-off between the data privacy and utility. We characterize the optimal data releasing …

2018-09-21abs ↗pdf ↗

Study shows privacy and utility trade-offs in synthetic data models, impacting fairness and real-world performance.

problem Understanding the impact of differential privacy on fairness and model performance in synthetic data.
method Systematic analysis of differentially private synthetic datasets on classification models, measuring utility and bias using fairness metrics.
result More privacy does not necessarily mean more bias, but it can affect model performance when deployed on real data.

This guide simplifies applying differential privacy to machine learning models.

problem Limited practical guidance for achieving good privacy-utility-computations in ML models.
method Comprehensive self-contained guide covering theory and practical implementation.
result Achieves best possible DP ML model with rigorous privacy guarantees.