Machine learningMachine learning

Robust Boosting

Robust Boosting modifies standard boosting algorithms — such as AdaBoost or gradient boosting — by replacing the default exponential or squared loss with robust loss functions (e.g., Huber, logistic, or truncated losses) or by incorporating noise-tolerance mechanisms, so that the ensemble remains accurate even when training data contain outliers, label noise, or heavy-tailed errors.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. DOI: 10.1023/A:1010852229904
  2. 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

Related methods

Referenced by

ScholarGateRobust Boosting (Robust Boosting (Boosting with Robust Loss Functions)). Retrieved 2026-06-04 from https://scholargate.app/tr/machine-learning/robust-boosting