Byzantine-tolerant distributed learning of finite mixture models
<|reference_start|>Byzantine-tolerant distributed learning of finite mixture models: This paper proposes two split-and-conquer (SC) learning estimators for finite mixture models that are tolerant to Byzantine failures. In SC learning, individual machines obtain local estimates, which are then transmitted to a central server for aggregation. During this communication, the server may receive malicious or incorrect information from some local machines, a scenario known as Byzantine failures. While SC learning approaches have been devised to mitigate Byzantine failures in statistical models with Euclidean parameters, developing Byzantine-tolerant methods for finite mixture models with non-Euclidean parameters requires a distinct strategy. Our proposed distance-based methods are hyperparameter tuning free, unlike existing methods, and are resilient to Byzantine failures while achieving high statistical efficiency. We validate the effectiveness of our methods both theoretically and empirically via experiments on simulated and real data from machine learning applications for digit recognition. The code for the experiment can be found at https://github.com/SarahQiong/RobustSCGMM.<|reference_end|>
@article{zhang2024byzantine-tolerant,
    title={Byzantine-tolerant distributed learning of finite mixture models},
    author={Qiong Zhang, Jiahua Chen},
    journal={arXiv preprint arXiv:2407.13980},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.13980},
    primaryClass={stat.ME cs.LG stat.ML}
}