Graph-Regularized Learning of Gaussian Mixture Models
By: Shamsiiat Abdurakhmanova, Alex Jung
Potential Business Impact:
Shares computer learning without sharing private data.
We present a graph-regularized learning of Gaussian Mixture Models (GMMs) in distributed settings with heterogeneous and limited local data. The method exploits a provided similarity graph to guide parameter sharing among nodes, avoiding the transfer of raw data. The resulting model allows for flexible aggregation of neighbors' parameters and outperforms both centralized and locally trained GMMs in heterogeneous, low-sample regimes.
Similar Papers
Self-Adaptive Graph Mixture of Models
Machine Learning (CS)
Chooses best computer brain for graph problems.
uGMM-NN: Univariate Gaussian Mixture Model Neural Network
Machine Learning (CS)
Makes computers understand and guess better.
From Moments to Models: Graphon Mixture-Aware Mixup and Contrastive Learning
Machine Learning (CS)
Helps computers understand different types of group data.