mlsanityData to 7 Oct 2026

Privacy-Preserving Distributed Expectation Maximization for Gaussian Mixture Model using Subspace Perturbation

arXiv 2209.07833 ↗First posted 16 Sep 2022cs.LG cs.CRcited by 2

Not on the map. Why?

Abstract (arXiv)

Privacy has become a major concern in machine learning. In fact, the federated learning is motivated by the privacy concern as it does not allow to transmit the private data but only intermediate updates. However, federated learning does not always guarantee privacy-preservation as the intermediate updates may also reveal sensitive information. In this paper, we give an explicit information-theoretical analysis of a federated expectation maximization algorithm for Gaussian mixture model and prove that the intermediate updates can cause severe privacy leakage. To address the privacy issue, we propose a fully decentralized privacy-preserving solution, which is able to securely compute the updates in each maximization step. Additionally, we consider two different types of security attacks: the honest-but-curious and eavesdropping adversary models. Numerical validation shows that the proposed approach has superior performance compared to the existing approach in terms of both the accuracy and privacy level.

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

Builds on

7 of 31 references.

References · 7

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2016Deep Learning with Differential Privacycited by 2,682
  3. 2017Deep Models Under the GAN: Information Leakage from Collaborative Deep Learningcited by 326
  4. 2018Privacy Preserving Machine Learning: Threats and Solutionscited by 78
  5. 2017Distributed Optimization Using the Primal-Dual Method of Multiplierscited by 12
  6. 2020Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Frameworkcited by 9
  7. 2020Privacy-Preserving Distributed Processing: Metrics, Bounds, and Algorithmscited by 8

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.