Forward Orthogonal Deviations GMM and the Absence of Large Sample Bias
It is well known that generalized method of moments (GMM) estimators of dynamic panel data regressions can have significant bias when the number of time periods ($T$) is not small compared to the number of cross-sectional units ($n$). The bias is attributed to the use of many instrumental variables. This paper shows that if the maximum number of instrumental variables used in a period increases with $T$ at a rate slower than $T^{1/2}$, then GMM estimators that exploit the forward orthogonal deviations (FOD) transformation do not have asymptotic bias, regardless of how fast $T$ increases relative to $n$. This conclusion is specific to using the FOD transformation. A similar conclusion does not necessarily apply when other transformations are used to remove fixed effects. Monte Carlo evidence illustrating the analytical results is provided.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Comparison of First-Difference and Forward Orthogonal Deviations GMM
This paper provides a necessary and sufficient instruments condition assuring two-step generalized method of moments (GMM) based on the forward orthogonal deviations transformation is numerically equivalent to two-step G…
Quantifying the Computational Advantage of Forward Orthogonal Deviations
Under suitable conditions, one-step generalized method of moments (GMM) based on the first-difference (FD) transformation is numerically equal to one-step GMM based on the forward orthogonal deviations (FOD) transformati…
Large-Maturity Regimes of the Heston Forward Smile
We provide a full characterisation of the large-maturity forward implied volatility smile in the Heston model. Although the leading decay is provided by a fairly classical large deviations behaviour, the algebraic expans…
Forward-backward algorithms with a biallelic mutation-drift model: Orthogonal polynomials, and a coalescent/urn-model based approach
Inference of the marginal likelihood of sample allele configurations using backward algorithms yields identical results with the Kingman coalescent, the Moran model, and the diffusion model (up to a scaling of time). For…
modelFinite Sample and Large Deviations Analysis of Stochastic Gradient Algorithm with Correlated Noise
We analyze the finite sample regret of a decreasing step size stochastic gradient algorithm. We assume correlated noise and use a perturbed Lyapunov function as a systematic approach for the analysis. Finally we analyze …