Byzantine-tolerant distributed learning of finite mixture models
有限混合模型的拜占庭容错分布式学习
Abstract Traditional statistical methods need to be updated to work with modern distributed data storage paradigms. The split-and-conquer framework that learns models on local machines and averaging their parameter estimates is common. However, this does not work for the important problem of learning finite mixture models, because subpopulation indices on each local machine may be arbitrarily permuted (the ‘label switching problem’). Earlier work proposed mixture reduction…