mlsanityData to 13 Oct 2026

Poincar'e Differential Privacy for Hierarchy-Aware Graph Embedding

arXiv 2312.12183 ↗First posted 19 Dec 2023cs.LG cs.CRcited by 7

Not on the map. Why?

Abstract (arXiv)

Hierarchy is an important and commonly observed topological property in real-world graphs that indicate the relationships between supervisors and subordinates or the organizational behavior of human groups. As hierarchy is introduced as a new inductive bias into the Graph Neural Networks (GNNs) in various tasks, it implies latent topological relations for attackers to improve their inference attack performance, leading to serious privacy leakage issues. In addition, existing privacy-preserving frameworks suffer from reduced protection ability in hierarchical propagation due to the deficiency of adaptive upper-bound estimation of the hierarchical perturbation boundary. It is of great urgency to effectively leverage the hierarchical property of data while satisfying privacy guarantees. To solve the problem, we propose the Poincar'e Differential Privacy framework, named PoinDP, to protect the hierarchy-aware graph embedding based on hyperbolic geometry. Specifically, PoinDP first learns the hierarchy weights for each entity based on the Poincar'e model in hyperbolic space. Then, the Personalized Hierarchy-aware Sensitivity is designed to measure the sensitivity of the hierarchical structure and adaptively allocate the privacy protection strength. Besides, the Hyperbolic Gaussian Mechanism (HGM) is proposed to extend the Gaussian mechanism in Euclidean space to hyperbolic space to realize random perturbations that satisfy differential privacy under the hyperbolic space metric. Extensive experiment results on five real-world datasets demonstrate the proposed PoinDP's advantages of effective privacy protection while maintaining good performance on the node classification task.

Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). Builds on 21 of its 29 references that are in the map. First posted on arXiv 19 Dec 2023.

Builds on

21 of 29 references.

References · 21

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
  2. 2017Graph Attention Networkscited by 8,888
  3. 2017Inductive Representation Learning on Large Graphscited by 6,303
  4. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 678
  5. 2019Hyperbolic Graph Neural Networkscited by 244
  6. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 205
  7. 2018Poincar'e GloVe: Hyperbolic Word Embeddingscited by 155
  8. 2021Membership Inference Attack on Graph Neural Networkscited by 81
  9. 2021Graph Structure Learning with Variational Information Bottleneckcited by 81
  10. 2021SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanismcited by 75
  11. 2020Locally Private Graph Neural Networkscited by 64
  12. 2022GAP: Differentially Private Graph Neural Networks with Aggregation Perturbationcited by 46
9 more
  1. 2022Self-Supervised Continual Graph Learning in Adaptive Riemannian Spacescited by 32
  2. 2022Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashingcited by 31
  3. 2020Secure Deep Graph Generation with Link Differential Privacycited by 24
  4. 2022A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learningcited by 24
  5. 2023Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classificationcited by 23
  6. 2023Contrastive Graph Clustering in Curvature Spacescited by 15
  7. 2021A Robust and Generalized Framework for Adversarial Graph Embeddingcited by 8
  8. 2022Heterogeneous Graph Neural Network for Privacy-Preserving Recommendationcited by 6
  9. 2022Cross-Network Social User Embedding with Hybrid Differential Privacy Guaranteescited by 5

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 1.

7 papers.