SearcharxivSearch

arXiv · 2609.16897

The Equivariance Criterion in a Linear Model for Random-$X$ Cases

Abstract

Equivariance is increasingly used in machine learning and statistics, often without systematic justification. In a companion article, the equivariance criterion was applied to the normal linear model with a fixed design matrix (fixed-$X$), yielding the minimum risk equivariant (MRE) estimators of the coefficient vector and of the condensed diagonal covariance matrix under a multivariate invariant location--scale group. We extend these results to the random-$X$ case, with covariates sampled from a population. The extension hinges on a distinction vacuous for fixed-$X$ but fundamental for random-$X$: whether risk and unbiasedness are evaluated conditionally on the realized design or after averaging over the design distribution. Under conditional evaluation, the fixed-$X$ group applies given $X$: least squares remains the best equivariant estimator of the coefficient vector, and the MRE estimators of the population variances keep their fixed-$X$ forms with population sizes at the realized design. Under absolute evaluation with an i.i.d.\ design, the picture changes qualitatively: the natural scale group acting jointly on $(Y,X)$ fixes the coefficient vector, the induced parameter-space action is intransitive, equivariant risks are constant only along orbits indexed by the signal-to-noise ratio $ρ=\|β\|^2/σ^2$, and no uniformly minimum risk equivariant estimator exists. In the scalar case the optimal equivariant weight is the oracle shrinkage factor $w^*(ρ)=ρ/(ρ+E[T^{-1}])$, with least squares recovered as the infinite-signal limit $ρ\to\infty$---explaining and refining the known failure of the Gauss--Markov theorem with random regressors. For a centered design under location--scale transformations, least squares remains optimal within the natural invariant-contrast class, and the MRE estimator $S^2/(n-p+2)$ of the error variance is valid under both modes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhengyang Zhang, Haojin Zhou. 2026-09-15. The Equivariance Criterion in a Linear Model for Random-$X$ Cases. https://arxiv.org/abs/2609.16897

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST