Sparse tensor product approximation for a class of generalized method of moments estimators
Alexandros Gilch, Michael Griebel, Jens Oettershagen

TL;DR
This paper introduces a sparse tensor product quadrature method to efficiently approximate complex integrals in GMM and ML estimators, significantly improving convergence rates especially in high-dimensional, low-regularity cases.
Contribution
It develops a novel sparse tensor product approximation technique that enhances the convergence rate of GMM and ML estimators for complex integrals with low regularity.
Findings
Improved convergence rate by a factor of two for the proposed method.
Effective in high-dimensional and low-regularity integral approximations.
Numerical simulations demonstrate the method's efficiency in econometric models.
Abstract
Generalized Method of Moments (GMM) estimators in their various forms, including the popular Maximum Likelihood (ML) estimator, are frequently applied for the evaluation of complex econometric models with not analytically computable moment or likelihood functions. As the objective functions of GMM- and ML-estimators themselves constitute the approximation of an integral, more precisely of the expected value over the real world data space, the question arises whether the approximation of the moment function and the simulation of the entire objective function can be combined. Motivated by the popular Probit and Mixed Logit models, we consider double integrals with a linking function which stems from the considered estimator, e.g. the logarithm for Maximum Likelihood, and apply a sparse tensor product quadrature to reduce the computational effort for the approximation of the combined…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
