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

Testing Sign Agreement

Author

Listed:
  • Deborah Kim

Abstract

This article considers the problem of testing sign agreement among a finite number of parameters. This problem arises in empirical settings such as detecting treatment effects with opposite signs across subgroups, outcomes, or time periods, and testing instrument validity for local average treatment effects. For the null hypothesis that the parameters are either all non-negative or all non-positive, I propose two novel tests: a least favorable test and a conditional test. The least favorable test uses a worst-case null critical value, while the conditional test first screens components with large positive or negative estimates and then tests the remaining sign-unresolved components conditional on the screening event. Unlike existing sign agreement tests, both procedures accommodate arbitrary dependence among estimators; in the special case of independent estimators, the critical values depend only on the dimension and testing levels. We show that both tests control asymptotic size uniformly over a large class of nonparametric distributions. Local asymptotic power analysis reveals a tradeoff: the least favorable test is more powerful near boundary configurations where sign restrictions bind, whereas the conditional test is more powerful when some components are well separated from zero. Simulation evidence supports these theoretical predictions in finite samples.

Suggested Citation

  • Deborah Kim, 2026. "Testing Sign Agreement," Papers 2608.10294, arXiv.org.
  • Handle: RePEc:arx:papers:2608.10294
    as

    Download full text from publisher

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

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

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