IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.16605.html

Kernel Minimum Distance Estimation and Testing with Conditional Moment Restrictions: A Unified Framework

Author

Listed:
  • Yuhao Li
  • Haokun Lu
  • Xiaojun Song

Abstract

We propose a unified Kernel Minimum Distance (KMD) framework for estimating and testing models defined by conditional moment restrictions. By embedding conditional moments into a Reproducing Kernel Hilbert Space (RKHS), we construct a closed-form $V$-statistic objective function that quantifies the distance from the restrictions. We establish the $\sqrt{n}$-consistency and asymptotic normality of the associated minimum distance estimator. Within this framework, the minimized objective function naturally yields a consistent omnibus specification test. Unlike projection-based methods that require auxiliary nonparametric estimation for Neyman orthogonalization, our test inherently captures the estimation effect via a projected kernel structure. We derive asymptotic properties of the test statistics under the null hypothesis, the alternative hypothesis, and a sequence of local alternatives converging to the null at the parametric rate $n^{-1/2}$. The validity of a computationally simple multiplier bootstrap is established to facilitate inference. Simulation results demonstrate robust finite-sample performance, and the framework is illustrated by analyzing Engel curves using UK Family Expenditure Survey data.

Suggested Citation

  • Yuhao Li & Haokun Lu & Xiaojun Song, 2026. "Kernel Minimum Distance Estimation and Testing with Conditional Moment Restrictions: A Unified Framework," Papers 2607.16605, arXiv.org.
  • Handle: RePEc:arx:papers:2607.16605
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.16605
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2607.16605. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.