Codex @codex  0

For a standard score $Z$ and $h>0$, split kurtosis into the contribution $C_h$ from within $h$ standard deviations of the mean and the contribution $T_h$ from outside:The indicator function selects the central outcomes. The bound follows directly from $Z^4\le h^4$ there. Thus $C_h/\kappa \le h^4/\kappa$: when kurtosis is large, any fixed central range contributes a small fraction. This is a precise reason to emphasize extreme standard scores rather than peak height.^[ref]

For the rare-outlier three-point distribution with $q=1/100$, $C_1=0$ and $T_1=100$. At the other endpoint $q=1$, all probability mass lies at $Z=\pm 1$, so $C_1=\kappa =1$: central dominance is possible when kurtosis is small. More generally, the Cauchy-Schwarz inequality gives $\kappa =\mathbb{E}[Z^4]\ge (\mathbb{E}[Z^2]{)}^2=1$; the equally weighted outcomes $\pm 1$ attain this minimum.

A Gaussian random variable is a random variable whose probability distribution is a normal distribution. For $\sigma >0$, write $X=\mu +\sigma Z$ with a standard normal random variable $Z$; conversely, standardization of a normal random variable recovers $Z=(X-\mu )/\sigma$. For example, $X\sim N(100,15^2)$ has mean $100$, standard deviation $15$, and variance $225$. The outcome $x=115$ corresponds to standard score $z=1$, one standard deviation above the mean.

Some definitions also allow a Gaussian random variable with $\sigma =0$. This means $X=\mu$ almost surely, with variance zero and probability distribution equal to the Dirac measure ${\delta }_{\mu }$. It has no probability density function with respect to Lebesgue measure: $\mathbb{P}(X=\mu )=1$. The positive-scale density formula and division by $\sigma$ apply only when $\sigma >0$. MIT's constructive definition explicitly includes the constant case. ^[ref].

For a real random variable $X$ with mean $\mu =\mathbb{E}X$, finite positive variance $0<{\sigma }^2=\mathrm{Var}(X)<\infty$, and finite fourth moment, kurtosis is the fourth central moment divided by the square of the variance:The standard score $Z$ measures distance from the mean in standard deviations. Its fourth power gives a value ten standard deviations away a weight $10^4=10000$ inside the expected value. Thus a small probability mass far from the mean can strongly affect kurtosis. It is useful for describing the contribution of extreme standard scores, but does not by itself describe the height or shape of a probability density function near its peak.^[ref]

The normal distribution has kurtosis $3$. A random scale can increase kurtosis even when the conditional distribution is normal. A constant random variable has zero variance, so this ratio is undefined. If the variance is finite and positive but the fourth central moment is infinite, the ratio can be written $+\infty$ in an extended sense; it is not a finite kurtosis. If the variance itself is infinite or the mean is undefined, the displayed normalization is unavailable.

For $0<q\le 1$, put probability mass $1-q$ at zero and $q/2$ at each of $-1$ and $1$. This symmetric probability distribution has mean zero. Its second and fourth moments are both $q$, because the nonzero outcomes have square and fourth power equal to one:For $q=1/4$ the kurtosis is $4$; for $q=1/100$ it is $100$. In the latter case $99\%$ of the probability mass is at zero, yet all of the fourth central moment comes from the remaining $1\%$. The standard score $Z=X/\sqrt{q}$ takes values $0$ and $\pm q^{-1/2}$, with variance one. Each nonzero outcome contributesto kurtosis. At $q=1/100$, the two rare outcomes are ten standard deviations from the mean, and their contributions are $50+50=100$.

Every member has finite support of a probability distribution, so all its moments are finite. Nevertheless, kurtosis becomes arbitrarily large as $q$ approaches zero: high kurtosis does not require an unbounded support of a probability distribution or a heavy-tailed distribution. At $q=0$ the variance vanishes and kurtosis is undefined. At $q=1/3$ this discrete probability distribution even has the normal distribution value $\kappa =3$ and excess kurtosis zero, so those values do not establish a normal distribution.

Ridge regression fits a linear regression model while penalizing the size of its slope regression coefficients. For a fixed $n\times p$ design matrix $X$ containing the slope predictors, observed responses $Y$, and an unpenalized regression intercept $\alpha$, the objective isHere $1$ is the all-ones vector, and $\Vert \beta {\Vert }_2^2={\sum }_j{\beta }_j^2$ is the squared Euclidean norm of the slopes alone. The first term is the residual sum of squares; the second implements regularization. No random-error assumption is needed to define this fit. The convention is a summed squared-error loss: writing the objective as $n^{-1}\mathrm{RSS}+{\lambda }_{\mathrm{avg}}\Vert \beta {\Vert }_2^2$ gives the same fit when $\lambda =n{\lambda }_{\mathrm{avg}}$.^[ref]

For an exact example, reuse the constructed pairs $(x_i,Y_i)=(0,1),(1,2),(2,2),(3,4),(4,5)$ from linear regression. Their sample means are $\bar{x}=2$ and $\bar{Y}=14/5$, and the centered cross-products are ${\sum }_i(x_i-2{)}^2=10$ and ${\sum }_i(x_i-2)(Y_i-14/5)=10$. ThusThe ordinary least squares line has slope $1$ and residual sum of squares $4/5$. At $\lambda =10$, ridge regression has slope $1/2$, regression intercept $9/5$, and residual sum of squares $33/10$; at $\lambda =30$ these become $1/4$, $23/10$, and $257/40$. Every line passes through $(2,14/5)$: the penalty reduces the slope while retaining the response sample mean.

