Hostname: page-component-76d6cb85b7-jhrpq Total loading time: 0 Render date: 2026-07-15T13:09:27.672Z Has data issue: false hasContentIssue false

ALGORITHMIC SUBSAMPLING UNDER MULTIWAY CLUSTERING

Published online by Cambridge University Press:  11 July 2023

Harold D. Chiang*
Affiliation:
University of Wisconsin–Madison
Jiatong Li
Affiliation:
Vanderbilt University
Yuya Sasaki
Affiliation:
Vanderbilt University
*
Address correspondence to Harold D. Chiang, Department of Economics, University of Wisconsin–Madison, Madison, WI 53706, USA; e-mail: hdchiang@wisc.edu.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper proposes a novel method of algorithmic subsampling (data sketching) for multiway cluster-dependent data. We establish a new uniform weak law of large numbers and a new central limit theorem for multiway algorithmic subsample means. We show that algorithmic subsampling allows for robustness against potential degeneracy, and even non-Gaussian degeneracy, of the asymptotic distribution under multiway clustering at the cost of efficiency and power loss due to algorithmic subsampling. Simulation studies support this novel result, and demonstrate that inference with algorithmic subsampling entails more accuracy than that without algorithmic subsampling. We derive the consistency and the asymptotic normality for multiway algorithmic subsampling generalized method of moments estimator and for multiway algorithmic subsampling M-estimator. We illustrate with an application to scanner data for the analysis of differentiated products markets.

Information

Type
ARTICLES
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press