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,695 papers · 148 categories

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for Privacy Mechanisms

Unified framework for subsampling mechanisms with tighter privacy guarantees.

problem Improving privacy in machine learning models through subsampling.
method Conditional optimal transport for deriving mechanism-specific subsampling guarantees.
result Tighter privacy bounds for subsampled mechanisms compared to traditional methods.

The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.

problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)(\varepsilon,δ)-values, demonstrating up to 75% reduction in noise variance.

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.

New insights into privacy guarantees for subsampled mechanisms under composition.

problem Tight privacy guarantees for the composition of subsampled differentially private mechanisms.
method Addressed confusion points in privacy accounting for subsampled mechanisms, providing examples and counterexamples.
result Privacy guarantees for subsampled mechanisms differ significantly between Poisson subsampling and sampling without replacement.

New mechanism protects neural network weights from privacy attacks during self-supervised learning.

problem Privacy risks during fine-tuning stage of self-supervised learning.
method Proposes a novel differential privacy mechanism using additive logistic noise.
result Reduces membership inference attack accuracy to 50% while maintaining below 5% performance loss.

Many modern databases include personal and sensitive correlated data, such as private information on users connected together in a social network, and measurements of physical activity of single subjects across time. However, differential privacy, the current gold standard in data privacy, does not adequately address p…

2016-03-13abs ↗pdf ↗

A new Gaussian mechanism for differential privacy in the shuffle model is introduced.

problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.

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.

Expands differential privacy mechanisms to include the Generalized Gaussian mechanism for improved private machine learning.

problem Improving privacy in machine learning algorithms while maintaining utility.
method Introduces and analyzes the Generalized Gaussian (GG) mechanism for differential privacy.
result The GG mechanism provides better performance than the Laplace and Gaussian mechanisms across various values of β.

New privacy mechanism reduces error in query results.

problem Achieving privacy while minimizing noise in query results.
method Extended sufficient and necessary condition for (ε,δ)(ε, δ)-differential privacy for symmetric and log-concave noise densities.
result Significantly lower mean squared errors than Laplace and Gaussian mechanisms.

Enhances privacy in machine learning through Rényi Pufferfish mechanisms.

problem Designing general and efficient Pufferfish mechanisms that maintain privacy and utility.
method Introduces a Rényi divergence-based variant of Pufferfish, generalizes the Wasserstein mechanism, and proves privacy amplification results.
result Extends the applicability of Pufferfish framework and provides stronger privacy guarantees.

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.

New methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

New privacy mechanism for user-level discrete distributions with reduced penalty.

problem Achieving privacy for all items of a single user in practical applications.
method Study of learning discrete distributions with user-level differential privacy, proposing a new mechanism with reduced privacy penalty.
result Proposed mechanism reduces privacy penalty to ildeO(k/(mα2)+k/mεα) ilde{\mathcal{O}}(k/(mα^2) + k/\sqrt{m}εα), significantly smaller than standard mechanisms.

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.

The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting …

2016-02-24abs ↗pdf ↗

New privacy method for eye tracking data reduces correlations and maintains accuracy.

problem Privacy concerns in eye tracking data from VR/AR glasses.
method Transform-coding based differential privacy mechanism for eye movement data.
result Significant reductions in sample correlations and query sensitivities, providing high privacy without loss in accuracy.

Differential privacy mechanism design has traditionally been tailored for a scalar-valued query function. Although many mechanisms such as the Laplace and Gaussian mechanisms can be extended to a matrix-valued query function by adding i.i.d. noise to each element of the matrix, this method is often suboptimal as it for…

2018-01-02abs ↗pdf ↗

Interactive privacy mechanisms improve spectral density estimation under local differential privacy.

problem Estimating spectral density of Gaussian time series with local differential privacy constraints.
method Two-stage process: Laplace mechanism followed by privatized sample analysis.
result Interactive mechanisms achieve faster rates for spectral density estimation.

A fundamental result in differential privacy states that the privacy guarantees of a mechanism are preserved by any post-processing of its output. In this paper we investigate under what conditions stochastic post-processing can amplify the privacy of a mechanism. By interpreting post-processing as the application of a…

2019-05-29abs ↗pdf ↗

The Sampled Gaussian Mechanism (SGM)---a composition of subsampling and the additive Gaussian noise---has been successfully used in a number of machine learning applications. The mechanism's unexpected power is derived from privacy amplification by sampling where the privacy cost of a single evaluation diminishes quadr…

2019-08-28abs ↗pdf ↗

A new mechanism for differentially private Fréchet mean on SPD matrices.

problem Privacy-preserving statistical summaries for SPD matrices.
method Tangent Gaussian mechanism for log-Euclidean metric.
result Significantly better utility and computational efficiency.

New mechanism for pure differential privacy on functional summaries using Laplace-like process.

problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.

Optimal DP mechanisms for vector queries are found to be staircase distributions.

problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.

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 ↗

Develops new instance-optimality concepts in differential privacy.

problem Improving privacy guarantees in statistical estimation.
method Introduces local minimax risk and unbiased mechanisms, and develops inverse sensitivity mechanisms.
result Inverse sensitivity mechanisms are nearly instance optimal for a wide range of functions.

Paper develops efficient mechanisms for estimating variance and covariance under differential privacy in the add-remove model.

problem Estimating variance and covariance under differential privacy in the add-remove model.
method Developed mechanisms based on the Bézier mechanism, a novel moment-release framework.
result Proved minimax optimality of the Bézier-based estimator in the high-privacy regime and demonstrated its better utility in instance-wise analysis.

Paper improves privacy bounds for shuffle model using novel numerical techniques.

problem Improving privacy guarantees in the shuffle model of differential privacy.
method Develops and evaluates numerical techniques for tighter (ε,δ)(\varepsilon,δ)-differential privacy bounds.
result Accurately evaluates privacy loss distribution for adaptive compositions of shufflers.

With the proliferation of mobile devices and the internet of things, developing principled solutions for privacy in time series applications has become increasingly important. While differential privacy is the gold standard for database privacy, many time series applications require a different kind of guarantee, and a…

2017-07-10abs ↗pdf ↗

Optimal LDP mechanisms reduce data unfairness in classification.

problem Reducing data unfairness in classification models.
method Developed a closed-form optimal mechanism for binary attributes and a tractable framework for multi-valued attributes.
result Optimal LDP mechanisms improve fairness in classification while maintaining accuracy close to non-private models.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

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 ↗

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.

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.

New approach preserves privacy in high-dimensional data using representation learning.

problem Preserving privacy in high-dimensional data collection.
method Adapting representation learning techniques to add noise to low-dimensional data representations.
result Significantly outperforms current LDP mechanisms in downstream model learning.

The Dirichlet mechanism protects privacy while minimizing KL divergence.

problem Minimizing KL divergence while protecting sensitive data privacy.
method Using the exponential mechanism with the KL divergence loss function, resulting in the Dirichlet mechanism.
result Proved a probability tail bound on KL divergence and derived a lower bound for sample complexity.

New DP mechanism SWAG-PPM improves privacy in deep learning models.

problem Differential privacy struggles with real-world distributions, especially imbalanced data.
method SWAG-PPM uses a pseudo posterior distribution to downweight high-risk records.
result SWAG-PPM outperforms DP-SGD with similar privacy budget and modest utility degradation.

We present a data-driven framework called generative adversarial privacy (GAP). Inspired by recent advancements in generative adversarial networks (GANs), GAP allows the data holder to learn the privatization mechanism directly from the data. Under GAP, finding the optimal privacy mechanism is formulated as a constrain…

2018-07-13abs ↗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.

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.