On Stein's Method of Moments and Generalized Score Matching
Alfred Kume, Stephen G. Walker
TL;DR
This work shows that a special case of Stein's method of moments aligns with generalized score matching when the Stein kernel is chosen as the gradient of the score, $\tau_\theta(x)=\nabla s_\theta(x)$. By embedding these estimators in a generalized method of moments (GMM) framework, it becomes natural to combine multiple weight functions $w(x)$ to form an optimal estimator, addressing the weight-selection problem inherent in generalized score matching. The authors derive a GMM formulation for exponential-family models, yielding a quadratic objective whose solution has a closed-form in terms of Monte Carlo estimates, and propose a two-step GMM to obtain an optimal weight matrix. They illustrate the approach with gamma-family examples, showing that the GMM-based estimators can match or surpass maximum likelihood performance in some settings while offering computational efficiency and flexibility. The framework thus provides a principled method to construct and combine multiple score-function-based estimators, with potential applicability to a broad class of exponential-family models.
Abstract
We show that a special case of method of moment estimator derived from the Stein class coincides with the class of generalized score matching estimator. Choosing a suitable weight function for generalized score matching is not straightforward. However, by placing it within the method of moment framework we can alleviate this problem by extending the Stein class to generalized method of moments. As a consequence we can work with a number of functions and hence derive generalized score matching estimators with optimal properties.
