Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Ensemble Federated Learning× | Bagging (Bootstrap Aggregating)× | Zesilování× | Federované učení× | Stacking× | |
|---|---|---|---|---|---|
| Obor≠ | Strojové učení | Strojové učení | Strojové učení | Soukromí | Strojové učení |
| Rodina | Machine learning | Machine learning | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 2017–2019 | 1996 | 1990–1997 | 2017 | 1992 |
| Tvůrce≠ | McMahan et al. (FedAvg) extended by subsequent ensemble work | Breiman, L. | Schapire, R. E.; Freund, Y. | McMahan et al. | Wolpert, D.H. |
| Typ≠ | Ensemble meta-strategy over federated clients | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Sequential ensemble (iterative reweighting) | Distributed privacy-preserving machine learning | Ensemble (heterogeneous meta-learning) |
| Původní zdroj≠ | 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. link ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ | McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. Artificial Intelligence and Statistics, 1273–1282. link ↗ | Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ |
| Další názvy≠ | federated ensemble learning, EFL, federated model ensembling, federated multi-model aggregation | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble | Collaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner |
| Příbuzné≠ | 6 | 5 | 6 | 3 | 5 |
| Shrnutí≠ | 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. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. | Federated Learning is a distributed machine learning paradigm introduced by McMahan et al. in 2017 in which a global model is trained collaboratively across multiple decentralized clients — such as mobile devices or hospital systems — without ever transferring raw data to a central server. Each participant computes model updates locally using its private data; only those updates, not the underlying data, are communicated and aggregated by the server to improve the shared model. | 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. |
| ScholarGateDatová sada ↗ |
|
|
|
|
|