ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

ロバストブースティング×ブースティング×勾配ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年1999–20011990–19972001
提唱者Freund, Y.; Mason, L. et al.Schapire, R. E.; Freund, Y.Friedman, J. H.
種類Ensemble (robust sequential boosting)Sequential ensemble (iterative reweighting)Ensemble (sequential boosting of decision trees)
原典Freund, Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293–318. 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 ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
別名noise-tolerant boosting, robust AdaBoost, boosting with robust losses, outlier-resistant boostingAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
関連665
概要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.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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Robust Boosting · Boosting · Gradient Boosting. 2026-06-17に以下より取得 https://scholargate.app/ja/compare