Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.
37,390 characters · 5 sections · 43 citation commands
Gaussian Approximation for Maximum Score and Non-Smooth M-Estimators with Multiway Dependence
The maximum score estimator of manski1975maximum offers a robust and conceptually elegant method for estimating parametric coefficients in binary response models under minimal assumptions. In contrast to conventional parametric approaches, such as maximum likelihood estimation, it does not require specification of the error distribution or independence between covariates and unobservables, relying instead solely on the ordinal information encoded in the sign of the latent index. This distribution-free feature renders the estimator particularly attractive from a theoretical standpoint, as it is robust to misspecification of the disturbance term and remains valid in settings where standard parametric assumptions are untenable.
Despite these appealing properties, the estimator exhibits fundamentally non-standard asymptotic behaviour under i.i.d.\ sampling. In a seminal contribution, kim1990cube show that the maximum score estimator converges at the cube-root rate $n^{1/3}$, rather than the usual parametric rate, and possesses a non-Gaussian Chernoff-type limiting distribution characterised by the argmax of a stochastic process. This irregular asymptotic structure arises from the non-smooth, discontinuous nature of the objective function, which invalidates the classical central limit theory and the standard bootstrap is known to fail abrevaya2005bootstrap. These features pose substantial challenges for statistical inference. In particular, the absence of asymptotic normality complicates the construction of confidence intervals and hypothesis tests, while the slower convergence rate implies reduced precision in finite samples. As a consequence, practical implementation often requires nonstandard inference procedures tailored to cube-root asymptotics-- see, for example, delgado2001subsampling,patra2018consistent,cattaneo2020bootstrap--which further limits the estimator’s accessibility and widespread empirical use.
In this paper, we show that, under multiway dependence (also known as multiway clustering)—a complex dependence structure commonly encountered in empirical research miglioretti2007marginal,petersen2008estimating,cameron2011robust,thompson2011simple,cameron2015practitioner,mackinnon2023cluster—the original maximum score estimator of manski1975maximum attains asymptotic normality with a parametric convergence rate. This finding stands in sharp contrast to the classical i.i.d.\ setting and suggests that, in this context, dependence can be beneficial rather than detrimental for inference.
Our maximum score results are built upon a general asymptotic theory for non-smooth M-estimators under multiway dependence, which may be of independent interest. A substantial body of work has developed asymptotic theory under multiway dependence; see, for example, menzel2021bootstrap, 2021daveziesEmpiricalProcessResults,davezies2025analytic, chiang2023inference, and graham2024sparse. Despite these advances, a general asymptotic framework for $M$-estimators—whether based on smooth or non-smooth objective functions—remains largely unexplored in this setting. The present paper contributes to this literature by developing a unified theory for $M$-estimation under multiway dependence, thereby filling this gap.
Despite asymptotic normality (equivalently, asymptotic Gaussianity), analytical inference is challenging because the asymptotic variance depends on derivatives of smooth population objects. These derivatives are difficult to estimate because their sample counterparts are non-smooth and do not provide direct analogues. We circumvent these challenges by proposing a procedure based on a multiplier bootstrap. Building upon our Gaussian approximation theory for M-estimators, this approach provides a robust and practical framework for implementation.
The intuition behind our Gaussian approximation result is related to the asymptotic theory for $U$-process-based estimators, such as simplicial depth liu1990notion and Oja's spatial medians oja1983descriptive, established in arcones1994estimators, as well as the notion of data-generating-process (DGP)–induced smoothing studied in panel quantile regression with common shocks by chiang2026panel. However, the present setting is substantially more complex. Unlike the convex and subgradient-friendly quantile check loss, the maximum score objective is inherently discontinuous, which renders standard arguments inapplicable. In particular, even when a smooth approximation exists, it is non-trivial to show that the maximiser of the original objective is well approximated by that of the smoothed problem. Addressing this issue requires a careful quadratic approximation argument, drawing on $U$-process M-estimation ideas and the stochastic differentiability framework of pollard1985new. A further complication arises in establishing stochastic equicontinuity for higher-order projections. In the classical $U$-process settings of arcones1994estimators, such results rely on weak convergence for degenerate processes arcones1993limit, which is not available under multiway dependence. To overcome this, we develop an alternative approach combining localised empirical process methods with an iterated argument that first delivers a preliminary rate and then sharpens it, using maximal inequalities to control the resulting entropy integrals chen2026cross.
Building on these ingredients, we establish a general asymptotic theory for non-smooth M-estimators under multiway dependence. By carefully localising the effect of DGP-induced smoothing, we control the discrepancy between the original objective and its smooth approximation, which in turn yields asymptotic linearity, a Gaussian approximation, and a valid bootstrap procedure for the maximum score estimator at the parametric rate.
A number of approaches have been proposed to address the non-Gaussian limiting distribution of the maximum score estimator and the attendant challenges for statistical inference. In a seminal contribution, horowitz1992smoothed proposes the smoothed maximum score estimator, whereby the discontinuous indicator function in the objective is replaced with a smooth kernel approximation. This modification renders the objective function differentiable and delivers asymptotic normality under i.i.d.\ sampling, albeit at a nonparametric rate determined by the bandwidth choice. While this restores inferential tractability, it introduces an additional tuning parameter and entails smoothing bias, both of which require careful calibration in practice. More recently, chen2025relu extend this line of work by employing the ReLU functions to encode the sign alignment restrictions, obtaining asymptotic normality at a nonparametric rate faster than $n^{-1/3}$, though similar issues concerning tuning and approximation bias persist. An alternative strand of the literature exploits the maximum rank correlation approach. For example, lee1999root considers a two-period panel model and show that, following an appropriate pairwise differencing transformation, the estimation problem can be recast as a maximum rank correlation estimator of the type analysed by sherman1993limiting. This reformulation allows them to establish asymptotic normality under suitable regularity conditions. Closely related is honore2000panel, which studies a conditional maximum score estimator for panel data and similarly relies on smoothing. Nevertheless, all the aforementioned modifications alter the original estimator. For Manski's maximum score estimator, Gaussian asymptotics remain unavailable, and the inherent non-standard behaviour continues to pose a fundamental challenge for inference. Our contribution demonstrates that the unmodified maximum score estimator of manski1975maximum can, in fact, be asymptotically Gaussian under conditions of complex multiway dependence.
Let $\mathbb{N}$ denote the set of positive integers and $\mathbb{R}$ denote the real line. For $a,b\in \mathbb{R}$, let $a\vee b=\max\{a,b\}$ and $a\wedge b = \min\{a,b\}$. Throughout the paper, the asymptotics are taken with respect to $n\to\infty$ for $n$ that will be defined in (ref). For vectors $\bm{a},\bm{b}\in\mathbb{R}^K$, write $\bm{a}\le\bm{b}$ for coordinate-wise inequality. \(\|\cdot\|\) is the Euclidean norm unless otherwise specified. Henceforth, $\leadsto$ denotes weak convergence and $\overset{\mathrm{p}}{\to}$ denotes convergence in probability.
In this section, we study the asymptotic properties of the maximum score estimator under multiway dependence.
Let \(K \in \mathbb{N}\), \({\bm{N}} = \left( N_{1}, \dots, N_{K} \right) \in \mathbb{N}^{K}\) and \(n = \min \left\{ N_{1}, \dots, N_{K} \right\}\). Each \(N_{k}\) is the sample size in dimension \(k\). Let \(I_{{\bm{N}}} = \prod_{k = 1}^{K} \left\{ 1, \dots, N_{k} \right\}\) be the set of $K$-dimensional indices. The econometrician observes the data \(\mathcal{D}_{{\bm{N}}} = \left\{ W_{{\bm{i}}} \right\}_{{\bm{i}} \in I_{{\bm{N}}}} = \left\{ \left( Y_{{\bm{i}}}, X_{{\bm{i}}}^{\prime} \right)^{\prime} \right\}_{{\bm{i}} \in I_{{\bm{N}}}}\), where \(Y_{{\bm{i}}}\) is a binary outcome with values in \(\{- 1, 1\}\) and \(X_{{\bm{i}}}\) is a \(d\)-dimensional vector of covariates. Let \(\mathbb{\mathbb E}_{{\bm{N}}}\) denote sample averaging over \(\mathcal{D}_{{\bm{N}}}\), so that \(\mathbb{\mathbb E}_{{\bm{N}}} [f (W)] = \left| I_{{\bm{N}}} \right|^{-1} \sum_{{\bm{i}} \in {\mathcal{I}}_{{\bm{N}}}} f \left( W_{{\bm{i}}} \right)\). Denote the surface of the unit sphere by \(\mathbbm{S}^{d - 1} = \left\{ v : \|v\| = 1 \right\}\) and \(\mathcal{B} \subseteq \mathbbm{S}^{d - 1}\). The maximum score estimator solves
For each $k=1,\dots,K$, define \( \mathcal{E}_k=\{{\bm{e}}\in\{0,1\}^K:\|{\bm{e}}\|_0=k\}, \) so that $\{0,1\}^K=\bigcup_{k=0}^K\mathcal{E}_k$ and let ${\bm{e}}_k$ denote the $k$-th unit vector. In other words, $\mathcal{E}_1=\{{\bm{e}}_k:k=1,...,K\}$ and $\mathcal{E}_2=\{{\bm{e}}=(e_1,...,e_K)\in \{0,1\}^K: \sum_{k=1}^K e_k=2\}$.
We impose the following standard assumption for multiway dependence, which is also used in menzel2021bootstrap and 2021daveziesEmpiricalProcessResults,davezies2025analytic, among others.
Under (ref), the \(W_{{\bm{i}}}\)'s are typically not mutually independent, but identically distributed. Let \(W = (Y, X^{\prime})^{\prime}\) denote a random variable distributed according to the common marginal distribution of \(W_{{\bm{i}}}\), and denote
We impose the following modelling and regularity conditions on the joint distributions of $(Y,X')$.
Lower-level sufficient conditions for (ref) (ref) and (ref) are well known in the literature. For example 1985manskiSemiparametricAnalysisDiscrete assumes an index restriction coupled with a special regressor. In particular, Assumption 2 of 1985manskiSemiparametricAnalysisDiscrete requires there to exist an index \(l \in \{1, \dots, k\}\) such that \(\beta_{0, l} \neq 0\) and the corresponding regressor, \(X [l]\), is assumed to have full support on \(\mathbb{R}\) (almost surely) conditional on the other regressors. In proving consistency, Theorem 1 of 1985manskiSemiparametricAnalysisDiscrete further restricts the effective parameter space to be \(\mathcal{B} = \left\{ b \in \mathbbm{S}^{d - 1} : \left| b_{l} \right| \geq \eta \right\}\), for some \(0 < \eta < \beta_{0, l}\). Together with some additional regularity conditions, these all imply (ref) (ref) and (ref). Whilst the assumptions of 1985manskiSemiparametricAnalysisDiscrete allow for some discrete (or constant) regressors, kim1990cube directly assume absolute continuity of \(X\) with respect to Lebesgue measure with a differentiable density, and further assume that \(X / \|X\|\) has a density with respect to surface measure on the sphere. These imply (ref) (ref) with \(\mathcal{B} = \mathbbm{S}^{d - 1}\).
The following results provides consistency of the maximum score estimator under multiway dependence.
We now consider asymptotic Gaussianity. Consistency of \(\widehat{\beta}_{{\bm{N}}}\) allows us to focus on values of \(\beta \in \mathcal{B}\) close to \(\beta_{0}\). The following local parameter space will be particularly useful for our purpose:
\(\mathcal{B}_{0}\) admits a smooth parametrisation by \(\Theta = \left\{ \theta \in \mathbb{R}^{d - 1} : \|\theta\| \leq 1 \right\}\). Let \(B_{0}\) be an orthonormal \(d \times (d - 1)\) basis matrix for the subspace \(\{\beta : \beta^{\prime} \beta_{0} = 0\}\), i.e. \(B_{0}^{\prime} B_{0} = \mathbb{I}_{d - 1}\), the $(d-1)$-dimensional identity matrix, and \(\beta_{0}^{\prime} B_{0}\) is the \((d - 1)\)-dimensional zero vector. Define
The parametrisation in (ref) is a diffeomorphism from \(\Theta\) to \(\mathcal{B}_{0}\) and satisfies \(\beta_{0} = \beta (0)\), \(\|\beta (\theta)\| = 1\) for every \(\theta\), and \(\beta_{0}^{\prime} \beta (\theta) = \sqrt{1 - \|\theta\|^{2}}\). Thus as an added bonus, \(\beta_{0}\) is “interior” since it is identified with \(\theta = 0 \in \mathrm{int} (\Theta)\). Finally, let
Then \(\widehat{\theta}_{{\bm{N}}} \overset{\mathrm{p}}{\to} 0\) by \(\widehat{\beta}_{{\bm{N}}} \overset{\mathrm{p}}{\to} \beta_{0}\). It can be shown that
Hence, \(\widehat{\beta}_{{\bm{N}}} = \beta \left( \widehat{\theta}_{{\bm{N}}} \right)\) on the event \(\left\{ \widehat{\beta}_{{\bm{N}}} \in \mathcal{B}_{0} \right\}\).
We further impose the following regularity conditions on the joint distributions of $Y$, $X$, and the latent shocks $(U_{{\bm{e}}'})_{{\bm{e}}'\le {\bm{e}}}$ arising from (ref), for a collection of indices ${\bm{e}}\in \mathcal{E}_1 \cup \mathcal{E}_2$ that will be specified below. Notably, these assumptions do not impose topological structure on the latent shocks.
The approximate maximiser condition at rate $n^{-1}$ is mild and can be ensured by the econometrician during numerical optimisation. Condition (ref) imposes regularity on the conditional distribution of the covariates by requiring absolute continuity of \(X \mid \mathcal{U}_{\bm{e}}\) and continuous differentiability of the associated density \(p_{\bm{e}}(x \mid \bm{u}_{\bm{e}})\) in \(x\), which ensures the absence of point masses and enables local smooth approximations of the population objective. Condition (ref) complements this by requiring that the conditional regression function \(m_{0,\bm{e}}(x,\bm{u}_{\bm{e}})\) is continuously differentiable in \(x\), with the derivative \(\dot{m}_{0,\bm{e}}(x,\bm{u}_{\bm{e}})\) characterising the local curvature of the population objective. Condition (ref) introduces a square-integrable envelope \(m_\ast(x,\bm{u}_{\bm{e}})\) that uniformly dominates the density, regression function, and its derivative, thereby ensuring the validity of dominated convergence arguments. Finally, Assumption (ref) imposes a strong median identification condition: the normalisation \(m_{0,{\bm{e}}_k}(x,u)=0\) when \(x'\beta_0=0\) centres the decision boundary, while strict monotonicity of \(t \mapsto m_{0,{\bm{e}}_k}(x+t\beta_0,u)\) guarantees a unique sign change across the hyperplane \(x'\beta_0=0\), ruling out flat regions and ensuring point identification together with the local curvature required for quadratic expansion.
The following result establishes asymptotic distributional theory for the maximum score estimator under the local parametrisation (ref).
The proof proceeds by verifying the conditions of (ref) in (ref) for the maximum score estimator. In particular, establishing stochastic differentiability and local stochastic equicontinuity is highly non-trivial. The former draws on analytic techniques for maximum score developed in kim1990cube, while the latter relies on a localisation argument for empirical processes based on a local maximal inequality established in chen2026cross.
An inspection of the proof of (ref) reveals that the asymptotic variance possesses a complex structure and depends on various unknown quantities; consequently, obtaining a consistent variance estimator is challenging. Fortunately, the bootstrap procedure described in (ref) of (ref) provides a simple and valid framework for statistical inference regarding the maximum score estimator under multiway dependence. This validity is guaranteed as the assumptions of (ref) sufficiently satisfy all underlying requirements.
In this section, we develop a general asymptotic theory for non-smooth M-estimators under multiway dependence as well as a bootstrap procedure for statistical inference.
Let $\mathcal{F}=\{f_\theta:\mathcal{S}\to \mathbb{R}:\theta\in \Theta\subset\mathbb{R}^d,\; \mathbb{\mathbb E}|f_\theta (W)|<\infty\}$, where $\Theta$ contains a neighbourhood of the origin and $\theta\mapsto f_\theta $ may be non-smooth. We define the population objective function for the M-estimation problem by \( Q(\theta)=\mathbb{\mathbb E}[f_\theta(W)], \; \theta\in\Theta, \) and, without loss of generality, normalise the true parameter to $\theta_0$ to the origin. Suppose we observe random variables \( \mathcal D_{\bm{N}}=\{ W_{\bm{i}} :{\bm{i}} \in I_{\bm{N}} \}, \) an estimator based on $\mathcal D_{\bm{N}}$ can now be defined as
or more generally
Before stating our assumptions, let us introduce the Hoeffding-type decomposition hoeffding1948class,chiang2023inference for multiway dependence. For an $f:\mathcal{S}\to \mathbb{R}$ with $\mathbb{\mathbb E} [f(W_{\bm{i}})]=0$\footnote{Otherwise one may replace $ f$ with $\widetilde f(W_{\bm{i}})=f(W_{\bm{i}})-\mathbb{\mathbb E}[f(W_{\bm{i}})]$.} and any $\bm{i}\in I_{\bm{N}}$, define the conditional expectation \[ (P_{\bm{e}}f)(\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}) =\mathbb{E}\!\left[f(W_{\bm{i}})\mid\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}\right]. \] The orthogonal projections $\pi_{\bm{e}}$ are then defined recursively: for ${\bm{e}}_k\in \mathcal{E}_1$, \[ (\pi_{\bm{e}_k}f)(U_{\bm{i}\odot \bm{e}_k}) =(P_{\bm{e}_k}f)(U_{\bm{i}\odot \bm{e}_k}), \] and for $\bm{e}\in\cup_{k=2}^K\mathcal{E}_k$, \[ (\pi_{\bm{e}}f)\bigl(\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}\bigr) =(P_{\bm{e}}f)\bigl(\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}\bigr) -\sum_{\bm{e}'\le \bm{e},\, \bm{e}'\neq \bm{e}} (\pi_{\bm{e}'}f)\bigl(\{U_{\bm{i}\odot \bm{e}''}\}_{\bm{e}''\le \bm{e}'}\bigr). \] Following Lemma 1 in chiang2023inference, for any \(\ell\in \mathrm{supp}(\bm{e})\)\footnote{That is, $\mathrm{supp}({\bm{e}}) = \{ j=1,\dots,K : e_j \ne 0\}$.} the random variable \( (\pi_{\bm{e}}f)\bigl(\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}\bigr) \) is centred conditionally on \( \{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}-\bm{e}_{\ell}}. \) Define \( I_{\bm{N},\bm{e}} = \{\bm{i}\odot \bm{e} : \bm{i}\in I_{\bm{N}}\}, \) so that \( |I_{\bm{N},\bm{e}}| = \prod_{k'\in\mathrm{supp}(\bm{e})} N_{k'}. \) Accordingly, define the ${\bm{e}}$-specific Hoeffding-type projection by \[ H_{\bm{N}}^{\bm{e}}(f) =\frac{1}{|I_{\bm{N},\bm{e}}|} \sum_{\bm{i}\in I_{\bm{N},\bm{e}}} (\pi_{\bm{e}}f)\bigl(\{U_{\bm{i}\odot \bm{e}'}\}_{\bm{e}'\le \bm{e}}\bigr). \] We then obtain the Hoeffding-type decomposition
We impose the following conditions for asymptotic theory of general non-smooth M-estimators.
Assumption (ref) (i) imposes a standard identification condition, together with a quadratic expansion of the population objective, and normalises the unique maximiser to the origin. Part (ii) requires the existence and consistency of an estimator $\widehat\theta_{{\bm{N}}}$, which can typically be established using conventional M-estimation arguments; see Section 2 of newey1994large. Part (iii) imposes a mild stochastic differentiability condition on the first-order projections. Importantly, it accommodates a broad class of non-smooth objective functions; see pollard1985new for details and sufficient conditions. Finally, part (iv) imposes a local stochastic equicontinuity condition on the localised second-order projections of the objective function, which can typically be verified using an appropriate maximal inequality. This requirement is weaker than the comparable stochastic equicontinuity condition employed in $U$-process results, such as Theorem 1 of arcones1994estimators, as it only requires (ref) to hold for $\delta_n = O(n^{-1/2})$, rather than for all sequences $\delta_n \to 0$.
The following provides asymptotic theory for general non-smooth M-estimators with multiway dependence.
Note that the variance can be zero -- in this case, the limiting Gaussian distribution degenerates at zero.
Our proof strategy differs from existing approaches, such as arcones1994estimators, in that we do not rely on stochastic equicontinuity. In the present multiway setting, an analogue of the weak convergence result for degenerate $U$-processes (cf.\ Corollary 5.7 of arcones1993limit) is not available, and hence the higher-order projection terms must be controlled by alternative means. To this end, we adopt an approach combining localised empirical process methods with an iterated argument that first delivers an \(O_P(n^{-1})\) rate for the higher-order projection terms and then sharpens it to \(o_P(n^{-1})\), using Condition (ref).
In non-smooth M-estimation problems, estimation of the asymptotic variance is typically challenging. The components $\Delta_k$ and $H$ involve unknown derivatives of population objects and, because of the lack of smoothness of $\theta\mapsto f_\theta$, generally do not possess obvious feasible sample counterparts. Consequently, direct variance estimation is challenging. Fortunately, the linear representation and Gaussian approximation established in Theorem (ref) enable us to conduct inference via a bootstrap procedure. The next theorem states this result.
The restrictions imposed on the weights $\xi^k$ are met, for instance, when $\xi^k$ is drawn from either an $\text{Exponential}(1)$ or a $\text{Poisson}(1)$ distribution. This bootstrap is closely related to the pigeonhole bootstrap considered by owen2007pigeonhole and 2021daveziesEmpiricalProcessResults. Unlike the pigeonhole bootstrap, which relies on multinomial weights, the proposed method assigns i.i.d. weights to each $k$.
The proof proceeds by introducing an alternative Hoeffding-type decomposition for the bootstrapped process on an expanded probability space that incorporates the bootstrap weights. We employ i.i.d.\ weights for each $k$, which is convenient for deriving this decomposition. We then show that the bootstrap estimator admits an analogous unconditional asymptotic linear representation with the corresponding multiplicative i.i.d.\ weights, a property that underpins the validity of our bootstrap procedure and may be of independent interest.
In summary, this paper develops a unified asymptotic framework for non-smooth M-estimators under multiway dependence and applies it to the maximum score estimator, establishing asymptotic Gaussianity at the parametric rate together with a valid bootstrap procedure. These results highlight that complex dependence structures can fundamentally alter the inferential properties of non-smooth estimators, rendering standard difficulties under i.i.d. settings tractable in this context.