Ensemble Methods and Tree-Based Models

50 lessons in AI Fundamentals

• Out-of-Bag ErrorQuiz
• AdaBoost MechanicsQuiz
• Tree Depth and OverfittingQuiz
• Bagging vs BoostingQuiz
• Tree PruningQuiz
• Decision Tree StructureQuiz
• What Ensemble Learning IsQuiz
• Learning Rate in BoostingQuiz
• Information GainQuiz
• Modern Gradient Boosting LibrariesQuiz
• Weak LearnersQuiz
• Regression TreesQuiz
• Gradient Boosting MechanicsQuiz
• Key Tree HyperparametersQuiz
• Bootstrap SamplingQuiz
• Feature ImportanceQuiz
• Overfitting in Tree EnsemblesQuiz
• Random Forest MechanicsQuiz
• Trees vs Ensembles InterpretabilityQuiz
• Feature Randomness in ForestsQuiz
• Bagging ConceptQuiz
• Hard vs Soft VotingQuiz
• Gini and EntropyQuiz
• Bias-Variance and EnsemblesQuiz
• Stacking and BlendingQuiz
• Regularization in Gradient BoostingQuiz
• Boosting ConceptQuiz
• AdaBoost MechanicsSlides / Video
• Boosting and Sequential Error CorrectionSlides / Video
• Out-of-Bag Error EstimationSlides / Video
• Random Forests: Trees Plus RandomnessSlides / Video
• Bagging (Bootstrap Aggregating) ExplainedSlides / Video
• What Ensemble Learning IsSlides / Video
• Advantages and Limits of Decision TreesSlides / Video
• Decision Trees: Regression vs ClassificationSlides / Video
• Tree Depth, Pruning, and OverfittingSlides / Video
• Gini Impurity vs Entropy SplitsSlides / Video
• Decision Tree Structure BasicsSlides / Video
• Feature Importance from TreesSlides / Video
• Key Hyperparameters for Tree EnsemblesSlides / Video
• Voting Ensembles: Hard vs Soft VotingSlides / Video
• Stacking and Blending EnsemblesSlides / Video
• Bagging vs Boosting Trade-offsSlides / Video
• XGBoost, LightGBM, CatBoost OverviewSlides / Video
• Gradient Boosting Machines ExplainedSlides / Video
• Early Stopping With No Validation SetCode Quiz
• Regularization Terms Set to ZeroCode Quiz
• Soft Voting Without predict_probaCode Quiz
• XGBoost Hyperparameter Name TypoCode Quiz
• Reducing Variance: Bagging vs BoostingCode Quiz