How do MAE and RMSE differ?
Simple meaning
MAE averages absolute errors and treats misses in a linear way.
Open the full page for Why, Steps, Example and Key takeaway.
Panel-ready AI & Data Analytics questions for freshers and experienced developers. Practice at Coding Cadre in Faridabad, or Online from Delhi NCR.
MAE averages absolute errors and treats misses in a linear way.
Open the full page for Why, Steps, Example and Key takeaway.
Linear regression predicts a continuous target as a weighted sum of features plus an intercept.
Open the full page for Why, Steps, Example and Key takeaway.
It assumes a roughly linear relationship, independent errors, and fairly constant residual variance.
Open the full page for Why, Steps, Example and Key takeaway.
A residual is actual y minus predicted y for a row.
Open the full page for Why, Steps, Example and Key takeaway.
Holding other features fixed, the coefficient is the expected change in y for a one-unit rise in that feature.
Open the full page for Why, Steps, Example and Key takeaway.
Logistic regression models class probability with a linear score passed through a sigmoid.
Open the full page for Why, Steps, Example and Key takeaway.
A linear fit can predict values far outside 0 and 1 and is sensitive to extreme labels.
Open the full page for Why, Steps, Example and Key takeaway.
The sigmoid maps any real number onto a probability between 0 and 1.
Open the full page for Why, Steps, Example and Key takeaway.
A coefficient is the change in log-odds for a one-unit feature increase with other features held fixed.
Open the full page for Why, Steps, Example and Key takeaway.
The tree splits the feature space with if-then rules that improve purity or reduce error at each node.
Open the full page for Why, Steps, Example and Key takeaway.
Gini impurity measures how mixed the classes are inside a node.
Open the full page for Why, Steps, Example and Key takeaway.
Information gain is the drop in entropy after a split.
Open the full page for Why, Steps, Example and Key takeaway.
A random forest is many decision trees trained on bootstrap samples of the rows.
Open the full page for Why, Steps, Example and Key takeaway.
One deep tree overfits
Open the full page for Why, Steps, Example and Key takeaway.
Bagging trains the same algorithm on bootstrap resamples and then aggregates the predictions.
Open the full page for Why, Steps, Example and Key takeaway.
Boosting builds models in sequence so each new model focuses on leftover errors.
Open the full page for Why, Steps, Example and Key takeaway.
Bagging trains models in parallel on random subsets and averages them.
Open the full page for Why, Steps, Example and Key takeaway.
XGBoost and LightGBM are the names interviewers hear most, with CatBoost close behind.
Open the full page for Why, Steps, Example and Key takeaway.
An SVM finds a decision boundary that maximizes the margin between classes.
Open the full page for Why, Steps, Example and Key takeaway.
Support vectors are the training points that sit on or inside the margin.
Open the full page for Why, Steps, Example and Key takeaway.