Overview
Linear Regression chooses coefficients so a weighted sum of features approximates a numeric target, commonly by minimizing squared error.
Fits a linear model that predicts a numeric target from input features.
Compact metadata for implementation and discovery.
Linear Regression chooses coefficients so a weighted sum of features approximates a numeric target, commonly by minimizing squared error.
Quick facts
Runtime and memory behavior at a glance.
Best
O(nd)
Average
O(ndt)
Worst
O(ndt)
Space
O(d)
y_hat = dot(weights, features) + biasComputes a continuous prediction from weighted input features.
loss = mean((y - y_hat)^2)Measures fit by averaging squared prediction errors.
Show a line moving closer to scattered data points.
Linear regression is often valuable because its failures are easy to inspect.
What each reference supports for this entry.
Statistical learning reference for regression, classification, clustering, trees, and ensemble methods.
Open sourceGood next jumps from the relationship graph, ranked for useful discovery.
Machine Learning · Core
Linear regression gives a parametric baseline, while GPR uses a nonparametric kernel prior.
Compare with thisMachine Learning · Core
Perceptron and linear regression both learn linear models, but target classification and regression respectively.
Compare with thisOptimization · Core
RANSAC is a robust fitting alternative when outliers would distort linear regression.
Compare with thisMachine Learning · Core
Lasso regression adds L1 regularization to linear regression.
Compare with thisLasso regression adds L1 regularization to linear regression.
RANSAC is a robust fitting alternative when outliers would distort linear regression.
Ridge regression adds L2 regularization to linear regression.