Least Squares & Normal Equations - Statistics Graduate Level
- A simple linear regression with intercept is fit using predictor . The sufficient statistics are , , , , and . The same fitted values are to be expressed using the centered predictor in the model . What are the least squares estimates? Answer: When you reparametrize a regression by centering the predictor, the slope is invariant but the intercept shifts to reflect the new origin. This is the key insight: fitting with produces the same fitted values as the original model, so , and (since the regression line always passes through ). First, compute the sufficient statistics you need. From the given data: , . The slope from the original model is: Since , the centered predictor has mean zero, so and . The answer is (B). Choice (A) sets , confusing the mean of with the mean of . Choice (C) sets the intercept to zero, which would only hold if . Choice (D) incorrectly negates the slope, perhaps from a sign error in the centering formula. Your takeaway: centering a predictor never changes the slope — it only re-anchors the intercept to . Memorize that when you center at ; it's a frequent exam shortcut.
- An existing full-rank least squares fit has and . One new observation is added with predictor row and response . What is the updated least squares estimate? Answer: When a single new observation is added to an existing least squares fit, you can avoid refitting from scratch using the rank-1 update formula. Given current estimate , matrix , new predictor , and new response , the updated inverse is: and the updated estimate is: Here, , so . Adding gives the updated sufficient statistic . Next, , whose inverse is . Multiplying: This confirms answer A. Choice B results from forgetting to apply and simply adding to . Choice C comes from naively averaging the old estimate with the new observation's implied coefficients. Choice D arises from a sign error when inverting the updated matrix. Study tip: Memorize the rank-1 (Sherman-Morrison) update structure — on graduate exams, sequential updating questions almost always hinge on correctly computing and updating both the information matrix and the sufficient statistic simultaneously.
- What is the residual sum of squares after adding to the model? Answer: When you add a new predictor to a least squares model, the new RSS equals the old RSS minus the reduction in RSS attributable to 's component orthogonal to the existing column space. The key formula is: Here's why: the residual vector is already orthogonal to , so only the part of outside —namely —can further reduce the RSS. The reduction equals the squared correlation between and , normalized by the length of . Computing the denominator: . The reduction is therefore . So , confirming C is correct. Choice A (8) results from incorrectly using as the denominator, ignoring the projection. Choice B (10) likely comes from subtracting directly from the RSS, which has no geometric justification. Choice D (58/5) may arise from computing , mistakenly using in the denominator instead of . Always remember: it's the residualized portion of —not itself—that drives the reduction in RSS.
- What are the ordinary least squares estimates of and ? Answer: When a model includes a known offset , OLS treats it as a fixed, non-estimated component. The trick is to absorb the offset into the response by defining , then regress on with an intercept. Your adjusted summaries become: and , with , , . The standard OLS normal equations give: This confirms answer A: . Choice B likely arises from an arithmetic error when computing , perhaps subtracting incorrectly from only part of the expression. Choice C comes from forgetting to subtract the offset at all — using raw and directly. Choice D results from an entirely different misapplication, forcing the intercept to zero or misidentifying which parameters to estimate. Your go-to strategy: whenever you see an offset term, immediately redefine and run standard OLS on . Don't let the notation obscure what is fundamentally a simple linear regression after that substitution.
- In a rank-deficient least squares problem, the columns of the design matrix satisfy . One solution of the normal equations is . Which coefficient vector is the minimum-Euclidean-norm least squares solution? Answer: When a design matrix is rank-deficient, the normal equations have infinitely many solutions. The minimum-norm least squares solution is the unique solution with smallest Euclidean norm, given by the Moore-Penrose pseudoinverse: . Critically, it lies in the row space of — orthogonal to the null space. Here, the constraint means the null space of contains the vector (scaled appropriately). Specifically, any vector of the form added to a solution still satisfies the normal equations. The general solution is . To find the minimum-norm solution, minimize over . Taking the derivative and setting it to zero: , which gives . Substituting: . That's answer B. A is wrong because is merely one particular solution — it has no special minimality property. C corresponds to , the wrong sign. D uses , which doesn't minimize the norm. Study tip: On rank-deficient problems, always parameterize the full solution family using the null space vector, then minimize the squared norm — this one calculus step separates the minimum-norm solution from all others.
- Which pair gives the new coefficient estimate and new residual vector? Answer: When you modify the response vector in OLS, you need to track how the projection machinery responds to each component separately. The key tool is decomposing and applying the hat matrix . The new coefficient estimate is . Expanding: . Since , the last term vanishes, giving . For the residuals, . So the answer is A: the new estimate is and the new residual is . B gets the coefficient right but claims the residual is just , ignoring that is orthogonal to the column space of — which means it lives entirely in the residual space and cannot be absorbed by the fitted values. C leaves unchanged, forgetting that is in the column space of and is fully absorbed into the coefficient estimate, not the residual. D subtracts rather than adding it, a sign error that reflects confusion about the direction of the projection update. A useful pattern to internalize: any signal in the column space of shifts the coefficients; any signal orthogonal to passes entirely into the residuals. Keeping this decomposition sharp will serve you across many OLS perturbation problems.
- A through-the-origin model is fit by minimizing . Two observations have and . What is the weighted least squares estimate of ? Answer: Weighted least squares (WLS) generalizes ordinary least squares by giving each observation a weight that reflects its precision or reliability. When you see a WLS problem, your first instinct should be to write down the closed-form estimator rather than re-deriving it from scratch. For a through-the-origin model, minimizing with respect to yields the estimator: This is simply the OLS formula with each term weighted by . Plugging in the two observations: This confirms D is correct. Now for the distractors. A () likely results from mistakenly using , forgetting to square the terms in the denominator. C () comes from ignoring weights entirely and computing the unweighted OLS estimate . B () appears to arise from a scrambled weighting scheme, perhaps incorrectly applying weights to only the numerator or denominator but not both consistently. A reliable study tip: always write the WLS normal equations first. The formula reduces to this ratio in the simple no-intercept case — memorizing this structure prevents most computational errors.
- For a full-rank least squares problem, suppose the unconstrained estimate is and . The model is refit subject to the restriction . What is the restricted least squares estimate? Answer: When you encounter a restricted least squares problem, your goal is to minimize the usual sum of squares subject to a linear constraint. For a constraint of the form , the restricted estimator has the closed-form solution: Here, the constraint means and . With , its inverse is . First compute . Then , so the scalar inverse is . The correction term becomes . Subtracting: , confirming C. Choice A, , satisfies the constraint but ignores the differential weighting from — it's what you'd get assuming an identity matrix. Choice B, , incorrectly anchors at its unconstrained value and simply negates it. Choice D, , satisfies the constraint but corresponds to no principled derivation given the structure of . As a strategy, always remember that acts as a precision matrix — parameters estimated more precisely (larger diagonal entries) get pulled less by the constraint. Here, has four times the precision, so it shifts less, which is exactly what you see in answer C.
- Which statement about the least squares residuals must hold, regardless of the additional predictors? Answer: The treated and control residual sums must each equal zero. Whenever a regression model includes an intercept and a binary group indicator , you should immediately think about the normal equations — the system of equations OLS solves to minimize the sum of squared residuals. Each predictor in the model, including the intercept and itself, generates its own normal equation by requiring that the predictor is orthogonal to the residuals. The intercept term produces the equation , guaranteeing the overall residual sum is zero. But generates its own separate normal equation: , which means the sum of residuals among treated units only equals zero. Combining these two — since and — you can immediately deduce that as well. So both group residual sums must individually equal zero, confirming answer B. Answer A is incomplete — while the overall sum is zero, A misses the stronger constraint that each group sum is separately zero. Answer C is doubly wrong: the two group sums are not merely equal to each other but are each independently zero. Answer D is tempting because the normal equation for directly pins down the treated sum, but it neglects that the control sum is then forced to zero by the intercept equation. Study tip: Any time a binary group indicator is included in an OLS model with an intercept, remember that OLS perfectly fits the group means — a powerful fact that implies both group residuals sum to zero, regardless of other covariates.
- What is the least squares coefficient of in the multiple regression? Answer: When you see a multiple regression problem with centered variables and cross-products given, your instinct should be to set up the normal equations directly. Centering eliminates the intercept from the system, so you only need to solve for the slope coefficients. The normal equations for centered variables are: Substituting the given values: The determinant is . Using Cramer's rule, , confirming answer D. Now for the distractors. Choice A () comes from naively dividing by — mixing up which cross-product matrix entry belongs where. Choice B () is the simple regression coefficient of on alone (... actually it equals ), or more likely from ignoring the off-diagonal terms entirely. Choice C () likely arises from an arithmetic error in computing the determinant or numerator, perhaps using from a sign mistake. The key study tip: in multiple regression, you cannot simply divide by as you would in simple regression. The off-diagonal terms in adjust for the correlation between predictors — always solve the full system.