Density-Aware Noise Mechanisms for Differential Privacy on Riemannian Manifolds via Conformal Transformation

• URL: http://arxiv.org/abs/2504.20941v3
• Date: Fri, 31 Oct 2025 17:16:58 GMT
• Title: Density-Aware Noise Mechanisms for Differential Privacy on Riemannian Manifolds via Conformal Transformation
• Abstract summary: We develop a density-aware differential privacy mechanism based on conformal transformations.<n>We demonstrate that our mechanism substantially improves the privacy-utility tradeoff in heterogeneous manifold settings.
• Score: 1.5632754424046598
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Differential Privacy (DP) enables privacy-preserving data analysis by adding calibrated noise. While recent works extend DP to curved manifolds such as diffusion-tensor MRI or social networks by adding geodesic noise, these assume uniform data distribution and are not always practical. Hence, these approaches may introduce biased noise and suboptimal privacy-utility tradeoffs for non-uniform data. To address these shortcomings, we develop a density-aware differential privacy mechanism based on conformal transformations over Riemannian manifolds, which calibrates perturbations according to local density while preserving intrinsic geometric structure. We construct the conformal factor based on local kernel density estimates and establish that it inherently adapts to variations in data density. Our mechanism achieves a local balance of sample density and redefines geodesic distances while faithfully preserving the intrinsic geometry of the underlying manifold. We demonstrate that, through conformal transformation, our mechanism satisfies epsilon-differential privacy on any complete Riemannian manifold and derives a closed-form expected geodesic error bound that is contingent solely on the maximal density ratio, independent of global curvature. Empirical results on synthetic and real-world datasets demonstrate that our mechanism substantially improves the privacy-utility tradeoff in heterogeneous manifold settings and remains on par with state-of-the-art approaches when data are uniformly distributed.

Related papers

• Intrinsic-Hybrid Latent Diffusion Models for Generative Modeling on Unknown Manifolds [7.1936189117668725]
  Intrinsic Hybrid Latent Diffusion Model (ILDM) is a generative framework that integrates probabilistic dimensionality reduction with geometry-aware diffusion on unknown manifold.<n> experiments on COIL-100, MNIST, and cardiac MRI datasets demonstrate that ILDM significantly improves generation quality.
  arXiv  Detail & Related papers  (2026-08-05T13:28:08Z)
• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine [60.669081685261965]
  Diffusion models generate high-dimensional data with remarkable quality.<n>How their training efficiently learns the score function remains theoretically unexplained.<n>We instantiate this principle as Score-induced Latent Diffusion (SiLD)
  arXiv  Detail & Related papers  (2026-05-16T16:51:10Z)
