Recognition: unknown
Root-n Asymptotically Normal Maximum Score Estimation
Pith reviewed 2026-05-10 12:27 UTC · model grok-4.3
The pith
Under primitive conditions, strictly concave surrogate scores turn maximum score estimation into a root-n normal procedure.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Strictly concave surrogate score functions can be used to construct a smooth criterion function that identifies the parameters in binary choice models and delivers root-n asymptotic normality, with the necessary conditions characterized in primitive terms on the data generating process.
What carries the argument
Strictly concave surrogate score functions that replace the indicator-based maximum score criterion to create a differentiable objective function.
If this is right
- The estimator converges at the parametric root-n rate instead of the slower cube-root rate of the original maximum score estimator.
- The limiting distribution is normal, so conventional standard errors and Wald tests are asymptotically valid.
- The identification and smoothness properties hold under conditions stated directly in terms of the joint distribution of covariates and errors.
- Monte Carlo experiments confirm that the asymptotic results translate to reliable finite-sample behavior.
Where Pith is reading between the lines
- The method could be extended to other models with discontinuous objective functions, such as quantile regression at non-differentiable points, by designing analogous concave surrogates.
- Practitioners facing large datasets may prefer this smoothed version for faster computation while retaining the robustness properties of maximum score.
- Future work could examine whether data-driven selection of the surrogate function preserves the root-n normality result.
Load-bearing premise
The chosen surrogate functions must be strictly concave and produce a criterion smooth enough for standard asymptotic arguments to yield root-n normality.
What would settle it
A data generating process satisfying the paper's primitive conditions yet producing an estimator whose convergence rate is slower than root-n or whose limiting distribution is non-normal would falsify the central claim.
Figures
read the original abstract
The maximum score method (Manski, 1975, 1985) is a powerful approach for binary choice models, yet it is known to face both practical and theoretical challenges. In particular, the estimator converges at a slower-than-root-$n$ rate to a nonstandard limiting distribution. We investigate conditions under which strictly concave surrogate score functions can be employed to achieve identification through a smooth criterion function. This criterion enables root-$n$ convergence to a normal limiting distribution. While the conditions to guarantee these desired properties are nontrivial, we characterize them in terms of primitive conditions. Extensive simulation studies support, the root-$n$ convergence rate, the asymptotic normality, and the validity of the standard inference methods.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims that strictly concave surrogate score functions can replace the discontinuous indicator in Manski's maximum score estimator for binary choice models. Under primitive conditions ensuring the resulting population criterion is smooth, strictly concave, and uniquely maximized at the true parameter with non-singular Hessian, the estimator attains root-n consistency and asymptotic normality via standard M-estimation arguments. Simulations are used to corroborate the rate, normality, and validity of conventional inference.
Significance. If the primitive conditions hold in practice, the approach addresses a longstanding limitation of the maximum score estimator by delivering root-n rates and standard asymptotics without abandoning its semiparametric robustness. The explicit characterization of the required conditions in primitive terms, rather than high-level assumptions, is a clear strength, as is the simulation evidence that directly checks the claimed rate and normality under designs satisfying those primitives.
minor comments (3)
- Introduction: the motivation section would benefit from a brief comparison to existing smoothed maximum-score estimators (e.g., those based on kernel or logistic smoothing) to clarify the distinct role of the strictly concave surrogate.
- §4, Assumption 4.2: while the non-singularity of the Hessian is stated, a short remark on how this condition can be checked for common covariate distributions would aid applicability.
- Section 5: the simulation tables should report the exact number of Monte Carlo replications and the precise functional forms of the surrogates employed, to facilitate exact reproduction.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript, accurate summary of the contribution, and recommendation for minor revision. We are pleased that the referee highlights the value of the primitive conditions and simulation evidence.
Circularity Check
No significant circularity in derivation chain
full rationale
The paper derives primitive conditions under which a strictly concave surrogate produces a smooth population criterion with a unique interior maximum and nonsingular Hessian at the target parameter. Root-n asymptotic normality is then obtained by applying standard M-estimator theorems to this criterion. No equation or claim reduces by construction to a fitted input, self-definition, or self-citation chain; the limiting distribution is imported from external asymptotic theory once the stated primitives hold. Simulations are used only for corroboration, not as load-bearing evidence for the main result.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
Abrevaya, J. and J. Huang (2005, July). On the bootstrap of the maximum score estimator. Econometrica\/ 73\/ (4), 1175--1204
2005
-
[2]
Ghysels, and X
Babii, A., E. Ghysels, and X. Chen (2020). Binary choice with asymmetric loss in a data-rich environment: Theory and an application to racial justice
2020
-
[3]
Bartlett, P. L., M. I. Jordan, and J. D. McAuliffe (2006). Convexity, classification, and risk bounds. Journal of the American Statistical Association\/ 101\/ (473), 138--156
2006
-
[4]
Bickel, P. J., F. G \"o tze, and W. R. van Zwet (2011). Resampling fewer than n observations: gains, losses, and remedies for losses. In Selected works of Willem van Zwet , pp.\ 267--297. Springer
2011
-
[5]
Cattaneo, M. D., G. F. Cox, M. Jansson, and K. Nagasawa (2026). Continuity of the distribution function of the arg max of a gaussian process. Econometrica\/
2026
-
[6]
Cattaneo, M. D., M. Jansson, and K. Nagasawa (2020). Bootstrap-based inference for cube root asymptotics. Econometrica\/ 88\/ (5), 2203--2219
2020
-
[7]
Cattaneo, M. D., M. Jansson, and K. Nagasawa (2024). Bootstrap-assisted inference for generalized grenander-type estimators. The Annals of Statistics\/ 52\/ (4), 1509--1533
2024
- [8]
- [9]
-
[10]
Delgado, M. A., J. M. Rodr guez-Poo, and M. Wolf (2001). Subsampling inference in cube root asymptotics with an application to manski’s maximum score estimator. Economics Letters\/ 73\/ (2), 241--250
2001
-
[11]
Hall, P. (1992). The Bootstrap and Edgeworth Expansion . Springer Series in Statistics. New York: Springer
1992
-
[12]
Horowitz, J. L. (1992). A smoothed maximum score estimator for the binary response model. Econometrica: Journal of the Econometric Society\/ , 505--531
1992
-
[13]
Horowitz, J. L. (2001). The bootstrap. In J. J. Heckman and E. Leamer (Eds.), Handbook of Econometrics , Volume 5, pp.\ 3159--3228. Elsevier
2001
-
[14]
Horowitz, J. L. (2019). Bootstrap methods in econometrics. Annual Review of Economics\/ 11\/ (1), 193--224
2019
-
[15]
Kim, J. and D. Pollard (1990). Cube root asymptotics. The Annals of Statistics\/ , 191--219
1990
-
[16]
Sakaguchi, and A
Kitagawa, T., S. Sakaguchi, and A. Tetenov (2023). Constrained classification and policy learning. Technical report
2023
-
[17]
Klein, R. W. and R. H. Spady (1993). An efficient semiparametric estimator for binary response models. Econometrica: Journal of the Econometric Society\/ , 387--421
1993
-
[18]
Lee, S. M. S. and M. Pun (2006). On m out of n bootstrapping for nonstandard m-estimation with nuisance parameters. Journal of the American Statistical Association\/ 101\/ (475), 1185--1197
2006
-
[19]
L \'e ger, C. and B. MacGibbon (2006). On the bootstrap in cube root asymptotics. Canadian Journal of Statistics\/ 34\/ (1), 29--44
2006
- [20]
-
[21]
Lugosi, G. and N. Vayatis (2004). On the bayes-risk consistency of regularized boosting methods. The Annals of statistics\/ 32\/ (1), 30--55
2004
-
[22]
Manski, C. F. (1975). Maximum score estimation of the stochastic utility model of choice. Journal of Econometrics\/ 3\/ (3), 205--228
1975
-
[23]
Manski, C. F. (1985). Semiparametric analysis of discrete response: Asymptotic properties of the maximum score estimator. Journal of Econometrics\/ 27\/ (3), 313--333
1985
-
[24]
Newey, W. K. and D. McFadden (1994). Large sample estimation and hypothesis testing. Handbook of econometrics\/ 4 , 2111--2245
1994
-
[25]
Rosen, A. M. and T. Ura (2025, 01). Finite sample inference for the maximum score estimand. The Review of Economic Studies\/ 92\/ (6), 4117--4151
2025
-
[26]
Seo, M. H. and T. Otsu (2018). Local m-estimation with discontinuous criterion for dependent and limited observations. The Annals of Statistics\/ 46\/ (1), 344--369
2018
-
[27]
Steinwart, I. (2005). Consistency of support vector machines and other regularized kernel classifiers. IEEE transactions on information theory\/ 51\/ (1), 128--142
2005
-
[28]
Zhang, T. (2004). Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics\/ 32\/ (1), 56--85
2004
-
[29]
Zhao, Y., D. Zeng, A. J. Rush, and M. R. Kosorok (2012). Estimating individualized treatment rules using outcome weighted learning. Journal of the American Statistical Association\/ 107\/ (499), 1106--1118
2012
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.