Uniform Inference for Two-Way Clustered Data

arXiv:2611.16584 · econ.EM · Submitted 2026-11-12 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.

Ruth: We're looking at the paper: "Uniform Inference for Two-Way Clustered Data".

Warren: Here's the gist of the paper. Uniform inference for two-way clustered data establishes uniformly asymptotically exact inference for the population mean of two-way clustered data, allowing the data-generating process to vary with sample size The studentized matching estimator admits a uniform standard normal approximation whenever the number of matchings is fixed or grows at any rate slower than the smaller cluster count The Problem and Proposed Solution Two-way clustering is widely used in empirical economics to account for dependence among observations that share a cluster in either of two dimensions When row or column effects dominate, the normalized full-array mean typically has a Gaussian limit, but interactions between rows and columns can produce a non-Gaussian limit Menzel (2021, Proposition 4.1) shows that the limiting law of the normalized full-array mean cannot be estimated uniformly consistently over such sequences The authors approach this inference problem by constructing a different estimator of the same population mean, for which Gaussian critical values are uniformly valid Their estimator averages the means obtained from repeated random matchings Characterization of the Matching Estimator The authors make four contributions to their work First, they characterize the limiting distribution of the matching estimator as the number of matchings varies Second, they provide a closed-form variance estimator that makes the confidence interval straightforward to compute Third, they establish uniformly asymptotically exact inference for the population mean under their moment conditions Fourth, they extend the procedure to smooth functions of generalized method of moments (GMM) parameters Precision and Trade-offs in Matching The choice of how many matchings to use matters because averaging too many can cause the estimator to inherit the non-Gaussian limit of the full-array mean Proposition 2 shows that for every N ≤ T and B ≥ 1, E

bθNT,B: = θNT and VNT,B:= Var(bθNT,B) = VNT,F full-array variance + VNT,1 − VNT,F B matching variance The choice of B also determines precision In the degenerate and intermediate cases (νNT → c < 1), choosing B = o(N) makes the full-array variance share wNT,B vanish, so the standardized matching estimator has a standard normal limit Uniform Coverage and Variance Estimation Theorem 1 establishes uniform Gaussian inference for deterministic B = o(N) under moment bounds The resulting confidence interval is INT,B(1 − α) = bθNT,B − z1−α/2 qbVNT,B,bθNT,B + z1−α/2 qbVNT,B The variance estimator bVNT,B is positive semidefinite by construction in every sample Extension to GMM Parameters The authors extend the results to smooth functions of GMM parameters, including regression coefficients They show that the same restriction on the number of matchings makes this term negligible relative to the standard error of the target Theorem 2 confirms uniform Gaussian inference for GMM parameters when B = o(N) A single matching produces an i.i.d.

Ruth: sample because every selected observation has a different row index and a different column index Repeated matching recovers much of the precision of the full array The authors recommend B = ⌊N/3⌋ as a default choice for repeated matching because it delivers a substantial gain in precision over one matching while keeping finite-sample coverage close to nominal When shorter intervals are the priority, B = ⌊N/log N⌋ is a reasonable choice with the trade-off of more conservative coverage in the independent and product designs References Aldous, D.

Warren: J., Representations for partially exchangeable arrays of random variables Bentkus, V.

Ruth: and F.

Title and authors: Ruth: To summarize what they did here, the core idea of this paper is to solve a problem where two-way clustering makes the limiting distribution of the normalized full-array mean non-Gaussian in some situations >.

Warren: So, they address Menzel's result which says you can't always estimate that asymptotic distribution uniformly consistently over all sequences because interactions between rows and columns can create these non-Gaussian limits >.

Iris: And their solution is to construct a different estimator for the same population mean, one where the critical values used for inference are guaranteed to be uniformly valid, which they achieve by averaging means from repeated random matchings >.

Ruth: This averaging process of repeated random matchings is the key mechanism they use to create an estimator that has uniform Gaussian validity across those tricky dependence regimes >.

Warren: So, instead of relying on the standard full array mean approach which breaks down under these conditions, they propose this matching estimator as a robust way to estimate the same thing >.

Iris: And what makes this specific construction work is that they give you a closed-form variance estimator that is positive semidefinite in every sample by construction >.

