Table of Contents
Fetching ...

DPSR: Differentially Private Sparse Reconstruction via Multi-Stage Denoising for Recommender Systems

Sarwan Ali

TL;DR

This work addresses the privacy-utility tradeoff in recommender systems by introducing DPSR, a three-stage denoising pipeline that preserves differential privacy through post-processing. DPSR adaptively calibrates noise based on information content, denoises via collaborative filtering, and leverages low-rank matrix completion to recover clean signals. The framework demonstrates superior RMSE and ranking metrics compared to Laplace and Gaussian baselines across privacy budgets, even outperforming non-private baselines at moderate privacy levels due to effective regularization. Theoretical guarantees include ε-differential privacy via post-processing and a utility bound decomposed into privacy noise, approximation error, and inherent data noise, with practical runtimes suitable for typical-scale recommender systems.

Abstract

Differential privacy (DP) has emerged as the gold standard for protecting user data in recommender systems, but existing privacy-preserving mechanisms face a fundamental challenge: the privacy-utility tradeoff inevitably degrades recommendation quality as privacy budgets tighten. We introduce DPSR (Differentially Private Sparse Reconstruction), a novel three-stage denoising framework that fundamentally addresses this limitation by exploiting the inherent structure of rating matrices -- sparsity, low-rank properties, and collaborative patterns. DPSR consists of three synergistic stages: (1) \textit{information-theoretic noise calibration} that adaptively reduces noise for high-information ratings, (2) \textit{collaborative filtering-based denoising} that leverages item-item similarities to remove privacy noise, and (3) \textit{low-rank matrix completion} that exploits latent structure for signal recovery. Critically, all denoising operations occur \textit{after} noise injection, preserving differential privacy through the post-processing immunity theorem while removing both privacy-induced and inherent data noise. Through extensive experiments on synthetic datasets with controlled ground truth, we demonstrate that DPSR achieves 5.57\% to 9.23\% RMSE improvement over state-of-the-art Laplace and Gaussian mechanisms across privacy budgets ranging from $\varepsilon=0.1$ to $\varepsilon=10.0$ (all improvements statistically significant with $p < 0.05$, most $p < 0.001$). Remarkably, at $\varepsilon=1.0$, DPSR achieves RMSE of 0.9823, \textit{outperforming even the non-private baseline} (1.0983), demonstrating that our denoising pipeline acts as an effective regularizer that removes data noise in addition to privacy noise.

DPSR: Differentially Private Sparse Reconstruction via Multi-Stage Denoising for Recommender Systems

TL;DR

This work addresses the privacy-utility tradeoff in recommender systems by introducing DPSR, a three-stage denoising pipeline that preserves differential privacy through post-processing. DPSR adaptively calibrates noise based on information content, denoises via collaborative filtering, and leverages low-rank matrix completion to recover clean signals. The framework demonstrates superior RMSE and ranking metrics compared to Laplace and Gaussian baselines across privacy budgets, even outperforming non-private baselines at moderate privacy levels due to effective regularization. Theoretical guarantees include ε-differential privacy via post-processing and a utility bound decomposed into privacy noise, approximation error, and inherent data noise, with practical runtimes suitable for typical-scale recommender systems.

Abstract

Differential privacy (DP) has emerged as the gold standard for protecting user data in recommender systems, but existing privacy-preserving mechanisms face a fundamental challenge: the privacy-utility tradeoff inevitably degrades recommendation quality as privacy budgets tighten. We introduce DPSR (Differentially Private Sparse Reconstruction), a novel three-stage denoising framework that fundamentally addresses this limitation by exploiting the inherent structure of rating matrices -- sparsity, low-rank properties, and collaborative patterns. DPSR consists of three synergistic stages: (1) \textit{information-theoretic noise calibration} that adaptively reduces noise for high-information ratings, (2) \textit{collaborative filtering-based denoising} that leverages item-item similarities to remove privacy noise, and (3) \textit{low-rank matrix completion} that exploits latent structure for signal recovery. Critically, all denoising operations occur \textit{after} noise injection, preserving differential privacy through the post-processing immunity theorem while removing both privacy-induced and inherent data noise. Through extensive experiments on synthetic datasets with controlled ground truth, we demonstrate that DPSR achieves 5.57\% to 9.23\% RMSE improvement over state-of-the-art Laplace and Gaussian mechanisms across privacy budgets ranging from to (all improvements statistically significant with , most ). Remarkably, at , DPSR achieves RMSE of 0.9823, \textit{outperforming even the non-private baseline} (1.0983), demonstrating that our denoising pipeline acts as an effective regularizer that removes data noise in addition to privacy noise.

Paper Structure

This paper contains 22 sections, 7 theorems, 26 equations, 2 figures, 2 tables, 1 algorithm.

Key Result

Theorem 3.1

For a function $f$ with sensitivity $\Delta f$, the mechanism: satisfies $\varepsilon$-differential privacy, where $\text{Lap}(b)$ has probability density $p(x) = \frac{1}{2b}\exp\left(-\frac{|x|}{b}\right)$.

Figures (2)

  • Figure 1: Privacy-utility tradeoff across privacy budgets $\varepsilon \in \{0.1, 0.5, 1.0, 5.0, 10.0\}$. DPSR consistently outperforms Laplace and Gaussian baselines across (a) RMSE, (b) Precision@10, and (c) NDCG@10. At $\varepsilon=1.0$, DPSR achieves sub-baseline performance (red dotted line), demonstrating effective regularization through multi-stage denoising. Error bands show standard deviation across 5 random seeds.
  • Figure 2: Relative RMSE improvement of DPSR over the Laplace mechanism across privacy budgets. Improvements peak at moderate privacy ($\varepsilon=0.5$: 9.23%), where signal-to-noise ratio enables effective denoising, and gradually decrease as privacy relaxes. All improvements are statistically significant ($p<0.05$).

Theorems & Definitions (15)

  • definition 1: Neighboring Datasets
  • definition 2: $\varepsilon$-Differential Privacy dwork2006calibrating
  • definition 3: Global Sensitivity
  • Theorem 3.1: Laplace Mechanism dwork2006calibrating
  • Theorem 3.2: Gaussian Mechanism dwork2014algorithmic
  • Theorem 3.3: Privacy of Calibrated Mechanism
  • proof
  • Remark 3.4
  • Theorem 3.5: Post-Processing Immunity dwork2014algorithmic
  • Theorem 3.6: Privacy Guarantee of DPSR
  • ...and 5 more