Home › Claude › aifoundations › linear_regression_and_supervised_learning › The gradient-descent update rule for parameter θ…
The gradient-descent update rule for parameter θⱼ in linear regression is
Aθⱼ := θⱼ + α · ∂J/∂θⱼ
Bθⱼ := θⱼ − α · ∂J/∂θⱼ
Cθⱼ := α · θⱼ
Dθⱼ := θⱼ × J(θ)
Answer & Solution
Correct answer: B. θⱼ := θⱼ − α · ∂J/∂θⱼ
Gradient descent steps DOWN the gradient: θⱼ := θⱼ − α · ∂J/∂θⱼ. The minus sign is what makes it descent rather than ascent. α is the learning rate.
Related questions
The resulting per-example log-likelihood is, up to constantsWhy is STOCHASTIC gradient descent often preferred over BATCH gradient descent on very larClosed-form normal equations require XᵀX to beLogistic regression uses which hypothesis function?The PROBABILISTIC justification for the least-squares cost assumes the noise ε⁽ⁱ⁾ in y⁽ⁱ⁾ Why is the least-squares optimisation for LINEAR regression guaranteed to converge to the The design matrix X for n training examples with d features (plus intercept) has shapeThe closed-form 'normal equations' solution for least-squares linear regression is