Ruth: That means you don't need to worry about whether your variance estimate is mathematically valid or not, because it’s guaranteed to be positive semidefinite >.

Warren: It sounds like the authors are essentially building a new statistical tool specifically tailored to overcome the limitations of the conventional full array mean when dependence isn't just simple row-wise or column-wise >.

Iris: Exactly, and they show that by choosing the number of matchings B carefully—specifically when it grows slower than the smaller cluster count—you can keep that Gaussian limit intact >.

Ruth: So, the central finding is that this studentized matching estimator admits a uniform standard normal approximation under their moment conditions >.

Warren: And they also show this holds even when we extend it to smooth functions of GMM parameters, meaning different parts of the model can have different dependence behaviors while still getting uniform exact coverage >.

Iris: That extension for GMM parameters is powerful because it means the structure of the inference doesn't have to be fixed around just one specific moment component >.

The paper's summary: Ruth: Now let’s talk about the actual improvements they suggest for this approach, because this isn't just a theoretical exercise; it has practical implications >.

Warren: What are the key practical takeaways? Are we talking about something that’s significantly faster to compute, or just more stable in terms of results?

Ruth: The first improvement is that they provide a closed-form variance estimator that makes the confidence interval calculation straightforward, and as we discussed, it’s positive semidefinite in every sample >.

Iris: That's the part I like most because it removes the need for a bootstrap or any preliminary test of the dependence regime before you can even think about setting up your confidence interval >.

Warren: So that’s a direct win for implementation, reducing computational overhead and uncertainty in deployment, right?

Ruth: It is, but there’s another improvement related to how we choose B. They provide specific recommendations: B equals floor of N over three as a default choice for repeated matching because it gives you precision gain while keeping the finite sample coverage close to nominal >.

Iris: So that’s a concrete number we can actually use, not just "choose B appropriately" in abstract terms >.

Warren: And if we need shorter intervals, they suggest B equals floor of N over log N as a reasonable choice, though that means more conservative coverage in the independent and product designs >.

Ruth: That trade-off is important—more conservatism for smaller intervals when you're dealing with those simpler designs >.

Iris: And they also show that if we look at GMM parameters, the same restriction on B makes that term negligible relative to the standard error of the target, confirming it works there too >.

Warren: So it seems like this method isn't just theoretical; it’s giving us a specific recipe for how to run an analysis with two-way clustering >.

The paper's improvements: Ruth: To wrap up, we’re looking at the paper "Uniform Inference for Two-Way Clustered Data." It established that we can use a studentized matching estimator to get uniform asymptotic standard normal approximations under their moment conditions >.

Warren: And they showed this is possible even when the dependence structure varies with the sample size because they have a closed-form variance estimator that is positive semidefinite in every sample >.

Iris: It really solidifies the idea that we can handle complex, non-Gaussian limits in two-way clustered data by averaging means from repeated random matchings >.

Ruth: So, the main implication is that for anyone working with empirical economics or econometrics using two-way clustering, this paper gives you a concrete method for achieving uniform coverage across dependence regimes >.

Warren: It’s a practical tool because it lets us move past just knowing that the full array mean has a Gaussian limit under simple conditions and gives us something more robust for real-world scenarios >.

Iris: We can trust this inference when we use their proposed method to estimate population means, even when things get complicated due to row or column interactions >.

Ruth: So, this paper provides a solid framework for applying these techniques to complex data structures, and that’s what it is all about >.

Conclusion: Ruth: So, to wrap up on "Uniform Inference for Two-Way Clustered Data," we’re talking about how this new studentized matching estimator gives us a reliable way to estimate population means even when the dependence structure is messy across two dimensions >.

Warren: Right, and the key thing here is that it doesn't rely on the limiting law of the full array mean being perfectly Gaussian, which used to be a problem for this kind of data >.

Iris: I think what’s really neat is that they construct an estimator where the confidence interval critical values are guaranteed to work uniformly across different dependence regimes >.

Ruth: That means we can actually use these confidence intervals without having to test every single dependence structure beforehand, which is a big relief for applying this in markets or economics >.

Warren: And they provide a closed-form variance estimator that’s positive semidefinite in every sample, so the calculation itself is solid and straightforward >.

