IDEAS home Printed from https://ideas.repec.org/a/cup/etheor/v33y2017i05p1218-1241_00.html

Asymptotically Efficient Estimation Of Weighted Average Derivatives With An Interval Censored Variable

Author

Listed:
  • Kaido, Hiroaki

Abstract

This paper studies the identification and estimation of weighted average derivatives of conditional location functionals including conditional mean and conditional quantiles in settings where either the outcome variable or a regressor is interval-valued. Building on Manski and Tamer (2002, Econometrica 70(2), 519–546) who study nonparametric bounds for mean regression with interval data, we characterize the identified set of weighted average derivatives of regression functions. Since the weighted average derivatives do not rely on parametric specifications for the regression functions, the identified set is well-defined without any functional-form assumptions. Under general conditions, the identified set is compact and convex and hence admits characterization by its support function. Using this characterization, we derive the semiparametric efficiency bound of the support function when the outcome variable is interval-valued. Using mean regression as an example, we further demonstrate that the support function can be estimated in a regular manner by a computationally simple estimator and that the efficiency bound can be achieved.

Suggested Citation

  • Kaido, Hiroaki, 2017. "Asymptotically Efficient Estimation Of Weighted Average Derivatives With An Interval Censored Variable," Econometric Theory, Cambridge University Press, vol. 33(5), pages 1218-1241, October.
  • Handle: RePEc:cup:etheor:v:33:y:2017:i:05:p:1218-1241_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0266466616000384/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vira Semenova, 2023. "Debiased Machine Learning of Aggregated Intersection Bounds and Other Causal Parameters," Papers 2303.00982, arXiv.org, revised May 2025.
    2. Hiroaki Kaido & Jiaxuan Li & Marc Rysman, 2018. "Moment inequalities in the context of simulated and predicted variables," CeMMAP working papers CWP26/18, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    3. Semenova, Vira, 2023. "Debiased machine learning of set-identified linear models," Journal of Econometrics, Elsevier, vol. 235(2), pages 1725-1746.
    4. Semenova, Vira, 2025. "Generalized Lee bounds," Journal of Econometrics, Elsevier, vol. 251(C).

    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:cup:etheor:v:33:y:2017:i:05:p:1218-1241_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/ect .

    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.