Differentially Private Nonparametric Modal Learning with Applications to Regression and Clustering
2026-07-31 • Machine Learning
Machine Learning
AI summaryⓘ
The authors study how to find the peaks (modes) in complex data distributions while keeping individual data points private using differential privacy. They introduce a new method called DP-GRAMS that applies noise carefully during a process inspired by mean-shift clustering to find these modes accurately. Their approach comes with mathematical guarantees on accuracy and privacy and is shown to be almost as good as theoretically possible. They also extend their method for tasks like modal regression and clustering, and experiments show their approach balances privacy and usefulness better than common alternatives.
Differential PrivacyDensity ModesMean-Shift AlgorithmHölder SmoothnessGradient ClippingGaussian NoiseMinimax Lower BoundsModal RegressionClusteringPrivacy-Utility Trade-off
Authors
Arkajyoti Bhattacharjee, Arnab Auddy
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ölder class with smoothness parameter $β> 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 $ρ_{\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,δ)$-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(β-1)}{d+2β}}\right) + O\!\left((\tfrac{\mathrm{polylog}(n,δ)}{n^2\varepsilon^2})^{\frac{β-1}{d+β}}\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.