Iris: That positive semidefinite property really takes the guesswork out of things like setting up those variance estimates for confidence intervals >.

Ruth: It’s also powerful because they extend this to smooth functions of generalized method of moments parameters, meaning we can apply this to different parts of a model that might have totally different dependence behaviors >.

Warren: That extension for the GMM parameters is important because it shows the same matching restriction keeps those terms small enough relative to the standard error >.

Iris: The quadratic term in their moment function becomes negligible when you keep the number of matchings B small relative to N, which simplifies things a lot >.

Ruth: And for practical use, they suggest a default choice of B equals floor of N over three for repeated matching because it gives you precision gain while keeping the finite sample coverage close to what we expect >.

Warren: That’s a concrete number we can actually use to decide how many matchings to run, which is way better than just saying "choose B appropriately" >.

Iris: I just want to mention that the paper flags that if you choose B much larger than N, the matching estimator converges at the same rate as the full array variance, so there’s a trade-off there >.

Ruth: So, we get this uniform asymptotic exact inference for two-way clustered data by using this studentized matching estimator with carefully chosen repeated matchings >.

Warren: It's a solid method for estimation when you have that kind of complex dependence structure but don't want to rely on the full array mean being perfectly Gaussian >.

Iris: It’s a useful tool for identification because it gives us uniform coverage even when the underlying moment components behave differently >.

Ruth: That's it for this paper, "Uniform Inference for Two-Way Clustered Data," which gives us a more robust way to estimate population means >.

Warren: Next up, we’re looking at how those spillover effects play out when you have interference in comparison group methods >.

Ulrich Hounyo, Jiahao Lin, Xiaojun Song, Hansheng Wang

University at Albany-State University of New York · Fuyao University of Science and Technology · Peking University

econ.EM

Submitted: 2026-11-12

Updated: 2026-11-12

License: http://creativecommons.org/publicdomain/zero/1.0/

Importance score: 96/100

The gist: Uniform inference for two-way clustered data establishes uniformly asymptotically exact inference for the population mean of two-way clustered data…

Key concepts

Two-way Clustering
This technique is used in economics to model dependence among observations that share a cluster in two dimensions (e.g., rows and columns). It helps account for complex dependencies that standard methods might miss when analyzing data structured in a grid.
Matching Estimator
Instead of one full-array mean, this estimator averages means obtained from repeated random matchings. Each matching pairs observations such that no two selected observations share the same row or column, effectively creating independent samples for averaging.
Uniform Asymptotic Exact Inference
This means the statistical inference (like confidence intervals) holds consistently and uniformly across different data-generating processes. It ensures that the estimator's limiting distribution is always Gaussian, even when interactions create non-Gaussian limits in other estimation methods.

Terminology

Summary

Uniform inference for two-way clustered data establishes uniformly asymptotically exact inference for the population mean of two-way clustered data, allowing the data-generating process to vary with sample size The studentized matching estimator admits a uniform standard normal approximation whenever the number of matchings is fixed or grows at any rate slower than the smaller cluster count

The Problem and Proposed Solution

Two-way clustering is widely used in empirical economics to account for dependence among observations that share a cluster in either of two dimensions When row or column effects dominate, the normalized full-array mean typically has a Gaussian limit, but interactions between rows and columns can produce a non-Gaussian limit Menzel (2021, Proposition 4.1) shows that the limiting law of the normalized full-array mean cannot be estimated uniformly consistently over such sequences The authors approach this inference problem by constructing a different estimator of the same population mean, for which Gaussian critical values are uniformly valid Their estimator averages the means obtained from repeated random matchings

Characterization of the Matching Estimator

The authors make four contributions to their work First, they characterize the limiting distribution of the matching estimator as the number of matchings varies Second, they provide a closed-form variance estimator that makes the confidence interval straightforward to compute Third, they establish uniformly asymptotically exact inference for the population mean under their moment conditions Fourth, they extend the procedure to smooth functions of generalized method of moments (GMM) parameters

Precision and Trade-offs in Matching

