A Monte Carlo experiment to analyze the curse of dimensionality in estimating random coefficients models with a full variance–covariance matrix

When the dimension of the vector of estimated parameters increases, simulation based methods become impractical, because the number of draws required for estimation grows exponentially with the number of parameters. In simulation methods, the lack of empirical identification when the number of parameters increases is usually known as the “curse of dimensionality” in the simulation methods. We investigate this problem in the case of the random coefficients Logit model. We compare the traditional Maximum Simulated Likelihood (MSL) method with two alternative estimation methods: the Expectation–Maximization (EM) and the Laplace Approximation (HH) methods that do not require simulation. We use Monte Carlo experimentation to investigate systematically the performance of the methods under different circumstances, including different numbers of variables, sample sizes and structures of the variance–covariance matrix. Results show that indeed MSL suffers from lack of empirical identification as the dimensionality grows while EM deals much better with this estimation problem. On the other hand, the HH method, although not being simulation-based, showed poor performance with large dimensions, principally because of the necessity of inverting large matrices. The results also show that when MSL is empirically identified this method seems superior to EM and HH in terms of ability to recover the true parameters and estimation time.

► Addressing the problem of the “curse of dimensionality”.
► Test of two new estimation methods: Expectation–Maximization and Laplace Approximation.
► Systematic exploration of the performance of the two methods under different circumstances.
► Model performance under different numbers of variables and difference sample sizes.
► Model performance under different structures of the variance–covariance matrix.