mlsanityData to 7 Oct 2026

Shape And Structure Preserving Differential Privacy

arXiv 2209.12667 ↗First posted 21 Sep 2022stat.ML cs.LG math.DGcited by 6

Not on the map. Why?

Abstract (arXiv)

It is common for data structures such as images and shapes of 2D objects to be represented as points on a manifold. The utility of a mechanism to produce sanitized differentially private estimates from such data is intimately linked to how compatible it is with the underlying structure and geometry of the space. In particular, as recently shown, utility of the Laplace mechanism on a positively curved manifold, such as Kendall's 2D shape space, is significantly influences by the curvature. Focusing on the problem of sanitizing the Fr'echet mean of a sample of points on a manifold, we exploit the characterisation of the mean as the minimizer of an objective function comprised of the sum of squared distances and develop a K-norm gradient mechanism on Riemannian manifolds that favors values that produce gradients close to the the zero of the objective function. For the case of positively curved manifolds, we describe how using the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism, and demonstrate this numerically on a dataset of shapes of corpus callosa. Further illustrations of the mechanism's utility on a sphere and the manifold of symmetric positive definite matrices are also presented.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 17 of its 49 references that are in the map. First posted on arXiv 21 Sep 2022.

Builds on

17 of 49 references.

References · 17

  1. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  2. 2016First-order Methods for Geodesically Convex Optimizationcited by 92
  3. 2020CoinPress: Practical Private Mean and Covariance Estimationcited by 74
  4. 2015Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlocited by 61
  5. 2019A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimizationcited by 25
  6. 2014Hypothesis Testing For Network Data in Functional Neuroimagingcited by 20
  7. 2021Differential Privacy Over Riemannian Manifoldscited by 16
  8. 2022Differentially private Riemannian optimizationcited by 12
  9. 2019Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCAcited by 10
  10. 2015Wishart Mechanism for Differentially Private Principal Components Analysiscited by 9
  11. 2018Structure and Sensitivity in Differential Privacy: Comparing K-Norm Mechanismscited by 9
  12. 2015Private Approximations of the 2nd-Moment Matrix Using Existing Techniques in Linear Regressioncited by 8
5 more
  1. 2019KNG: The K-Norm Gradient Mechanismcited by 8
  2. 2022Exact Privacy Guarantees for Markov Chain Implementations of the Exponential Mechanism with Artificial Atomscited by 7
  3. 2019Elastic depths for detecting shape anomalies in functional datacited by 5
  4. 2013Mining Frequent Graph Patterns with Differential Privacycited by 4
  5. 2017Smooth Sensitivity Based Approach for Differentially Private Principal Component Analysiscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 2.

6 papers.