Sparse Unbiased Estimating Equations via Likelihood Score Alignment
G. Bertagnolli, Z. Huang and D. Ferrari
Free University of Bozen-Bolzano, IT, RMIT University, Melbourne, AU
Estimating equations are central to statistical inference, underpinning likelihood- and moment-based methods. Consider a parametric model and a sample . We study inference for in high-dimensional regimes (), based on an unbiased estimating function satisfying and the associated system . 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 has support with . Building on optimal estimating function theory [1, 2], we look for an optimal estimating function in the class of linear transformations of , where is the minimiser of the convex criterion
with , being the variability and sensitivity matrices of respectively. The penality enforces sparsity directly at the estimating function level, also providing a link between the sparsity pattern of and the active set . 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 , 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.