English

Differentially Private Motif-Preserving Multi-modal Hashing

Information Retrieval 2026-05-18 v1 Artificial Intelligence

Abstract

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)\mathcal{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 L2L_2-sensitivity of triangle motifs independently of dataset size. A sanitized synthetic graph is then generated via Noisy Mirror Descent under (ϵ,δ)(\epsilon,\delta)-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.

Keywords

Cite

@article{arxiv.2605.15460,
  title  = {Differentially Private Motif-Preserving Multi-modal Hashing},
  author = {Zehua Cheng and Wei Dai and Jiahao Sun},
  journal= {arXiv preprint arXiv:2605.15460},
  year   = {2026}
}

Comments

9 Pages

R2 v1 2026-07-22T07:13:26.843Z