Regular Regressors Overview

• Regular regressors are regressors with intrinsic structural conditions, such as bounded variation or nonsingular Gram matrices, that guarantee stable excitation and consistent estimation.
• They enable accurate model identification in diverse frameworks including adaptive control, deterministic regression, linear models, and random coefficients through minimal structural assumptions.
• By replacing classical full-support or smoothness assumptions, regularity conditions facilitate precise inference even with partial excitation, limited variation, or rank deficiencies.

Searching arXiv for papers directly relevant to “Regular Regressors” and closely related usages across regression, adaptive control, and identification. Regular regressors are regressors endowed with structural conditions that make excitation, identification, or estimation well behaved. The term is not used uniformly across the literature. In adaptive control, a bounded regressor $w(t)\in\mathbb{R}^q$ is regular when its non-PE set

$$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$

is a subspace (Uzeda et al., 8 Jul 2025). In deterministic regression estimation from individual stable sequences, the closely related regularity object is the regression function $m$, required to lie in a bounded-variation class $\mathcal F(\alpha)$ (0710.2496). In linear regression with arbitrary stochastic regressors, the closest analogue is moment/rank regularity of the covariance or sample moment matrices (Vellaisamy, 2015). In random coefficients models with restricted regressor support, regressors are “regular enough” when their support is a set of uniqueness for the relevant transform class, even if that support is a proper subset or countable (Gaillac et al., 2021). This suggests that “regular regressors” is best treated as a family of structural conditions rather than a single universal definition.

1. Terminological scope and recurrent structure

Across these literatures, regularity plays the same methodological role: it replaces stronger classical assumptions by a smaller structural condition tailored to the estimation or identification problem. In adaptive control, regularity repairs the fact that persistent excitation can be “created out of nothing” by pathological linear combinations; in deterministic nonparametric regression, regularity replaces stochastic assumptions by bounded variation under empirical stability; in random-design linear regression, regularity becomes nonsingularity and perturbation control of Gram matrices; and in random coefficients models, it replaces full-support regressors by support conditions formulated as uniqueness sets (Uzeda et al., 8 Jul 2025, 0710.2496, Vellaisamy, 2015, Gaillac et al., 2021).

Context	Regularity object	Formal consequence
Adaptive control	bounded $w(t)$ with $W^\star$ a subspace	PE decomposition and a PE subspace $W=(W^\star)^\perp$
Stable-sequence regression	$m\in \mathcal F(\alpha)$	$L_2(\mu)$-consistent adaptive histogram estimation
Arbitrary-regressor linear model	nonsingular $C_{xx}$ or $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$0	identification and unbiased estimation of $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$1
Random coefficients with limited variation	regressor support as a set of uniqueness	identification under proper-subset, even discrete/countable, support

A plausible implication is that the most stable encyclopedic characterization of regular regressors is not domain-specific syntax but the underlying function: regularity identifies the subset of directions, moments, or transforms on which regression remains informative.

2. Geometric regularity in adaptive control

The most explicit formal definition appears in adaptive control. There a regressor $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$2 is used to reconstruct unknown quantities of the form

$$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$3

and persistent excitation is defined by

$$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$4

For bounded $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$5, the paper quotes the directional characterization

$$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$6

The pathology motivating regularity is that two scalar components $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$7, each individually not PE, can satisfy $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$8 PE. The paper’s canonical construction uses a PE signal $$W^\star := \{\, \alpha\in\mathbb{R}^q : \alpha^\top w \text{ is not PE} \,\}$$9 and a switching function $m$0, with

$m$1

so that each component is non-PE while $m$2 is PE. To exclude this behavior, the paper defines a regular regressor as a bounded regressor whose non-PE set $m$3 is a subspace, calls $m$4 the non-PE subspace, and defines the PE subspace by

$m$5

Its central structural result is the PE decomposition: for any complementary subspace $m$6 such that $m$7,

$m$8

