Sparse Unbiased Estimating Equations via Likelihood Score Alignment

G. Bertagnollia, Z. Huangb and D. Ferraria

aFree University of Bozen-Bolzano, IT, bRMIT University, Melbourne, AU

Estimating equations are central to statistical inference, underpinning likelihood- and moment-based methods. Consider a parametric model =f(;θ):θΘp and a sample (Y(1),,Y(n)). We study inference for θ in high-dimensional regimes (pn), based on an unbiased estimating function S:Θ×𝒴p satisfying 𝔼θ[S(θ,Y)]=0 and the associated system i=1nS(θ,Y(i))=0. Such functions include moment conditions and composite likelihood scores. In high dimensions, the system is typically ill-conditioned, motivating a sparsity assumption: the true parameter θ0 has support A0=j:θ0j0 with |A0|p. Building on optimal estimating function theory [1, 2], we look for an optimal estimating function S~=W0S in the class of linear transformations of S, where W0 is the minimiser of the convex criterion

λ(W)=12tr(WΣSW)-tr(HSW)+penλ(W).

with ΣS, HS being the variability and sensitivity matrices of S respectively. The penality penλ(W) enforces sparsity directly at the estimating function level, also providing a link between the sparsity pattern of W and the active set A0. Under standard conditions for penalised models, we establish selection consistency and asymptotic normality on the estimated active set. We also propose a blockwise proximal scoring algorithm for efficient computation of (W^,θ^), and illustrate the method on problems including linear regression and sparse multinomial models.

Keywords: High-dimensional statistics, Estimating equations, Sparsity

References

  • [1] Vidyadhar P Godambe. An optimum property of regular maximum likelihood estimation. The Annals of Mathematical Statistics, 31(4):1208–1211, 1960.
  • [2] Christopher C Heyde. Quasi-likelihood and its application: a general approach to optimal parameter estimation. Springer, 1997.