MLLGMEDec 24, 2023

Efficient Estimation of the Central Mean Subspace via Smoothed Gradient Outer Products

arXiv:2312.15469v212 citationsh-index: 19
Originality Highly original
AI Analysis

This work addresses a bottleneck in statistical estimation for researchers in dimension reduction by improving convergence rates without stringent distributional assumptions.

The paper tackles the problem of sufficient dimension reduction for multi-index models by proposing an estimator for the central mean subspace that achieves a fast parametric convergence rate of C_d * n^{-1/2} under general distributional conditions, with a prefactor C_d ∝ d^r for polynomial link functions and Gaussian covariates.

We consider the problem of sufficient dimension reduction (SDR) for multi-index models. The estimators of the central mean subspace in prior works either have slow (non-parametric) convergence rates, or rely on stringent distributional conditions (e.g., the covariate distribution $P_{\mathbf{X}}$ being elliptical symmetric). In this paper, we show that a fast parametric convergence rate of form $C_d \cdot n^{-1/2}$ is achievable via estimating the \emph{expected smoothed gradient outer product}, for a general class of distribution $P_{\mathbf{X}}$ admitting Gaussian or heavier distributions. When the link function is a polynomial with a degree of at most $r$ and $P_{\mathbf{X}}$ is the standard Gaussian, we show that the prefactor depends on the ambient dimension $d$ as $C_d \propto d^r$.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes