IDEAS home Printed from https://ideas.repec.org/a/tpr/restat/v107y2025i6p1684-1701.html

Inference for Dependent Data with Learned Clusters

Author

Listed:
  • Jianfei Cao

    (Northeastern University)

  • Christian Hansen

    (University of Chicago Booth School of Business)

  • Damian Kozbur

    (University of Zurich)

  • Lucciano Villacorta

    (Central Bank of Chile)

Abstract

This article presents and analyzes an approach to cluster-based inference for dependent data. The primary setting considered here is with spatially indexed data in which the dependence structure of observed random variables is characterized by a known, observed dissimilarity measure over spatial indices. Observations are partitioned into clusters with the use of an unsupervised clustering algorithm applied to the dissimilarity measure. Once the partition into clusters is learned, a cluster-based inference procedure is applied to a statistical hypothesis testing procedure. The procedure proposed in the article allows the number of clusters to depend on the data, which gives researchers a principled method for choosing an appropriate clustering level. The article gives conditions under which the proposed procedure asymptotically attains correct size. A simulation study shows that the proposed procedure attains near nominal size in finite samples in a variety of statistical testing problems with dependent data.

Suggested Citation

  • Jianfei Cao & Christian Hansen & Damian Kozbur & Lucciano Villacorta, 2025. "Inference for Dependent Data with Learned Clusters," The Review of Economics and Statistics, MIT Press, vol. 107(6), pages 1684-1701, November.
  • Handle: RePEc:tpr:restat:v:107:y:2025:i:6:p:1684-1701
    DOI: 10.1162/rest_a_01460
    as

    Download full text from publisher

    File URL: https://doi.org/10.1162/rest_a_01460
    Download Restriction: Access to PDF is restricted to subscribers.

    File URL: https://libkey.io/10.1162/rest_a_01460?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    Citations

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


    Cited by:

    1. Romano Li & Jianfei Cao, 2026. "The Condition-Number Principle for Prototype Clustering," Papers 2604.07744, arXiv.org.

    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:tpr:restat:v:107:y:2025:i:6:p:1684-1701. 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: The MIT Press (email available below). General contact details of provider: https://direct.mit.edu/journals .

    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.