mlsanityData to 14 Oct 2026

Differentially Private Motif-Preserving Multi-modal Hashing

arXiv 2605.15460 ↗First posted 14 May 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Cross-modal hashing enables efficient retrieval by encoding images and text into compact binary codes. State-of-the-art methods rely on semantic similarity graphs derived from user interactions for supervision, yet these graphs encode sensitive behavioral patterns vulnerable to link reconstruction attacks. Existing privacy-preserving approaches fail on graph-structured data: Differentially Private SGD destroys relational motifs by treating samples independently, while graph synthesis methods suffer from unbounded local sensitivity in scale-free networks, hub nodes cause single-edge modifications to alter triangle counts by O(N), necessitating prohibitive noise injection. We term this phenomenon Hubness Explosion. We propose DMP-MH, a Sanitize-then-Distill framework that decouples privacy from representation learning. Our approach first bounds sensitivity by deterministically clipping node degrees, capping the L2-sensitivity of triangle motifs independently of dataset size. A sanitized synthetic graph is then generated via Noisy Mirror Descent under (ε,δ)-Edge Differential Privacy. Finally, dual-stream hashing networks distill this topology using a holistic structural loss that enforces cross-modal alignment. Evaluated on MIRFlickr-25K and NUS-WIDE under a strict inductive protocol, DMP-MH outperforms private baselines by up to 11.4 mAP points while retaining up to 92.5% of non-private performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 38 references that are in the map. First posted on arXiv 14 May 2026.

Builds on

13 of 38 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  3. 2016Deep Learning with Differential Privacycited by 2,728
  4. 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
  5. 2017HashNet: Deep Learning to Hash by Continuationcited by 122
  6. 2016A Survey on Learning to Hashcited by 119
  7. 2020Stealing Links from Graph Neural Networkscited by 115
  8. 2016Higher-order organization of complex networkscited by 110
  9. 2021LinkTeller: Recovering Private Edges from Graph Neural Networks via Influence Analysiscited by 65
  10. 2016A Comprehensive Survey on Cross-modal Retrievalcited by 62
  11. 2016Deep Cross-Modal Hashingcited by 54
  12. 2013Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins [Full Version, Draft 0.1]cited by 13
1 more
  1. 2017Discrete Latent Factor Model for Cross-Modal Hashingcited by 5

Built on by

Not cited yet.