The profile likelihood for the parameter of interest replaces the nuisance parameter by its constrained best fit: , with . It is not in general a normalized sampling density. A conditional likelihood instead uses the sampling law conditional on a statistic carrying the nuisance dependence. In the canonical exponential family here, conditioning on removes because the factor involving is constant over the conditioning fibre.
Let and let the observed equal . For the cumulant-generating function of at fixed ,
The saddlepoint solves , equivalently with . This is also the constrained likelihood equation, since . Assume an interior saddle, , and the usual smooth nonlattice conditions under which has a density. Exponential tilting to makes the tilted mean. A local normal approximation gives tilted density at that mean; undoing the tilt gives the saddlepoint density approximation
The factor is for the sample mean, rather than the sum. A transform-based derivation gives the same expression by expanding to second order at its stationary point.
The joint log-likelihood is . Subtracting cancels every appearance of the original , leaving
Any change from the ambient density to a conditional density on contributes only a data-dependent Jacobian determinant. Thus, up to a constant independent of , the saddlepoint conditional likelihood adjustment is
Equivalently up to the constant , where is the nuisance observed information. The adjustment has a positive sign. The printed exponential-family form alone does not guarantee a density for : for example a continuous can have . In a lattice case one must approximate the probability mass of the sum instead; the displayed density calculation uses the regular continuous interpretation.
A transformation model consists of a group acting measurably and invertibly on the sample space, an induced group action on the parameter space, and a family satisfying . In a generated, transitive model, every is the image of a reference distribution under some transformation. In the density formulation, the transformed density includes the appropriate sample-space Jacobian determinant; the model is a statement about whole probability laws, not merely about changing parameter names.
A maximal invariant has two properties: for every , and implies for some . It is therefore a coordinate for the group orbits, retaining exactly the information unaffected by the transformations. An equivariant estimator obeys , where the right action is the induced parameter action.
For the normalization construction, suppose the estimator determines a group element with . Define . Then
If , rearranging gives . This is an actual transformation in , so the normalized sample is a maximal invariant. This group-valued assumption matters: an estimator of a parameter with a nontrivial stabilizer does not necessarily determine a unique normalization. For a transitive parameter space , choose a transformation carrying the estimated parameter to the reference value and take the resulting normalized sample modulo the remaining -action. Different choices then have the same residual orbit. Under a free action is trivial and the simpler formula applies.
For a location-scale model, , , with composition . Its parameter action is . Choose location and scale estimates satisfying
For instance, on nonconstant samples take the sample mean and the positive square root of . The standardized vector
is invariant. Conversely, equality of these vectors gives for all , with and . Hence it is maximal, not just invariant. Degenerate constant samples have zero fitted scale and form a separate orbit; define a separate invariant value there. The construction is on labelled sample vectors: one must not discard their order unless permutations are also included in the transformation group.
Put , and . Apart from a data-only constant, the log-likelihood is
The natural parameters in the ambient two-parameter exponential family of normal distributions are and , restricted to the nonaffine curve , . Its parametrization has rank one. Thus this is a one-dimensional curved exponential family inside a two-dimensional full family.
The Fisher-Neyman factorization theorem makes sufficient. For two samples , the parameter-dependent part of their log density ratio is . A polynomial in is constant on only if both nonconstant coefficients vanish. The likelihood-ratio criterion for minimal sufficiency therefore proves is minimal sufficient.
Write with independent . Since , has a probability distribution independent of : it is an ancillary statistic. The denominator is nonzero almost surely. The Cauchy-Schwarz inequality gives ; on the requested positive branch, and .
The likelihood equation is . Its positive root is
There is exactly one positive root. The sign of the score function changes from positive to negative there, and at both ends of when , so it is the unique maximum-likelihood estimator. The useful identities are
Substitution yields, dropping the constant ,
Differentiating twice and using at the fitted value gives the observed information
The scalar P-star approximation uses . Consequently, with its normalizing factor explicitly retained,
Here is chosen to make the density integrate to one, and is independent of . To see this without assuming an approximate normalizer, define
The integral is finite and positive, and normalized is exactly
Indeed .
There is a direct check of this conditional scale density in a curved Gaussian family. In polar coordinates , the sample density times volume element is proportional to . Conditioning on fixes . The remaining angular factor is independent of , while . Thus the exact conditional radial density has the same normalized form. For the positive ancillary branch fixes the positive sign and the same one-dimensional radial calculation applies. In this scale model the normalized expression equals the exact conditional density, not merely its leading approximation.
For , compute its conditional distribution by one-dimensional quadrature:
It is zero for ; with the conditional-density calculation just given, this normalized formula is exact for almost every admissible . Numerically, subtract the maximum log integrand before exponentiating to avoid overflow. The sampling probability still depends on the stipulated true ; replacing it by a fitted value would be a separate plug-in inference step.
A scalar M-estimator is a selected root of , or equivalently a minimizer of a differentiable empirical objective whose derivative is this estimating equation. Its population statistical functional solves . Assume local uniqueness, consistency of the sample root, a valid differentiable local expansion, finite , and
These conditions include domination sufficient to differentiate under the integral and the required local uniform control of the sample derivative.
For , differentiate the population estimating equation at . Since its uncontaminated integral is zero,
Thus the influence function is , with a proportionality constant independent of .
Expanding the sample equation at its population root gives
The summands have mean zero. The central limit theorem and Slutsky's theorem therefore yield the scalar sandwich variance of an M-estimator
This is the limiting variance of the -scaled error; the estimator's variance is approximately . In a correctly centred location family with , let . Then , so the influence function is and . The minus sign from differentiating is essential.
The clipped Huber score in the subsequent subparts requires . The PDF only displays an upper bound: at the estimating function vanishes identically, and at it is a constant with no root. A positive clipping threshold is the regular interpretation.
At the standard normal distribution, symmetry and the odd Huber score give population root zero. For , the derivative of the clipped score is except at its two corners, which have zero normal probability. Put and write for the standard normal density. The sandwich variance of an M-estimator has numerator
Using and integration by parts,
Therefore
As checks, it tends to as , the sample mean limit, and to as , the sample median limiting variance. The estimator variance for a sample of size is approximately this quantity divided by .
The root calculation for the Huber location estimator gives
Since and equality is attained for , its gross-error sensitivity is
Thus it is a B-robust estimator at the normal reference distribution. At a general centred distribution the same conclusion requires , in which case the bound is . Boundedness of the score alone does not rescue a zero sensitivity denominator.
Let . Under the symmetric continuous null hypothesis, positive and negative signs have probability and zeros have probability zero. For the sign test, take and reject for small values: under the null. Choose with ; randomization at the next value attains exact size if desired. The lower tail is appropriate for .
For the Wilcoxon signed-rank test, rank increasingly and put . Continuous observations have no absolute-value ties almost surely. Conditional on the absolute values, the signs are independent fair signs because symmetry makes the sign independent of magnitude. Hence has the distribution of for independent Bernoulli random variables with parameter . Again reject in the lower tail, using this exact subset-sum distribution or a normal approximation. Independence gives the requested null moments:
For a symmetric kernel of fixed order , a one-sample U-statistic is . State the U-statistic central limit theorem: if , , and , then . The nondegeneracy condition is important.
For , its order-two U-statistic satisfies the exact Wilcoxon signed-rank statistic identity
To prove it, in an unordered pair the sign of the sum is the sign of whichever observation has larger absolute value. Counting the pairs for which a positive observation is larger contributes its rank minus one; its own positive-sign indicator supplies the remaining one.
Write for the distribution function of under the null. Symmetry gives and
The probability integral transform makes uniform on , so . Therefore . The centred is and is negligible on the scale of . Combining the exact decomposition and its mean gives
The lower-tail approximate level- rejection rule compares this standardized statistic with ; a half-unit continuity correction can refine discrete-tail calculations.
An Edgeworth expansion refines the central limit theorem by incorporating higher cumulants. For iid centred observations with variance , standardized sum , standardized third cumulant and fourth cumulant , its central-region density expansion is
under sufficient moment and smoothness/nonlattice conditions. Here , , are probabilists' Hermite polynomials. Expanding the characteristic exponent gives the cubic and quartic terms, while squaring the cubic term in the exponential gives the correction. Integrating the first correction, using , gives
Thus skewness determines the first departure from the normal approximation; inversion gives a Cornish-Fisher expansion for quantiles. These are asymptotic expansions, not guaranteed nonnegative densities in extreme tails. Lattice data require continuity/lattice corrections, and moment assumptions alone do not justify a uniform smooth-density expansion.
Parameters and are orthogonal parameters if the cross block of the expected Fisher information matrix is zero throughout the relevant parameter region:
This is a statement about expected information, not a requirement that every observed cross derivative vanish. For regular maximum-likelihood estimators, has limiting covariance equal to the inverse per-observation Fisher information matrix. Block diagonality therefore gives asymptotically independent fitted interest and nuisance parameters. The efficient information reduces to at an orthogonal parametrization, although nuisance estimation can still matter at higher orders.
For scalar interest and nuisance, retain and write the old nuisance as . The transformed cross information is . Hence an orthogonal nuisance coordinate can locally be found from
subject to local solvability and a nonsingular coordinate change. Global coordinates need not follow from this local construction. For the normal distribution with separately varying mean and variance parameters , the scores are and ; their product has zero expectation by symmetry. Thus the per-observation information is diagonal with entries and .
For , suppose has a unique interior maximum , is positive definite, the amplitude is smooth there, and contributions away from that maximum are negligible. Set . The quadratic expansion yields the Laplace approximation
The determinant comes from diagonalizing the Gaussian integral; it is an inverse square root, not an inverse determinant. Under standard higher smoothness and domination, the relative error is .
For a regular model and a fixed smooth positive proper prior , apply this to the marginal likelihood . With ,
As is of order , this produces the complexity term in the Bayesian information criterion after multiplying log marginal likelihood by . A posterior mode can also be used with the corresponding combined log-density curvature. Boundary modes, singular information and multiple dominant modes invalidate the single interior Gaussian formula; distinct nondegenerate dominant modes must have their contributions added.
Let be a regular likelihood-ratio test statistic for smooth restrictions, so its leading null law is . Suppose a higher-order calculation gives . The Bartlett correction rescales the statistic:
Its mean is , eliminating the first-order mean error. In regular likelihood models satisfying the usual Bartlett expansion, the same scaling removes the leading distributional error against the chi-square reference law, leaving an error for fixed tail probabilities. Matching a mean alone would not establish this distributional conclusion for an arbitrary statistic.
The coefficient depends on the model, null restrictions and nuisance parameters; it can be obtained from higher derivatives and cumulants of the log-likelihood, or estimated by null simulation when an analytic expression is inconvenient. Nuisance parameters require their appropriate null values or estimates. A correction improves finite-sample calibration within regular asymptotic theory; it does not turn a boundary-parameter or unidentifiable problem into a regular chi-square problem.
In statistical decision theory, the statistical invariance principle says that a procedure should respect transformations that leave the inferential problem unchanged. If a group action preserves the model and carries each of the null and alternative parameter sets into itself, an invariant test has rejection probability function . A maximal invariant identifies its orbits, so every invariant test factors through that statistic: define its value at an orbit using any representative; invariance makes the definition independent of the representative. If the group is transitive on the null parameter set, the null law of any invariant statistic is free of that nuisance parameter.
For example, testing a normal mean with unknown scale, positive transformations preserve a one-sided mean alternative. The statistic , with the usual unbiased sample-variance scale , is invariant and has the Student t-distribution with degrees of freedom under the null. For estimation the corresponding requirement is an equivariant estimator, together with a loss function invariant under simultaneous transformation of decision and parameter. Invariance alone does not prove unrestricted optimality or supply a unique best procedure.
There is a distinct probabilistic use of the term: the Donsker invariance principle states that centred iid partial sums, normalized by , converge as processes on to Brownian motion. Its empirical-process version gives a Brownian bridge, used by goodness-of-fit tests in the next note. These functional limit theorems should be distinguished from the group-based inferential principle.
Population influence functions describe infinitesimal contamination; finite-sample analogues examine actual changes to an empirical sample. For its empirical distribution , add an observation and define the sensitivity curve
Under suitable differentiability it approximates the influence function. A replacement version is , approximately . Their supremum magnitudes quantify finite one-observation sensitivity.
The empirical influence function instead substitutes directly in . For a differentiable M-estimator this gives . For quantile functionals, a discrete unsmoothed empirical law may not admit the required density derivative; a sensitivity curve or a smoothed empirical law is then preferable.
Global contamination is measured by finite-sample maximum bias , where counts replacements. Under the convention of the first fraction that causes unbounded bias,
This is the finite-sample replacement breakdown point. The largest replacement fraction still guaranteed bounded is one grid step smaller, so the conventions must be specified. One replacement sends a sample mean arbitrarily far, giving , while the ordinary scalar sample median has first-breaking fraction with the usual midpoint convention for even samples. Its limiting value is . Local influence and global breakdown answer different questions; a bounded influence function is not by itself a proof of a high breakdown point.
For a fully specified continuous null distribution , compare the empirical distribution function with . The probability integral transform makes iid uniform under the null, giving distribution-free calibration. Three common discrepancies are
These define the Kolmogorov-Smirnov test, Cramér–von Mises criterion and Anderson–Darling test, respectively. Reject for large values. The supremum detects the largest discrepancy, the unweighted integral combines discrepancies throughout the distribution, and the reciprocal weight emphasizes the tails.
The Donsker theorem for empirical distribution functions gives for a Brownian bridge , with covariance . Consequently the standard continuous-null limits are , , and for , respectively; the weighted last limit also requires control near the endpoints. Exact finite-sample or asymptotic null quantiles provide critical values.
If parameters in are estimated from the same observations, these fully specified-null critical values generally fail. A first-order expansion is
so the estimated parameter changes the limiting process. One must use the fitted-model null law, adjusted asymptotic theory, or a parametric bootstrap that re-estimates the parameters in each replicate.
For a regular iid model with a fixed-dimensional interior parameter , identifiability, sufficient differentiability and moment domination, and nonsingular per-observation Fisher information , a consistent maximum-likelihood estimator solves the score equation. Expanding it gives
where . The score has mean zero and covariance under the regularity assumptions. This proves the usual large-sample information bound and asymptotic efficiency within regular parametric inference. The observed curvature and the empirical score covariance consistently estimate when the model is correctly specified.
For smooth constraints with full-row-rank derivative , the Wald test uses
The likelihood-ratio test and score test, evaluated using the constrained fit and nuisance-adjusted efficient information, have the same first-order chi-square law. A quadratic local likelihood expansion explains their asymptotic equivalence. Profile likelihood supplies inference about a parameter of interest with fitted nuisance parameters, and the corresponding chi-square cutoffs give approximate confidence regions.
These conclusions depend on the stated regularity: parameters at a boundary, nonidentifiability, singular information, changing dimension, or parameter-dependent support can give different rates and limits. Under misspecification, the fitted parameter generally approaches a pseudo-true value and its variance is a sandwich covariance matrix, not simply inverse Fisher information.

Articles by others on the same topic (0)

There are currently no matching articles.