where $m$9 is PE and $\mathcal F(\alpha)$0 is non-PE. Every PE regressor is regular, but not every regular regressor is PE. This yields a sharp identifiability statement: if

$\mathcal F(\alpha)$1

then $\mathcal F(\alpha)$2, and for regular regressors this becomes $\mathcal F(\alpha)$3. Full parameter convergence is therefore the special case $\mathcal F(\alpha)$4 (Uzeda et al., 8 Jul 2025).

3. Deterministic regression from stable sequences

A different but closely related use of regularity appears in deterministic nonparametric regression from an individual stable sequence. The data are a non-random sequence

$\mathcal F(\alpha)$5

and stability is defined through convergence of empirical input frequencies and empirical response averages on intervals. With

$\mathcal F(\alpha)$6

the sequence is stable when, for every $\mathcal F(\alpha)$7,

$\mathcal F(\alpha)$8

and

$\mathcal F(\alpha)$9

where $w(t)$0. The regularity class is specified by bounded variation. For a known nondecreasing function $w(t)$1,

$w(t)$2

The estimator is an adaptive dyadic histogram. With partitions

$w(t)$3

the histogram estimate is

$w(t)$4

with $w(t)$5. Resolution is selected by stopping times

$w(t)$6

leading to $w(t)$7 and the fixed-sample estimator

$w(t)$8

The positive theorem states that if $w(t)$9 is known, $W^\star$0, the pair $W^\star$1 is stable, and the $W^\star$2 are bounded, then

$W^\star$3

The complementary impossibility theorem is equally sharp: there is no $W^\star$4-consistent regression procedure for the family of stable sequences with $W^\star$5, $W^\star$6, and

$W^\star$7

The distinction is quantitative. A known upper envelope on variation is sufficient; merely knowing that the regression function has finite variation is not. The paper therefore makes the general point that regularity can rescue regression estimation in a deterministic setting only when the regularity is quantitatively available to the estimator (0710.2496).

4. Moment, rank, and perturbation regularity in linear regression

In linear regression with arbitrary regressors, regularity is not a special property such as fixed design or exogeneity relative to an explicit additive error. The model is specified directly by the conditional mean restriction

$W^\star$8

with arbitrary stochastic regressors. The population identification equation is

$W^\star$9

where $W=(W^\star)^\perp$0 collects $W=(W^\star)^\perp$1 and $W=(W^\star)^\perp$2 is the regressor covariance matrix. If $W=(W^\star)^\perp$3 is nonsingular, then

$W=(W^\star)^\perp$4

Replacing population moments by sample covariances gives

$W=(W^\star)^\perp$5

Under the conditional mean model these estimators are conditionally unbiased,

$W=(W^\star)^\perp$6

and in the fixed-design case they coincide with ordinary least squares. The closest analogue of regressor regularity is therefore moment/rank regularity: existence of first and second moments, existence of covariance matrices, and nonsingularity of $W=(W^\star)^\perp$7, $W=(W^\star)^\perp$8, or $W=(W^\star)^\perp$9 (Vellaisamy, 2015).

A broader perturbation-theoretic account of OLS makes this notion explicit. For arbitrary observations $m\in \mathcal F(\alpha)$0, the OLS estimator is analyzed relative to the empirical Gram matrix $m\in \mathcal F(\alpha)$1, a reference matrix $m\in \mathcal F(\alpha)$2, and the perturbation measure

$m\in \mathcal F(\alpha)$3

The central deterministic inequality controls $m\in \mathcal F(\alpha)$4 by the score-like term $m\in \mathcal F(\alpha)$5, with multiplicative factors depending on $m\in \mathcal F(\alpha)$6. This yields consistency and asymptotic linearity once two conditions are controlled: the empirical Gram perturbation and the empirical score average. Under independence, the paper summarizes the resulting scaling as

$m\in \mathcal F(\alpha)$7

