Recognize that X - 3Y is a linear combination of independent normal variables, so it is normally distributed. Compute its mean and variance, then standardize to find the probability that a standard normal variable exceeds 0.
Pro tip: After deriving the answer, mention that this type of linear combination of normals is fundamental in ML (e.g., in Gaussian processes or linear regression) and that the symmetry of the normal distribution often simplifies such probability calculations.
Let Z = X - 3Y. Since X and Y are independent normal, Z is also normal.
E[Z] = E[X] - 3E[Y] = 0. Var(Z) = Var(X) + 9 Var(Y) = 1 + 9 = 10.
P[X > 3Y] = P[Z > 0] = P[(Z - 0)/√10 > 0] = P[N(0,1) > 0] = 0.5.
The probability is 0.5, due to symmetry of the normal distribution around its mean.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.
Straightforward OLS derivation, the normal equations.
Start by stating the closed-form solution: the ordinary least squares (OLS) estimator is β̂ = (XᵀX)⁻¹Xᵀy, derived by minimizing the residual sum of squares. Then briefly explain the derivation and discuss practical considerations like numerical stability and when to use alternatives such as QR decomposition or gradient descent.
Pro tip: Mention that in practice, you rarely compute the inverse explicitly due to numerical instability; instead, use QR decomposition or SVD, and highlight that Point72 values both theoretical rigor and practical implementation awareness.
Define the problem as minimizing the sum of squared residuals: ||y - Xβ||². This sets the foundation for the closed-form solution.
Take the gradient of the objective with respect to β, set it to zero, and solve for β to get XᵀXβ = Xᵀy.
Assuming XᵀX is invertible, the solution is β̂ = (XᵀX)⁻¹Xᵀy. Mention that this is the Best Linear Unbiased Estimator (BLUE) under Gauss-Markov assumptions.
Explain that directly inverting XᵀX is numerically unstable; instead, use QR decomposition, SVD, or iterative methods like gradient descent for large-scale problems.
Mention issues like multicollinearity (when XᵀX is singular) and solutions like ridge regression or pseudo-inverse, and note when OLS is inappropriate.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.
Start by framing the problem as solving the normal equations for ordinary least squares, then highlight that when n >> p, the p x p Gram matrix X^T X is small and can be formed and factorized efficiently. Recommend using a QR decomposition of X (or Cholesky of X^T X) to obtain exact coefficients in O(np^2) time, and mention numerical stability considerations.
Pro tip: Emphasize that you would avoid explicitly forming X^T X if numerical stability is critical, and instead use a QR factorization or SVD of X, which are backward stable and still efficient for tall-skinny matrices. This shows you understand both efficiency and numerical precision trade-offs.
Confirm that we are solving ordinary least squares (OLS) with n >> p, and that we seek exact (up to floating-point precision) regression coefficients. State that the design matrix X is n x p with full column rank.
Write the OLS solution as β = (X^T X)^{-1} X^T y. Note that X^T X is p x p, which is small when p is small, so forming it costs O(np^2) and solving costs O(p^3).
Instead of inverting X^T X, compute the QR decomposition X = QR (reduced QR) and solve R β = Q^T y via back substitution. This avoids squaring the condition number and is backward stable.
Explain that QR for an n x p matrix costs O(np^2) flops, which is efficient when n >> p. Compare with normal equations (also O(np^2) but less stable) and SVD (more expensive but robust for rank-deficient cases).
Mention that for very large n, one can use stochastic gradient descent or randomized algorithms for approximate solutions, but for exact solutions, QR or Cholesky on X^T X (if well-conditioned) are standard. Also note memory constraints and the possibility of using iterative solvers like LSQR for sparse X.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.