In this paper, we consider estimation of the identified set when the number of moment inequalities is large relative to sample size, possibly infinite. Many applications in the recent literature on partially identified problems have this feature, including dynamic games, set-identified IV...

We propose a fast resample method for two step nonlinear parametric and semiparametric models, which does not require recomputation of the second stage estimator during each resample iteration. The fast resample method directly exploits the score function representations computed on each...

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...

This paper develops methods of inference for nonparametric and semiparametric parameters defined by conditional moment inequalities and/or equalities. The parameters need not be identified. Confidence sets and tests are introduced. The correct uniform asymptotic size of these procedures is...

This paper extends the asymptotic theory of GMM inference to allow sample counterparts of the estimating equations to converge at (multiple) rates, different from the usual square-root of the sample size. In this setting, we provide consistent estimation of the structural parameters. In...

This article studies inference of multivariate trend model when the volatility process is nonstationary. Within a quite general framework we analyze four classes of tests based on least squares estimation, one of which is robust to both weak serial correlation and nonstationary volatility. The...

The paper examines a Lagrange Multiplier type test for the constancy of the parameter in general models with dependent data without imposing any artificial choice of the possible location of the break. In order to prove the asymptotic behaviour of the test, we extend a strong approximation...

We characterize the robustness of subsampling procedures by deriving a formula for the breakdown point of subsampling quantiles. This breakdown point can be very low for moderate subsampling block sizes, which implies the fragility of subsampling procedures, even when they are applied to robust...