Duy Nguyen
arXiv 9 Oct 2026 · Statistics — Methodology
arXiv:2610.12873 · PDF · Extracted main text
We study the asymptotic properties of the nonlinear stochastic GMM algorithm proposed by Chen, Lee, Liao, Seo, Shin and Song for recursively estimating parameters defined by possibly nonlinear and overidentified moment restrictions $\E[g(X,β^*)]=0$. Each observation updates estimates of the moment Jacobian, inverse covariance matrix and Gauss--Newton preconditioner at a cost independent of sample size. For linear and nonlinear instrumental-variable moments, we derive an exact rank-two Sherman--Morrison--Woodbury update. The algorithm combines preconditioned stochastic approximation with iterate averaging. Under a preconditioned monotonicity condition, satisfied globally in linear models and locally around a consistent pilot estimate in general, we establish almost sure convergence and rates, as well as a functional central limit theorem with the efficient GMM variance. These results require four moments of the moment function and its Jacobian when the step exponent exceeds $2/3$. The inverse Gauss--Newton matrix consistently estimates this variance, and a projected linearised statistic enables online testing of overidentifying restrictions. We extend the results to $L$-dependent data with long-run variance weights under stronger moment assumptions. Simulations show that the averaged estimator approaches offline two-step GMM in accuracy and coverage at $10^6$ observations, while requiring a fraction of its computing time and fixed memory at up to $10^7$ observations. The online test achieves correct size and comparable power. In an application estimating the effect of a third child on weeks worked using $254{,}654$ women from the 1980 US Census, single-pass estimates agree with offline GMM within a fraction of a standard error on average across data orderings, and both methods yield the same overidentification-test conclusion in most orderings.
appendix boundary found by none_found · 100% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | X. Chen, S. Lee, Y. Liao, M. H. Seo, Y. Shin and M. Song, SGMM: stoc… (2025) nbad027 | 1.000 | 12 | 4 | 100% |
| 2 | T. G. Andersen and B. E. Srensen, GMM estimation of a stochastic vol… (1996) 328–352 | 0.843 | 3 | 3 | 100% |
| 3 | P. Cénac, A. Godichon-Baggioni and B. Portier, An efficient averaged… (2025) doi:10.3150/23-BEJ1637 | 0.737 | 3 | 2 | 100% |
| 4 | L. P. Hansen, Large sample properties of generalized method of momen… (1982) 1029–1054 | 0.737 | 3 | 2 | 100% |
| 5 | S. Lee, Y. Liao, M. H. Seo and Y. Shin, Fast and robust online infer… (2022) 7381–7389 | 0.737 | 3 | 2 | 100% |
| 6 | B. T. Polyak and A. B. Juditsky, Acceleration of stochastic approxim… (1992) 838–855 | 0.737 | 3 | 2 | 100% |
| 7 | J. Mullahy, Instrumental-variable estimation of count data models: a… (1997) 586–593 | 0.644 | 2 | 2 | 100% |
| 8 | W. K. Newey and D. L. McFadden, Large sample estimation and hypothes… (1994) 2111–2245 | 0.644 | 2 | 2 | 100% |
| 9 | M. Pelletier, On the almost sure asymptotic behaviour of stochastic… (1998) 217–244 | 0.644 | 2 | 2 | 100% |
| 10 | F. A. G. Windmeijer and J. M. C. Santos Silva, Endogeneity in count… (1997) 281–294 | 0.644 | 2 | 2 | 100% |
Showing the top 10 of 32 scored citations.