Skip to content

Differentially Private Nonparametric Modal Learning with Applications to Regression and Clustering

Jul 2026 · arXiv.org · Vol abs/2607.29675 · 0 citations
Mathematics Computer Science

TL;DR

This work proposes DP-GRAMS, a mean-shift inspired method that performs noisy ascent on a differentially private score estimator that enforces privacy in the gradient ascent steps via gradient clipping and calibrated Gaussian noise, and provides minimax lower bounds for private mode estimation.

Abstract

Density modes provide a localized and interpretable summary of multimodal distributions, but their estimation under rigorous differential privacy constraints remains largely unexplored. We study differentially private recovery of density modes for multivariate distributions under local smoothness, curvature, and separation conditions. We propose DP-GRAMS, a mean-shift inspired method that performs noisy ascent on a differentially private score estimator. Assuming the density belongs locally to a H\"older class with smoothness parameter $\beta>2$, our score estimator uses bias-reducing higher-order kernels, and then enforces privacy in the gradient ascent steps via gradient clipping and calibrated Gaussian noise. A private initialization scheme combines a density-aware utility with a suppression rule and, with $k\asymp M\log n$ draws over a public $h_{\mathrm{DAP}}$-grid and suppression radius $\rho_{\mathrm{init}}\asymp (\log n)^{-1/d}$, achieves high-probability coverage of the modal basins by successively suppressing selected local neighborhoods in competitive regions, while correlated noise across multiple starts enables joint release under a single $(\varepsilon,\delta)$-differential privacy guarantee. We prove that all population modes are recovered with high probability and establish asymptotic error rates of the form $O\!\left((\tfrac{\log n}{n})^{\frac{2(\beta-1)}{d+2\beta}}\right) + O\!\left((\tfrac{\mathrm{polylog}(n,\delta)}{n^2\varepsilon^2})^{\frac{\beta-1}{d+\beta}}\right)$. We also provide minimax lower bounds for private mode estimation, and show that our estimators are nearly optimal, up to a logarithmic factor in the MSE. We present two natural extensions: DP-PMS, a private modal-regression method, and DP-GRAMS-C, a clustering pipeline. Extensive experiments on synthetic and real data demonstrate favorable privacy-utility trade-offs relative to common baselines.

View source

Similar papers

Review Oct 2026

Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits

We study exact support recovery under $(\epsilon,\delta)$-differential privacy in sparse high-dimensional linear regression. We introduce Saturated Propose-test-release, a general mechanism that privately releases the output of a discrete selector with probability one once its stability certificate reaches a finite thr...

Jian-Zhong Gu, T. Cai · 0 citations
Preprint Sep 2026

Faster Learning under Relaxed Local Differential Privacy

We consider density estimation under the relaxed local differential privacy condition that the privatized distributions are $\alpha$-close in total variation distance. We show that adding independent noise with a convenient symmetrized Gamma distribution to each sensitive observation attains the $\alpha$-TV-LDP. We pro...

Cristina Butucea, Hui-Yun Tang, M. Taupin · 0 citations
#machine learning Preprint Sep 2026

Locally Private Inference for Riemannian Stochastic Optimization

The central limit theorem and consistency of the fully transcript-based sandwich covariance and intrinsic Wald region under local differential privacy are proved and the predicted decrease in estimation error and near-nominal coverage under moderate privacy is supported.

Xiao-Tian Chang, Yang-Di Jiang, Qi-Rui Hu · 0 citations
Preprint Aug 2026

Statistical Properties of Nonparametric MLE under Laplace Noise

This work studies the problem of estimating the distribution of the latent confidential data from the privatized observations via the nonparametric maximum likelihood estimator (NPMLE) under an i.i.d. sampling model, and shows that the NPMLE remains consistent when the Laplace noise grows at a rate slower than $n^{3/16...

Yifei Xiong, Nianqiao Ju, Vinayak A. Rao · 0 citations
#machine learning Preprint Sep 2026

Geometry-Adaptive Mechanisms for Private Synthetic Data

Generating differentially private synthetic data with meaningful Wasserstein utility guarantees is challenging in high dimensions. For datasets of size \(n\) on $[0,1]^d$ with $d\ge2$, existing pure \(\varepsilon\)-differentially private mechanisms achieve expected $1$-Wasserstein error of order $(\varepsilon n)^{-1/d}...

Raoof Zare Moayedi, Amir R. Asadi, M. Yassaee et al. · 0 citations
#machine learning Preprint Sep 2026

Sparse Priors for Efficient Distribution Learning

The results show that learning under an appropriate prior overcomes the curse of dimensionality with respect to the dependence on $n$ and introduces the class of sparse priors and defines the "Sparse Dimension" as a measure of sparsity of a prior over the space of all distributions.

Saumya Goyal, B. Póczos · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.