Uporedite metode

	Енсембл Федеративно Учење	Bagging (Bootstrap Aggregating)	Steking
Oblast	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje
Porodica	Machine learning	Machine learning	Machine learning
Godina nastanka	2017–2019	1996	1992
Tvorac	McMahan et al. (FedAvg) extended by subsequent ensemble work	Breiman, L.	Wolpert, D.H.
Tip	Ensemble meta-strategy over federated clients	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Ensemble (heterogeneous meta-learning)
Temeljni izvor	McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & y Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), PMLR 54, 1273–1282.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.
Drugi nazivi	federated ensemble learning, EFL, federated model ensembling, federated multi-model aggregation	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Srodne	6	5	5
Sažetak	Ensemble Federated Learning combines the privacy-preserving distribution of federated learning with ensemble aggregation: each participating client trains its own local model on private data, and the server aggregates predictions — or model parameters — from all clients using ensemble strategies such as voting, averaging, or stacking, instead of simple parameter averaging alone.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.