The choice of how many matchings to use matters because averaging too many can cause the estimator to inherit the non-Gaussian limit of the full-array mean Proposition 2 shows that for every N ≤ T and B ≥ 1, E[bθNT,B] = θNT and VNT,B:= Var(bθNT,B) = VNT,F full-array variance + VNT,1 − VNT,F B matching variance The choice of B also determines precision In the degenerate and intermediate cases (νNT → c < 1), choosing B = o(N) makes the full-array variance share wNT,B vanish, so the standardized matching estimator has a standard normal limit

Uniform Coverage and Variance Estimation

Theorem 1 establishes uniform Gaussian inference for deterministic B = o(N) under moment bounds The resulting confidence interval is INT,B(1 − α) = bθNT,B − z1−α/2 qbVNT,B,bθNT,B + z1−α/2 qbVNT,B The variance estimator bVNT,B is positive semidefinite by construction in every sample

Extension to GMM Parameters

The authors extend the results to smooth functions of GMM parameters, including regression coefficients They show that the same restriction on the number of matchings makes this term negligible relative to the standard error of the target Theorem 2 confirms uniform Gaussian inference for GMM parameters when B = o(N)

Conclusion and Practical Recommendations

A single matching produces an i.i.d. sample because every selected observation has a different row index and a different column index Repeated matching recovers much of the precision of the full array The authors recommend B = ⌊N/3⌋ as a default choice for repeated matching because it delivers a substantial gain in precision over one matching while keeping finite-sample coverage close to nominal When shorter intervals are the priority, B = ⌊N/log N⌋ is a reasonable choice with the trade-off of more conservative coverage in the independent and product designs

References

Aldous, D. J., Representations for partially exchangeable arrays of random variables

Bentkus, V. and F. Götze (1996), The Berry–Esseen bound for Student’s statistic

Cameron, A. C., J. B. Gelbach, and D. L. Miller (2011), Robust inference with multiway clustering

Chen, K., and T. J. Vogelsang (2024), Fixed-b asymptotics for panel models with two-way clustering

Chen, L. H. Y., and X. Fang (2015), On the error bound in a combinatorial central limit theorem

Chiang, H. D., B. E. Hansen, and Y. Sasaki (2024), Standard Errors for Two-Way Clustering with Serially Correlated Time Effects

Chiang, H. D., K. Kato, and Y. p. 3

Where the paper says it

We select intersections by repeated matching and establish asymptotically exact coverage uniformly over laws in which row and column effects may weaken or vanish as the sample size grows. The role of the number of sampled terms in determining the limiting distribution also arises in the theory of incomplete U-statistics (Janson, 1984; Chen and Kato, 2019).

Sasaki (2023), Inference for high-dimensional exchangeable arrays

Chiang, H. D., J. Li, and Y. Sasaki (2025), Algorithmic subsampling under multiway clustering

Davezies, L., X. D’Haultfœuille, and Y. Guyonvarch (2021), Empirical process results for exchangeable arrays

Davezies, L., X. D’Haultfœuille, and Y. Guyonvarch (2025), Analytic inference with two-way clustering

Graham, B. S., F. Niu, and J. L. Powell (2024), Kernel density estimation for undirected dyadic data

Hansen, L. P., Large sample properties of generalized method of moments estimators

Hoover, D. N., Relations on probability spaces and arrays of random variables

Hounyo, U., and J. Lin (2026a), Jackknife variance estimators for two-way clustering with serially correlated time effects

Hounyo, U., and J. Lin (2026b), Wild bootstrap inference with multiway clustering and serially correlated time effects

Janson, S., The asymptotic distributions of incomplete U-statistics

Jochmans, K., Two-way clustering with non-exchangeable data

Juodis, A., This shock is different: Estimation and inference in misspecified two-way fixed effects panel regressions

Kallenberg, O., On the representation theorem for exchangeable arrays

MacKinnon, J. G., M. Ø. Nielsen, and M. D. Webb (2021), Wild bootstrap and asymptotic inference with multiway clustering

Menzel, K., Bootstrap with cluster-dependence in two or more dimensions

Page 3

Two-way clustering is widely used in empirical economics to account for dependence among observations that share a cluster in either of two dimensions When row or column effects dominate, the normalized full-array mean typically has a Gaussian limit As these effects weaken, interactions between rows and columns can produce a non-Gaussian limit Menzel (2021, Proposition 4.1) shows that the limiting law of the normalized full-array mean cannot be estimated uniformly consistently over such sequences