so consistency holds when $m\in \mathcal F(\alpha)$8 and asymptotic linearity or normality when $m\in \mathcal F(\alpha)$9. Here regular regressors are, in effect, regressors whose empirical and reference Gram matrices remain sufficiently close and sufficiently well conditioned for the least-squares projection target to be estimable under misspecification (Kuchibhotla et al., 2019).

5. Limited-variation regressors in random coefficients models

A further major use of regressor regularity appears in random coefficients models when regressors do not have full support. The baseline model is

$L_2(\mu)$0

and the observable transform identity is

$L_2(\mu)$1

Classical full-support identification would require $L_2(\mu)$2 or an equivalent condition. The newer literature replaces this by transform-based uniqueness conditions. One paper makes this explicit: regressors are “regular enough” when their support is a set of uniqueness for the transform class induced by the admissible coefficient distributions, even if that support is a proper subset, possibly discrete but countable. In the linear case, a central sufficient condition is that

$L_2(\mu)$3

Under that support condition and moment determinacy of the coefficient law, equality of observable transform slices implies equality of all moment polynomials and hence equality of the latent law. The same paper also treats finite-support triangular designs, infinite-dimensional linear models, binary choice via the hemispherical transform, and panel-data extensions, always with the same logic: support regularity is a uniqueness-set property, not necessarily an open-support property (Gaillac et al., 2021).

The estimation counterpart studies the case where regressors have bounded support with nonempty interior,

$L_2(\mu)$4

while the random slopes are not heavy-tailed. The key tail condition is imposed on the slopes, not on the intercept: $L_2(\mu)$5 or alternatively with compact-support weights. Identification is expressed through the inverse-problem operator

$L_2(\mu)$6

which is injective on the relevant classes. The estimator is built from a singular-value decomposition of a truncated Fourier operator, a spectral cutoff in the slope coordinates, and an interpolation step near $L_2(\mu)$7. The resulting adaptive estimator attains minimax-optimal or near-optimal rates. In polynomial-smooth cases the rates are logarithmic; in supersmooth classes they become polynomial or nearly parametric. The paper’s main conceptual message is that limited regressor variation does not preclude nonparametric identification and estimation of random coefficients, provided the slope distribution satisfies the required regularity class (Gaillac et al., 2019).

6. Conceptual synthesis, limits, and common misconceptions

Several misconceptions recur across these literatures. First, regularity is not equivalent to persistent excitation. In adaptive control, every PE regressor is regular, but not every regular regressor is PE; the point of regularity is precisely to describe partial excitation geometrically through a PE subspace $L_2(\mu)$8 and a non-PE subspace $L_2(\mu)$9 (Uzeda et al., 8 Jul 2025). Second, regularity is not the same as merely imposing some smoothness or finite variation. In deterministic regression from stable sequences, finite variation alone is too broad: consistency requires a known nondecreasing envelope $C_{xx}$0 controlling $C_{xx}$1 (0710.2496). Third, arbitrary regressors do not eliminate structural requirements. In linear regression without an explicit error term, arbitrary stochastic regressors are admissible, but identification and unbiased estimation still require covariance existence and nonsingularity of $C_{xx}$2 or $C_{xx}$3 (Vellaisamy, 2015). Fourth, restricted regressor support does not imply nonidentification. In random coefficients models, proper-subset or countable support can still be sufficient when that support is a set of uniqueness for the relevant transform class (Gaillac et al., 2021).

Taken together, these results support a general interpretation. A regressor is regular when the structure it carries is rich enough to support the relevant inverse problem, but not necessarily rich in the same way across domains. In adaptive control the decisive object is a subspace of excited parameter directions; in deterministic nonparametrics it is a known variation envelope; in linear random-design regression it is Gram-matrix regularity; and in random coefficients models it is uniqueness-set structure of the support together with tail or moment restrictions on latent coefficients. The unifying theme is therefore not a single formal definition, but a common methodological role: regularity identifies the minimal structure under which regression remains geometrically coherent, statistically identifiable, or consistently estimable.