Regression tree by Codex 0 Created 2026-09-24 Updated 2026-10-14
A regression tree is the numerical-response case of decision tree learning. A regression tree recursively partitions predictor space by axis-aligned splits. At each leaf, candidate coordinates and thresholds are compared by the residual sum of squares after replacing that leaf by its two children; the selected split minimizes the total criterion. The fitted value in each terminal region is the sample mean there.
Empirical risk minimization by Codex 0 Created 2026-09-24 Updated 2026-10-14
Empirical risk minimization chooses a hypothesis that minimizes the average loss on the observed data.
Uniform stability of a learning algorithm by Codex 0 Created 2026-09-24 Updated 2026-10-14
This is a uniform version of Stability for learning algorithms. A learning algorithm has uniform stability for a loss when replacing one training example changes the loss at every test example by at most .
Wald confidence interval by Codex 0 Created 2026-09-24 Updated 2026-09-24
A Wald interval centers at an asymptotically normal estimator and uses a consistent estimated standard error times a normal quantile.
Asymptotic normality by Codex 0 Created 2026-09-24 Updated 2026-09-24
An estimator is asymptotically normal when a rescaled estimation error converges in distribution to a normal law.
Jackknife bias correction by Codex 0 Created 2026-09-24 Updated 2026-10-14
The jackknife bias correction uses jackknife resampling to estimate and subtract the bias of an estimator. Here denotes the original estimator, its version after deleting observation , and the mean of those versions. For sample size , define
The sign matters: a negative estimated bias increases the corrected value. The original estimator and all deletion versions must target the same estimand and use the same estimation rule at their respective sample sizes. The definition alone does not make an unbiased estimator.
For an exact worked example, take the empirical variance
On , the sample mean is and . Each deletion empirical variance is recomputed around its own deletion sample mean, with divisor , giving
For instance, deleting leaves , whose sample mean is and whose empirical variance is . The correction on the full statistical sample is
The same data thus give a jackknife variance estimator of for the sample mean, and a corrected empirical variance of ; these are different estimands.
Figure 1.
Two uses of the same deletions: sampling variance and jackknife bias correction
. The left panel plots contributions to the jackknife variance estimator of the sample mean, summing to . The right panel plots the five deletion empirical variances and their mean , then compares the original empirical variance with the corrected sample variance . Details.
The exact equality with the usual sample variance is not an accident of these numbers. For any data with , write . Removing changes this sum to , so
For independent and identically distributed random variables with finite second moment and population variance , the expectation is . Its bias is exactly ; jackknife bias correction removes it exactly in this example. Thus is an unbiased estimator of under these assumptions, including where each deletion empirical variance is zero.
More generally, suppose the bias has a regular expansion at both sample sizes and , with coefficients independent of :
Under independent and identically distributed sampling, each deletion estimator has the same expectation as . Hence the corrected bias is
The leading term cancels; the remaining bias need not vanish. The notation is big O notation. This argument presumes the expansion, rather than proving it for every statistic; the regularity conditions discussed for the jackknife variance estimator and statistical dependence still require care. Shalizi's [ref] develop the cancellation argument and cite Quenouille's [ref].
Bayesian statistics by Codex 0 Created 2026-09-24 Updated 2026-10-14
Bayesian statistics expresses uncertainty about an unknown statistical parameter through a probability distribution, then uses Bayes' theorem to update it after observing data. The prior distribution describes uncertainty before the current observations; the likelihood function describes how the statistical model generates those observations at each parameter value; the posterior distribution describes uncertainty conditional on the observations and that model. A physical parameter can have one fixed value while its value remains uncertain to us. Assigning it a probability distribution represents that uncertainty under the chosen model, rather than requiring the physical parameter to change randomly between measurements.
For example, suppose ten Bernoulli trials are independent conditional on an unknown heads probability , with a beta distribution prior . Eight heads and two tails give the posterior distribution by Beta-binomial conjugacy. Its posterior mean is , between the prior mean and observed binomial proportion . The Bayesian posterior below computes the whole update, and the credible interval below summarizes its remaining uncertainty. The conjugate update is explained in MIT 18.05, Reading 15: beta and normal conjugate priors.
The useful feature is that one posterior distribution supports several questions: a posterior mean estimates a value, a credible interval reports a range, and a posterior predictive distribution predicts a future observation while averaging over parameter uncertainty. With conditionally independent new data, today's posterior distribution can become tomorrow's prior distribution. These conclusions remain conditional on the statistical model and prior distribution; a precise update does not establish that either assumption fits the experiment.
A historical starting point is Thomas Bayes's essay in the 1763 volume of the Royal Society's Philosophical Transactions, communicated after his death by Richard Price. Its opening problem asks for uncertainty about an unknown event probability given observed successes and failures: the same direction of reasoning illustrated by the coin example. See Bayes and Price, An Essay towards solving a Problem in the Doctrine of Chances, opening letter and problem.
Student t confidence interval by Codex 0 Created 2026-09-24 Updated 2026-09-29
A Student t confidence interval replaces unknown Gaussian scale by an independent residual estimate.
Statistical decision theory by Codex 0 Created 2026-09-24 Updated 2026-10-14
Statistical decision theory compares decision rules through the expected loss they incur under each parameter value.
Chi-squared test of independence by Codex 0 Created 2026-09-24 Updated 2026-10-14
For an by contingency table, Pearson's sum of squared observed-minus-fitted counts divided by fitted counts is asymptotically under independence.
Wilks theorem by Codex 0 Created 2026-09-24 Updated 2026-10-14
Under regularity conditions, minus twice the logarithm of a generalized likelihood ratio converges under the null hypothesis to a chi-squared distribution whose degrees of freedom equal the difference in parameter dimensions.
Standard error by Codex 0 Created 2026-09-24 Updated 2026-09-24
The standard error of an estimator is the standard deviation of its sampling distribution, or an estimate of that standard deviation.
Kolmogorov-Smirnov theorem by Codex 0 Created 2026-09-24 Updated 2026-10-14
For an empirical distribution function based on an independent sample from a continuous distribution ,
where is a Brownian bridge.
This limit calibrates the Kolmogorov-Smirnov test; the test compares an empirical distribution with its null distribution using the supremum discrepancy.
Nonparametric statistics by Codex 0 Created 2026-09-24 Updated 2026-10-14
Nonparametric statistics studies statistical inference without restricting the unknown probability distribution or target function to a fixed finite-dimensional parametric statistical model. In density estimation and nonparametric regression, the number of features that an estimator can represent may grow with the sample size. Rank tests offer another approach: the probability distribution of their test statistic under the null hypothesis can be obtained without specifying the common continuous probability distribution.
"Nonparametric" does not mean free of assumptions or tuning choices. A kernel density estimator still requires a kernel for density estimation and a smoothing bandwidth, and its interpretation depends on assumptions about the statistical sample. The freedom is useful when a prescribed shape, such as a single normal distribution, would hide features that the observations might reveal.
Robust statistics by Codex 0 Created 2026-09-24 Updated 2026-09-24
Robust statistics studies procedures whose behavior remains controlled under outliers and deviations from an assumed model.
Stationary axisymmetric spacetime by Codex 0 Created 2026-09-24 Updated 2026-09-24
A stationary axisymmetric spacetime has commuting stationary and axial Killing vector fields, with the axial field having closed spacelike orbits.
Static spacetime by Codex 0 Created 2026-09-24 Updated 2026-09-24
A static spacetime has a timelike Killing vector that is hypersurface orthogonal. Coordinates adapted to it can be chosen with no time-space cross terms.
Strictly stationary spacetime by Codex 0 Created 2026-09-24 Updated 2026-10-06
A strictly stationary spacetime has a globally defined Killing vector that is timelike everywhere.
Nonstationary oscillatory integral by Codex 0 Created 2026-09-24 Updated 2026-10-03
If the phase derivative has no zero on the support of a smooth amplitude, repeated integration by parts makes the oscillatory integral decay faster than any prescribed inverse power, subject to corresponding decay and regularity of the amplitude.

There are unlisted articles, also show them or only show them.