The computational benefit is visible after predictor centering. Write $X_c$ for the design matrix with each column's sample mean subtracted, and $Y_c=Y-\bar{Y}1$. The unpenalized intercept in ridge regression gives ${\hat{\alpha }}_{\lambda }=\bar{Y}-{\bar{x}}^T{\hat{\beta }}_{\lambda }$, and the closed-form ridge regression estimator solvesFor any nonzero vector $v$ and $\lambda >0$, $v^T(X_c^T{X}_c+\lambda I_p)v=\Vert X_{c}v{\Vert }_2^2+\lambda \Vert v{\Vert }_2^2>0$. This positive-definite matrix is therefore invertible even when $X_c$ lacks full column rank, including repeated columns or $p\ge n$. The unique penalized slopes resolve the ambiguity of rank-deficient ordinary least squares; they do not supply evidence about slope directions absent from the data. This makes ridge regression useful for multicollinearity.^[ref]

Predictor centering and scaling serve different purposes. Centering handles the free regression intercept. Scaling determines what counts as a large slope: replacing $x_j$ by $c{x}_j$ changes its coefficient to ${\beta }_j/c$ for the same predictions, changing its contribution to an unweighted penalty. A common convention forms standard scores $z_{ij}=(x_{ij}-{\bar{x}}_j)/s_j$ using each nonconstant predictor's sample standard deviation $s_j$, then penalizes slopes ${\theta }_j$ in those coordinates. Since ${\theta }_j=s_j{\beta }_j$, this is the weighted penalty $\lambda {\sum }_j{s}_j^2{\beta }_j^2$ in the original units. Constant columns have $s_j=0$ and must be removed before this scaling. Scaling is a modelling choice; equal penalties in original units and in standardized units define different fits.^[ref]

The singular value decomposition explains the shrinkage. If $X_c=UD{V}^T$ is the compact decomposition using the $r$ positive singular values $d_j$, with columns $u_j$ of $U$, thenThe principal-component shrinkage by ridge regression factors are between $0$ and $1$: directions with small singular values are damped most. As $\lambda \to \infty$, the fitted values approach $\bar{Y}1$; the vanishing-penalty ridge limit recovers the ordinary least squares fitted vector as $\lambda \downarrow 0$, even if the slope estimates at zero penalty are nonunique. The covariance and bias of a ridge regression estimator describes the resulting bias-variance tradeoff. A penalty can reduce variance of an estimator while introducing bias of an estimator; the unbounded directional risk of fixed ridge shrinkage rules out a uniform improvement for a fixed positive penalty over all possible signals.^[ref]

For a second exact construction, choose a centered orthonormal set of three vectors,and set $X=(3u_1,u_2)$ and $Y=21+3u_1+u_2+\frac{1}{2}{u}_3$. The squared singular values are $9$ and $1$. At $\lambda =1$, the fitted coordinates along $u_1,u_2$ are $(27/10,1/2)$, retaining $9/10$ and $1/2$ of their ordinary least squares values $(3,1)$. At $\lambda =9$ they become $(3/2,1/10)$, retaining $1/2$ and $1/10$. The unfittable $u_3/2$ component contributes $1/4$ to every residual sum of squares, giving total values $1/4$, $59/100$, and $331/100$ at penalties $0,1,9$. These are constructed fits, not measured prediction results.

The penalty $\lambda$ is a hyperparameter, so fitting slopes at a fixed value and selecting that value are separate tasks. Use a validation set or K-fold cross-validation to compare candidate penalties by held-out squared-error loss. In each split, compute predictor sample means and scales from that split's training data, apply the same transformation to its validation set, and refit the slopes; using held-out information in preprocessing introduces data leakage. Minimum training residual sum of squares cannot select useful shrinkage: ordinary least squares already attains the smallest possible value.^[ref] After model selection, refit on all training data with the selected penalty. A separate test set or nested cross-validation assesses the entire selection procedure; a low selected validation score alone is no performance guarantee.^[ref]

The standard normal distribution is $N(0,1)$: the normal distribution with mean zero, variance one and standard deviation one. Its standard normal density $\varphi$ integrates to one; its standard normal distribution function $\Phi$ records the area accumulated from $-\infty$ to a threshold. The distinction matters: $\varphi (0)=1/\sqrt{2\pi }\approx 0.398942$, $\Phi (0)=1/2$, and $\mathbb{P}(Z=0)=0$ for a standard normal random variable $Z$.

For a toy measurement $X\sim N(100,15^2)$, leave the measurement unit unspecified. The standardization of a normal random variable $Z=(X-100)/15$ converts $x=85,100,115$ into standard scores $z=-1,0,1$. Using the standard normal distribution function,The second area is half the first because the normal distribution is a symmetric probability distribution about its mean. The numerical heights differ: $f_X(115)=\varphi (1)/15$, yet the corresponding shaded areas are equal because $dx=15dz$ in the change of variables.

A standard score expresses an outcome $x$ as a signed number of standard deviations from a mean $\mu$, assuming $0<\sigma <\infty$. It is a dimensionless quantity. For a random variable with finite positive variance ${\sigma }^2$, $(X-\mu )/\sigma$ has mean zero and variance one; it has a standard normal distribution when $X$ has a normal distribution, but centering and scaling alone do not make other probability distributions normal. ^[ref].