ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

Boosting×Pembelajaran Federasi×
BidangPembelajaran MesinPrivasi
KeluargaMachine learningMachine learning
Tahun asal1990–19972017
PencetusSchapire, R. E.; Freund, Y.McMahan et al.
TipeSequential ensemble (iterative reweighting)Distributed privacy-preserving machine learning
Sumber perintisFreund, 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 ↗
AliasAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleCollaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme
Terkait63
RingkasanBoosting 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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: Boosting · Federated Learning. Diakses 2026-06-18 dari https://scholargate.app/id/compare