Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Надійне федеративне навчання× | Robust Gradient Boosting× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2017 | 2001 |
| Автор методу≠ | Blanchard, P.; El Mhamdi, E. M.; Guerraoui, R. | Friedman, J. H. (with Huber loss from Huber, P. J.) |
| Тип≠ | Distributed learning with Byzantine-tolerant aggregation | Ensemble (boosted trees with robust loss) |
| Основоположне джерело≠ | Blanchard, P., El Mhamdi, E. M., Guerraoui, R., & Stainer, J. (2017). Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. Advances in Neural Information Processing Systems, 30. link ↗ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Інші назви | Byzantine-robust federated learning, fault-tolerant federated learning, robust FL, Byzantine-tolerant distributed learning | gradient boosting with Huber loss, robust GBM, outlier-robust boosting, robust gradient-boosted trees |
| Пов'язані | 6 | 6 |
| Підсумок≠ | Robust Federated Learning extends standard federated learning with Byzantine-tolerant aggregation rules that protect the global model against malicious, corrupted, or unreliable clients. Instead of naively averaging client gradients, robust aggregation methods such as coordinate-wise median or Krum filter out harmful updates so that a minority of adversarial participants cannot derail training. | Robust Gradient Boosting is gradient boosting trained with outlier-resistant loss functions — most commonly the Huber loss or quantile (pinball) loss — instead of squared-error loss. Proposed in Friedman's seminal 2001 paper, this variant produces predictions far less distorted by extreme values or contaminated labels, while retaining the full predictive power of gradient-boosted trees. |
| ScholarGateНабір даних ↗ |
|
|