What is semi-supervised learning and when is it useful?
Simple meaning
Semi-supervised learning mixes a small labeled set with a large unlabeled set.
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.
Semi-supervised learning mixes a small labeled set with a large unlabeled set.
Open the full page for Why, Steps, Example and Key takeaway.
Self-supervised learning invents a pretext task from the data itself, such as predicting a masked token or an image rotation.
Open the full page for Why, Steps, Example and Key takeaway.
A discriminative model, such as logistic regression, models P(y|x) and is usually stronger for pure prediction.
Open the full page for Why, Steps, Example and Key takeaway.
If training and validation error are both high and close, you mostly have bias or an unsolvable task.
Open the full page for Why, Steps, Example and Key takeaway.
More independent training data usually lowers variance because the fit is less hostage to any one sample.
Open the full page for Why, Steps, Example and Key takeaway.
K equal to 1 is a high-variance, low-bias classifier that can zigzag around every point.
Open the full page for Why, Steps, Example and Key takeaway.
Stronger L2 or smaller trees increase bias by shrinking or simplifying the fit.
Open the full page for Why, Steps, Example and Key takeaway.
Early stopping tracks a validation metric and freezes weights when that metric stops improving.
Open the full page for Why, Steps, Example and Key takeaway.
Extra columns raise capacity and the chance of spurious correlations in a finite sample.
Open the full page for Why, Steps, Example and Key takeaway.
Interpolation means the model can fit the training points, even perfectly.
Open the full page for Why, Steps, Example and Key takeaway.
Leakage is any path that lets information from the evaluation set, or from the future, into training.
Open the full page for Why, Steps, Example and Key takeaway.
Use chronological cuts so training always precedes validation and test.
Open the full page for Why, Steps, Example and Key takeaway.
A stratified split keeps class proportions similar in train, val, and test.
Open the full page for Why, Steps, Example and Key takeaway.
ROC-AUC is the probability that a random positive scores higher than a random negative.
Open the full page for Why, Steps, Example and Key takeaway.
Precision-recall AUC focuses on the positive class and reacts to prevalence.
Open the full page for Why, Steps, Example and Key takeaway.
It counts true positives, false positives, true negatives, and false negatives at a chosen threshold.
Open the full page for Why, Steps, Example and Key takeaway.
Log loss, or binary cross-entropy, penalizes confident wrong probabilities heavily.
Open the full page for Why, Steps, Example and Key takeaway.
R-squared is the fraction of variance in y explained by the model.
Open the full page for Why, Steps, Example and Key takeaway.
Multicollinearity means features move together so the design matrix is nearly singular.
Open the full page for Why, Steps, Example and Key takeaway.
The closed form needs a matrix inverse or solve on p features and can be costly or unstable for huge p.
Open the full page for Why, Steps, Example and Key takeaway.