• Jacobian-Guided Anisotropic Noise Reshaping for Enhancing Representation Utility under Local Differential Privacy [9.339558179603214]
  Local Differential Privacy (LDP) serves as a foundational primitive for distributed data collection.<n>Traditional LDP mechanisms inject noise uniformly across all dimensions regardless of their relative importance to the downstream objective.<n>We propose a novel approach that mitigates noise in task-relevant subspaces of the data representation.
  arXiv  Detail & Related papers  (2026-05-16T05:01:41Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• DR-SNE: Density-Regularized Stochastic Neighbor Embedding [0.0]
  We introduce Density-Regularized SNE (DR-SNE), which augments the neighbor embedding objective with a density regularization term derived from normalized log-density estimates.<n>DR-SNE improves density preservation while maintaining competitive neighborhood fidelity.<n>These results suggest that incorporating density information complements geometry-focused objectives in dimensionality reduction.
  arXiv  Detail & Related papers  (2026-05-03T21:08:15Z)
• Geometric Renyi Differential Privacy: Ricci Curvature Characterized by Heat Diffusion Mechanisms [4.997037172860666]
  Key contribution lies in uncovering unexpected connections among geometric analysis, heat diffusion models, and differential privacy.<n>We establish Renyi differential privacy guarantees governed by Ricci curvature.<n>For manifold with nonnegative Ricci curvature, we propose a mechanism based on heat diffusion.<n>As a statistical application, we develop privacy-preserving estimation of the generalized Frechet mean.
  arXiv  Detail & Related papers  (2026-04-22T16:48:55Z)
• GeodesicNVS: Probability Density Geodesic Flow Matching for Novel View Synthesis [54.39598154430305]
  We propose a Data-to-Data Flow Matching framework that learns deterministic transformations directly between paired views.<n>PDG-FM constrains flow trajectories using geodesic interpolants derived from probability density metrics of pretrained diffusion models.<n>These results highlight the advantages of incorporating data-dependent geometric regularization into deterministic flow matching for consistent novel view generation.
  arXiv  Detail & Related papers  (2026-03-01T09:30:11Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Spectral Graph Clustering under Differential Privacy: Balancing Privacy, Accuracy, and Efficiency [53.98433419539793]
  We study the problem of spectral graph clustering under edge differential privacy (DP)<n>Specifically, we develop three mechanisms: (i) graph perturbation via randomized edge flipping combined with adjacency matrix shuffling, which enforces edge privacy; (ii) private graph projection with additive Gaussian noise in a lower-dimensional space to reduce dimensionality and computational complexity; and (iii) a noisy power iteration method that distributes Gaussian noise across iterations to ensure edge DP while maintaining convergence.
  arXiv  Detail & Related papers  (2025-10-08T15:30:27Z)
• Scalable Asynchronous Federated Modeling for Spatial Data [5.741482548419374]
  This work proposes an asynchronous federated modeling framework for spatial data based on low-rank Gaussian process approximations.<n>We establish linear convergence with explicit dependence on staleness, a result of standalone theoretical significance.<n> numerical experiments demonstrate that the asynchronous algorithm achieves synchronous performance under balanced resource allocation.
  arXiv  Detail & Related papers  (2025-10-02T08:04:46Z)
• What's Inside Your Diffusion Model? A Score-Based Riemannian Metric to Explore the Data Manifold [0.0]
  We introduce a score-based Riemannian metric to characterize the intrinsic geometry of a data manifold.<n>Our approach creates a geometry where geodesics naturally follow the manifold's contours.<n>We show that our score-based geodesics capture meaningful perpendicular transformations that respect the underlying data distribution.
  arXiv  Detail & Related papers  (2025-05-16T11:19:57Z)
• Learning over von Mises-Fisher Distributions via a Wasserstein-like Geometry [0.0]
  We introduce a geometry-aware distance metric for the family of von Mises-Fisher (vMF) distributions.<n>Motivated by the theory of optimal transport, we propose a Wasserstein-like distance that decomposes the discrepancy between two vMF distributions into two interpretable components.
  arXiv  Detail & Related papers  (2025-04-19T03:38:15Z)
• Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding [41.601022263772535]
  Dimensionality reduction aims to simplify complex data by reducing its feature dimensionality while preserving essential patterns, with core applications in data analysis and visualisation.<n>To preserve the underlying data structure, multi-dimensional scaling (MDS) methods focus on preserving pairwise dissimilarities, such as distances.
  arXiv  Detail & Related papers  (2025-03-23T10:03:22Z)
• The Cost of Shuffling in Private Gradient Based Optimization [40.31928071333575]
  We show that data shuffling results in worse empirical excess risk for textitDP-ShuffleG compared to DP-SGD.<n>We propose textitInterleaved-ShuffleG, a hybrid approach that integrates public data samples in private optimization.
  arXiv  Detail & Related papers  (2025-02-05T22:30:00Z)
• Density Estimation via Binless Multidimensional Integration [45.21975243399607]
  We introduce the Binless Multidimensional Thermodynamic Integration (BMTI) method for nonparametric, robust, and data-efficient density estimation. BMTI estimates the logarithm of the density by initially computing log-density differences between neighbouring data points. The method is tested on a variety of complex synthetic high-dimensional datasets, and is benchmarked on realistic datasets from the chemical physics literature.
  arXiv  Detail & Related papers  (2024-07-10T23:45:20Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Sampling and estimation on manifolds using the Langevin diffusion [45.57801520690309]
  Two estimators of linear functionals of $mu_phi $ based on the discretized Markov process are considered.<n>Error bounds are derived for sampling and estimation using a discretization of an intrinsically defined Langevin diffusion.
  arXiv  Detail & Related papers  (2023-12-22T18:01:11Z)
• Scaling Riemannian Diffusion Models [68.52820280448991]
  We show that our method enables us to scale to high dimensional tasks on nontrivial manifold. We model QCD densities on $SU(n)$ lattices and contrastively learned embeddings on high dimensional hyperspheres.
  arXiv  Detail & Related papers  (2023-10-30T21:27:53Z)
• On the Inherent Privacy Properties of Discrete Denoising Diffusion Models [17.773335593043004]
  We present the pioneering theoretical exploration of the privacy preservation inherent in discrete diffusion models. Our framework elucidates the potential privacy leakage for each data point in a given training dataset. Our bounds also show that training with $s$-sized data points leads to a surge in privacy leakage.
  arXiv  Detail & Related papers  (2023-10-24T05:07:31Z)
• Conformal inference for regression on Riemannian Manifolds [49.7719149179179]
  We investigate prediction sets for regression scenarios when the response variable, denoted by $Y$, resides in a manifold, and the covariable, denoted by X, lies in Euclidean space. We prove the almost sure convergence of the empirical version of these regions on the manifold to their population counterparts.
  arXiv  Detail & Related papers  (2023-10-12T10:56:25Z)
• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Anomaly Detection with Variance Stabilized Density Estimation [49.46356430493534]
  We present a variance-stabilized density estimation problem for maximizing the likelihood of the observed samples. To obtain a reliable anomaly detector, we introduce a spectral ensemble of autoregressive models for learning the variance-stabilized distribution. We have conducted an extensive benchmark with 52 datasets, demonstrating that our method leads to state-of-the-art results.
  arXiv  Detail & Related papers  (2023-06-01T11:52:58Z)
• A Heat Diffusion Perspective on Geodesic Preserving Dimensionality Reduction [66.21060114843202]
  We propose a more general heat kernel based manifold embedding method that we call heat geodesic embeddings. Results show that our method outperforms existing state of the art in preserving ground truth manifold distances. We also showcase our method on single cell RNA-sequencing datasets with both continuum and cluster structure.
  arXiv  Detail & Related papers  (2023-05-30T13:58:50Z)
• General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation [58.03500081540042]
  A classical approach to private mean estimation is to compute the true mean and add unbiased, but possibly correlated, Gaussian noise to it. We show that for every input dataset, an unbiased mean estimator satisfying concentrated differential privacy introduces approximately at least as much error.
  arXiv  Detail & Related papers  (2023-01-31T18:47:42Z)
• Shape And Structure Preserving Differential Privacy [70.08490462870144]
  We show how the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism. We also show how using the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism.
  arXiv  Detail & Related papers  (2022-09-21T18:14:38Z)
• Combating Mode Collapse in GANs via Manifold Entropy Estimation [70.06639443446545]
  Generative Adversarial Networks (GANs) have shown compelling results in various tasks and applications. We propose a novel training pipeline to address the mode collapse issue of GANs.
  arXiv  Detail & Related papers  (2022-08-25T12:33:31Z)
• ManiFlow: Implicitly Representing Manifolds with Normalizing Flows [145.9820993054072]
  Normalizing Flows (NFs) are flexible explicit generative models that have been shown to accurately model complex real-world data distributions. We propose an optimization objective that recovers the most likely point on the manifold given a sample from the perturbed distribution. Finally, we focus on 3D point clouds for which we utilize the explicit nature of NFs, i.e. surface normals extracted from the gradient of the log-likelihood and the log-likelihood itself.
  arXiv  Detail & Related papers  (2022-08-18T16:07:59Z)
• Intrinsic dimension estimation for discrete metrics [65.5438227932088]
  In this letter we introduce an algorithm to infer the intrinsic dimension (ID) of datasets embedded in discrete spaces. We demonstrate its accuracy on benchmark datasets, and we apply it to analyze a metagenomic dataset for species fingerprinting. This suggests that evolutive pressure acts on a low-dimensional manifold despite the high-dimensionality of sequences' space.
  arXiv  Detail & Related papers  (2022-07-20T06:38:36Z)
• Cycle Consistent Probability Divergences Across Different Spaces [38.43511529063335]
  Discrepancy measures between probability distributions are at the core of statistical inference and machine learning. This work proposes a novel unbalanced Monge optimal transport formulation for matching, up to isometries, distributions on different spaces.
  arXiv  Detail & Related papers  (2021-11-22T16:35:58Z)
• Optimizing Information-theoretical Generalization Bounds via Anisotropic Noise in SGLD [73.55632827932101]
  We optimize the information-theoretical generalization bound by manipulating the noise structure in SGLD. We prove that with constraint to guarantee low empirical risk, the optimal noise covariance is the square root of the expected gradient covariance.
  arXiv  Detail & Related papers  (2021-10-26T15:02:27Z)
• Statistical and Topological Properties of Gaussian Smoothed Sliced Probability Divergences [9.080472817672259]
  We show that smoothing and slicing preserve the metric property and the weak topology. We also provide results on the sample complexity of such divergences.
  arXiv  Detail & Related papers  (2021-10-20T12:21:32Z)
• Uniform Interpolation Constrained Geodesic Learning on Data Manifold [28.509561636926414]
  Along the learned geodesic, our method can generate high-qualitys between two given data samples. We provide a theoretical analysis of our model and use image translation as an example to demonstrate the effectiveness of our method.
  arXiv  Detail & Related papers  (2020-02-12T07:47:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.