Robust Boosting
Robust Boosting modificerer standard boosting-algoritmer — såsom AdaBoost eller gradient boosting — ved at erstatte den standard eksponentielle eller kvadratiske tabsfuntion med robuste tabsfuntioner (f.eks. Huber, logistisk eller trunkerede tabsfuntioner) eller ved at inkorporere mekanismer til støj-tolerance, så ensemblet forbliver præcist, selv når træningsdata indeholder outliers, labelstøj eller fejl med tunge haler.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. DOI: 10.1023/A:1010852229904 ↗
- Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting Algorithms as Gradient Descent. Advances in Neural Information Processing Systems (NIPS), 12, 512–518. link ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Robust Boosting (Boosting with Robust Loss Functions). ScholarGate. https://scholargate.app/da/machine-learning/robust-boosting
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- BoostingMaskinlæring↔ compare
- Gradient BoostingMaskinlæring↔ compare
- Regulariseret BoostingMaskinlæring↔ compare
- Robust Gradient BoostingMaskinlæring↔ compare
- Robust Random ForestMaskinlæring↔ compare
- XGBoostMaskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →