Regression Estimators (REG) Overview

• Regression Estimator (REG) is a statistical tool that maps observed data to regression parameters using unbiased, nonparametric, cluster-based, and robust approaches.
• It is applied in diverse settings from classic linear regression to high-dimensional, time-varying, and adaptive models, ensuring precise inference across various data structures.
• Empirical and theoretical studies show that REG methods reduce bias, control variance, and improve predictive accuracy even under heavy-tailed or outlier-prone conditions.

A regression estimator (REG) refers generically to any mapping from observed data to regression parameters, but in the academic literature, several distinct estimators have been proposed and labeled using the REG acronym or closely related terminology. Below, key classes and instantiations of regression estimators are systematically summarized, highlighting their mathematical constructions, large-sample properties, robustness, implementation, and application domains.

1. Classical and Unbiasedness-based Regression Estimators

A foundational approach to regression estimation is based on unbiasedness principles, requiring minimal distributional assumptions on the regressors.

• Population formulation: With random variables $Y$ and regressors $X_1,\ldots,X_p$, the conditional mean is specified as $E[Y \mid X] = b_0 + X^Tb$, where $b_0\in\mathbb{R}$ and $b\in\mathbb{R}^p$. Without invoking an explicit error term, estimation is built on population covariances:

$$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$

Sample analogs yield the unbiased estimator:

$$\hat b = S_{xx}^{-1}S_{yx},\quad \hat b_0 = \bar Y - \bar X^T\hat b,$$

under invertibility of $S_{xx}$. This estimator coincides with the ordinary least squares estimator under fixed design, extends naturally to AR($p$) time series, and admits unbiased variance estimation (Vellaisamy, 2015).

2. Distribution Regression Estimator (Nonparametric Likelihood Regression)

Distribution regression, as introduced by Chen, Ma, and Zhou, generalizes mean and quantile regression by modeling the entire error distribution nonparametrically.

• Model Specification: For i.i.d. data $\{(x_i, Y_i)\}$, with $X_1,\ldots,X_p$0, the error law $X_1,\ldots,X_p$1 is left unspecified and can be asymmetric, heavy-tailed, or multimodal.
• Likelihood Construction: The error distribution is estimated via kernel density methods:

$X_1,\ldots,X_p$2

with a negligible constant for stability. The nonparametric log-likelihood is

$X_1,\ldots,X_p$3

• Estimation: The estimator $X_1,\ldots,X_p$4 maximizes the nonconvex log-likelihood. Optimizers include BB (Varadhan-Gilbert) and local quadratic approximation schemes. The intercept $X_1,\ldots,X_p$5 is estimated post hoc given $X_1,\ldots,X_p$6.
• Asymptotic Theory: Under mild kernel regularity, $X_1,\ldots,X_p$7 is $X_1,\ldots,X_p$8-consistent and asymptotically normal with limiting variance given by the Fisher information of the unknown $X_1,\ldots,X_p$9.
• Penalized Extension: An adaptive-LASSO penalized version

$E[Y \mid X] = b_0 + X^Tb$0

achieves the oracle property for variable selection when $E[Y \mid X] = b_0 + X^Tb$1, $E[Y \mid X] = b_0 + X^Tb$2, and $E[Y \mid X] = b_0 + X^Tb$3.

• Empirical Performance: REG matches mean or quantile regression under Gaussian or Laplace noise, but dominates both under heavy-tailed or multimodal errors, yielding lower bias and mean squared error. High-dimensional penalized REG consistently improves correct-fit rates and predictive error compared to adaptive-LASSO or LASSO quantile regression (Chen et al., 2017).

3. Regression Estimators in Clustered and High-dimensional Settings

Recent developments emphasize regression estimation tailored for clustered or high-dimensional data.

Cluster-average estimator:

• Model: Data divided into $E[Y \mid X] = b_0 + X^Tb$4 independent clusters, each with cluster-specific data matrices $E[Y \mid X] = b_0 + X^Tb$5, targeting a common parameter $E[Y \mid X] = b_0 + X^Tb$6.
• Procedure: OLS is computed in each cluster to obtain $E[Y \mid X] = b_0 + X^Tb$7, then averaged:

$E[Y \mid X] = b_0 + X^Tb$8

Alternative expression is as a weighted least squares with $E[Y \mid X] = b_0 + X^Tb$9 block-diagonal, $b_0\in\mathbb{R}$0.

• Variance and Inference: Variance admits a closed form, and a robust Wald-type test for $b_0\in\mathbb{R}$1 is constructed. Asymptotic normality holds under both fixed and random coefficient models as $b_0\in\mathbb{R}$2, regardless of cluster size imbalance or strong within-cluster dependence.
• Comparison: In contrast to pooled OLS, cluster-average remains consistent under severe cluster imbalances, with lower empirical and asymptotic variance in unbalanced settings. Simulation studies demonstrate control of size and superior power for modest $b_0\in\mathbb{R}$3 and highly dominant clusters (Dey et al., 4 Feb 2026).

Minimax and high-dimensional estimators:

• Projected nearest neighbor (PNN) estimator: For $b_0\in\mathbb{R}$4 with $b_0\in\mathbb{R}$5 and $b_0\in\mathbb{R}$6, PNN projects onto a $b_0\in\mathbb{R}$7-dimensional subspace and performs nearest neighbor estimation in orthogonal directions:

$b_0\in\mathbb{R}$8

where $b_0\in\mathbb{R}$9. The minimax risk is characterized by Kolmogorov width $b\in\mathbb{R}^p$0; PNN achieves risk within $b\in\mathbb{R}^p$1 of the minimax bound for any design. Efficient algorithms based on semidefinite relaxation are available for $b\in\mathbb{R}^p$2 (Zhang, 2012).

4. Robust and Adaptive Regression Estimators

Robustness and adaptivity to contamination are critical for reliable regression.

• Shooting S-estimator: Designed for componentwise outlier contamination, this estimator sequentially updates regression coefficients via coordinate descent, embedding robust S-regressions. Each covariate is "cleaned" using hard rejection weights, and “partial residuals” are iteratively recomputed. The algorithm does not possess strict regression equivariance but considerably improves robustness to cellwise contamination compared to classic estimators, performing favorably in both simulation and real data (Öllerer et al., 2015).
• Time-varying and nonlinear regression estimators: REG estimators based on least-squares with dynamic extensions (LS + D, DREM) allow global exponential convergence in identifiable settings, accommodate time-varying parameters via forgetting factors, and employ a mixing step (DREM) for scalar regression decoupling. This approach extends to nonlinear parameterizations ($b\in\mathbb{R}^p$3 monotonic) and switched systems, ensuring bounded-input-bounded-state stability with respect to disturbances, faster transients, and applicability under weaker excitation conditions compared to classical LS (Ortega et al., 2022).

5. Bayesian Regression Estimators

The Bayesian regression estimator, under general loss functions, is defined as the minimizer of posterior-predictive expected loss: $b\in\mathbb{R}^p$4 with $b\in\mathbb{R}^p$5 the posterior predictive for $b\in\mathbb{R}^p$6 given $b\in\mathbb{R}^p$7 after $b\in\mathbb{R}^p$8 observations. For squared error loss, the estimator is the posterior predictive mean; for absolute error loss, the posterior predictive median. Under minimal assumptions (identifiable model, finite second moment, standard Borel covariate space), these estimators are strongly consistent in both $b\in\mathbb{R}^p$9 and $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$0, and the corresponding Bayes risks converge to zero, justifying the predictive distribution viewpoint for both parametric and nonparametric models (Nogales, 2022).

6. Computational and Algorithmic Considerations

• Row-wise and memory-efficient regression: Most regression estimators for linear, regularized, and even nonlinear models (OLS, IV, Ridge, LASSO, Elastic Net, probit, logit) are functionally dependent only on a small set of sufficient statistics (e.g., cross-products, right-hand-sides). These can be accumulated in a single pass over data, updating $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$1 (design) and $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$2 (response) matrices without ever constructing the full $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$3 matrix in memory. Clustered and robust variance estimators require minor modifications (per-cluster or per-block accumulators). This enables estimation on massive datasets with strict memory limits, matching the results of classic estimators and enabling inference tasks (homoscedastic, heteroskedastic, clustered errors, bootstraps) efficiently (Clarke et al., 2023).

7. Comparative Summary of Major Regression Estimators

Estimator	Assumptions & Strengths	Robustness/Adaptivity	Notable Properties
OLS/Unbiased REG	Arbitrary regressors, minimal moment requirements	Not robust to outliers	Unbiased, variance estimable, coincides with least-squares under fixed X
Distribution REG	Unknown, arbitrary error distribution $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$4	Robust to asymmetry, heavy-tails, multimod	$$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$5-consistent, penalized version enjoys oracle property
Cluster-average REG	Arbitrary cluster design, strong within-cluster dep	Robust to cluster size imbalance	Consistent, powerful Wald tests, valid for random coefficients
PNN/high-dim REG	High-dimensional ($$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$6), soft sparsity constraints	Minimax optimal, adaptive radius selection	Achieves risk close to theoretical minimax bound, efficient SDP approach
Shooting S-estimator	Cellwise (component) contamination	High breakdown point versus cell outliers	Bounded influence, coordinate descent, lacks full regression equivariance
Adaptive LS+D/DREM REG	Nonlinear, time-varying, switched, weak excitation	BIBS stable, tracks parameter changes	Monotonicity decoupling, exponential convergence, robust transients
Bayesian Regression	Arbitrary model/likelihood, prior Q	Posterior-predictive optimality	Consistency in $$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$7/$$b = \mathrm{Cov}(X,X)^{-1}\mathrm{Cov}(Y,X),\quad b_0 = E[Y] - E[X]^Tb.$$8, vanishing Bayes risk under weak assumptions

• (Vellaisamy, 2015) — Unbiasedness approach and relationships to OLS.
• (Chen et al., 2017) — Distribution regression, nonparametric likelihood approaches, oracle property.
• (Dey et al., 4 Feb 2026) — Cluster-average regression, robust inference with clustered data.
• (Zhang, 2012) — Projected nearest neighbor estimation for high-dimensional regimes.
• (Öllerer et al., 2015) — Robust shooting S-estimator for cellwise outliers.
• (Ortega et al., 2022) — Adaptive LS + D/DREM regression for nonlinear, time-varying, and switched systems.
• (Nogales, 2022) — Bayesian regression estimator and predictive distribution consistency.
• (Clarke et al., 2023) — Memory-efficient row-wise regression estimation.

These developments delineate the current theoretical and algorithmic landscape for regression estimation, encompassing classical, robust, high-dimensional, cluster-aware, adaptive, and Bayesian regimes, with rigorous results supporting principled application across diverse data structures and inferential demands.