{'fraction_non_alphanumeric': 0.016774193548387096, 'fraction_numerical': 0.0, 'mean_word_length': 5.689655172413793, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Testing Over-Identifying Restrictions Without Consistent Estimation of the Asymptotic Covariance Matrix

We propose new over-identifying restriction (OIR) tests that are robust to heteroskedasticity and serial correlations of unknown form. The proposed tests do not require consistent estimation of the asymptotic covariance matrix and hence avoid choosing the bandwidth in nonparametric kernel estimation. Instead, they rely on the normalizing matrices that can eliminate the nuisance parameters in the limit. Compared with the conventional OIR test, the proposed tests require only a consistent, but not necessarily optimal, GMM estimator. Our simulations demonstrate that these tests are properly sized and may have power comparable with that of the conventional OIR test.