Page 4

The authors approach this inference problem by constructing a different estimator of the same population mean, for which Gaussian critical values are uniformly valid Our estimator averages the means obtained from repeated random matchings Taking the dimension with fewer clusters as the rows, each matching assigns a distinct column to every row, uniformly at random and independently of the data No two selected observations share a row or a column

Page 5

The marginal mean is θNT = E[YNT,it], and the marginal variance satisfies σ 2 NT = Var(YNT,it) ∈ (0, ∞) By (3), the row and column projections account for the following share of the variance of the full-array mean

Page 7

The next section uses random matching to estimate the same θNT with a studentized statistic that admits a uniform Gaussian approximation Conditional on the observed array, their means are independent and centered at the full-array mean

Page 9

The error of the matching estimator therefore separates into two terms, bθNT,B − θNT = (Y¯NT − θNT) + 1/B X B b=1 (MNT,b − Y¯NT) Under the conditions below, this error contributes a Gaussian term whenever it enters the limit

Proposition 2 (Variance of repeated matching). For every N ≤ T and B ≥ 1, E[bθNT,B] = θNT and VNT,B:= Var(bθNT,B) = VNT,F full-array variance + VNT,1 − VNT,F B matching variance

By (9), the full-array share of the total variance is wNT,B = VNT,F / VNT,B = B/B + (N − 1)(1 − νNT)

Suppose the marginal fourth-moment bound of Proposition 3 holds. In the degenerate and intermediate cases (νNT → c < 1), choosing B = o(N) makes the full-array variance share wNT,B vanish, so the standardized matching estimator has a standard normal limit

If B/N → λ ∈ (0, ∞], the full-array error retains a positive share of the variance and can contribute a non-Gaussian component to the limit

The choice of B also determines precision In the degenerate and intermediate cases, (10) gives VNT,B ≍ σ squared NT / NB + 1/N squared When σNT → σ ∈ (0, ∞), the convergence rate is √NB for B = o(N)

At B = N, the matching estimator attains the full-array rate N, although VNT,B/VNT,F → 2 − c Increasing B further can still reduce the variance: if B/N → ∞, then VNT,B/VNT,F → 1 with no further gain in the convergence rate

Example 1: Pure product model.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Uniform inference for two-way clustered data allows AI systems to estimate population means using a studentized matching estimator that admits a uniform standard normal approximation across varying dependence regimes, even when the limiting law of the full-array mean cannot be estimated uniformly consistently.

  2. The system can utilize a closed-form variance estimator that is positive semidefinite in every sample, making confidence interval implementation straightforward without needing a bootstrap or preliminary test of the dependence regime.

  3. The AI system can perform inference on smooth functions of Generalized Method of Moments parameters, allowing different moment components to exhibit different dependence regimes while still achieving uniform asymptotic exact coverage.

  4. The system can generate confidence intervals using repeated matching estimators with a fixed number of matchings B, where the variance is decomposed into a full-array variance share and a matching variance term that can be controlled by choosing B relative to N and T.

  5. For regression coefficient estimation in GMM frameworks, the AI system can use the same methodology to ensure uniform asymptotic exact inference even when different moment components follow different dependence regimes, as demonstrated by the quadratic term being negligible under certain matching conditions.

Abstract

We establish uniformly asymptotically exact inference for the population mean of two-way clustered data, allowing the data-generating process to vary with sample size. This finding does not contradict the well-known impossibility result of Menzel (2021), which places a fundamental limit on uniform estimation of the asymptotic distribution of the normalized full-array mean. We estimate the same population mean by averaging the sample means from random matchings. A closed-form standard error makes the resulting confidence interval straightforward to implement. The variance estimator is positive semidefinite and the studentized matching estimator is uniformly asymptotically standard normal. The cost of uniform validity is a slower convergence rate under degeneracy. We extend the result to smooth functions of GMM parameters, allowing the different moment components to exhibit different dependence regimes. In simulations, the proposed confidence intervals achieve coverage close to the nominal level across the dependence regimes considered.

Sources

Related papers