Estimation with Numerical Integration on Sparse Grids

For the estimation of many econometric models, integrals without analytical solutions have to be evaluated. Examples include limited dependent variables and nonlinear panel data models. In the case of one-dimensional integrals, Gaussian quadrature is known to work efficiently for a large class of problems. In higher dimensions, similar approaches discussed in the literature are either very specific and hard to implement or suffer from exponentially rising computational costs in the number of dimensions - a problem known as the "curse of dimensionality" of numerical integration. We propose a strategy that shares the advantages of Gaussian quadrature methods, is very general and easily implemented, and does not suffer from the curse of dimensionality. Monte Carlo experiments for the random parameters logit model indicate the superior performance of the proposed method over simulation techniques

Estimation with Numerical Integration on Sparse Grids

For the estimation of many econometric models, integrals without analytical solutions have to be evaluated. Examples include limited dependent variables and nonlinear panel data models. In the case of one-dimensional integrals, Gaussian quadrature is known to work efficiently for a large class of problems. In higher dimensions, similar approaches discussed in the literature are either very specific and hard to implement or suffer from exponentially rising computational costs in the number of dimensions - a problem known as the "curse of dimensionality" of numerical integration. We propose a strategy that shares the advantages of Gaussian quadrature methods, is very general and easily implemented, and does not suffer from the curse of dimensionality. Monte Carlo experiments for the random parameters logit model indicate the superior performance of the proposed method over simulation techniques.Estimation; Quadrature; Simulation; Mixed Logit

Hot new directions for quasi-Monte Carlo research in step with applications

This article provides an overview of some interfaces between the theory of quasi-Monte Carlo (QMC) methods and applications. We summarize three QMC theoretical settings: first order QMC methods in the unit cube $[0,1]^s$ and in $\mathbb{R}^s$, and higher order QMC methods in the unit cube. One important feature is that their error bounds can be independent of the dimension $s$ under appropriate conditions on the function spaces. Another important feature is that good parameters for these QMC methods can be obtained by fast efficient algorithms even when $s$ is large. We outline three different applications and explain how they can tap into the different QMC theory. We also discuss three cost saving strategies that can be combined with QMC in these applications. Many of these recent QMC theory and methods are developed not in isolation, but in close connection with applications