REVIEW 2 major objections 1 minor 1 cited by
Sequential algorithm for structural estimations with equilibrium constraints
T0 review · 2 major / 1 minor · reviewed 2026-06-28 · grok-4.3
Pith's one-line read Sequential algorithms with the Zero Jacobian Property achieve near-quadratic convergence for MLE and GMM estimators in models with equilibrium constraints, producing asymptotically efficient results after one iteration from consistent start
desk verdict SLC gives a way to skip Jacobian computation for equilibrium models and runs faster than NFXP in the examples, but the convergence and efficiency claims still depend on ZJP holding in those cases. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The Zero Jacobian Property (ZJP), which allows sequential algorithms to attain near-quadratic convergence to the constrained optimum without explicit Jacobian computation of the equilibrium constraints.
What would settle it
A large-sample Monte Carlo experiment on a model known to satisfy the Zero Jacobian Property in which the estimator obtained after one iteration of the SLC algorithm is not asymptotically efficient or the observed convergence rate falls short of near-quadratic.
Extended reading notes
Core claim
This paper claims that structural models satisfying the Zero Jacobian Property admit sequential estimation algorithms that converge at near-quadratic rates to the solution of the constrained optimization problem for both maximum likelihood and generalized method of moments. When started from consistent initial parameter values, a single iteration of these algorithms produces an asymptotically efficient estimator. The paper further develops the Sequential Linearly Constrained algorithm, which implements this approach without requiring explicit differentiation of the equilibrium constraints and illustrates its performance on a dynamic discrete game with time-varying unobserved heterogeneity an
Load-bearing premise
The structural models must possess the Zero Jacobian Property for the sequential algorithms to deliver the claimed near-quadratic convergence rates.
Editorial extensions
If this is right
- The algorithms attain fast local convergence in large samples to the solution of the constrained optimization problem.
- They produce asymptotically efficient estimators for MLE and GMM after only one iteration when consistent initial estimates are available.
- The SLC algorithm applies to a broader class of structural models than existing sequential methods.
- The SLC algorithm can be implemented without explicitly computing the Jacobian of the equilibrium constraints.
- Numerical experiments show the SLC algorithm is multiple times faster than the nested fixed point approach on dynamic discrete games and dynamic demand models.
Reading between the lines
- The one-iteration efficiency property could allow researchers to embed the estimator inside outer loops for counterfactual simulation or policy optimization without recomputing full fixed points each time.
- Avoiding explicit Jacobian computation may open the method to equilibrium models defined only through simulation or black-box solvers where analytic derivatives are unavailable.
- The near-quadratic rate in large samples suggests the algorithm could serve as a practical substitute for slower nested procedures when sample sizes are moderate to large.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes sequential algorithms for structural estimations subject to equilibrium constraints that exploit the Zero Jacobian Property (ZJP). For MLE and GMM, it claims near-quadratic local convergence in large samples to the constrained optimum and asymptotic efficiency after a single iteration given consistent initial estimates. It introduces the Sequential Linearly Constrained (SLC) algorithm, which applies to a wider class of models, does not require explicit computation of the equilibrium constraint Jacobian, and is claimed to be substantially faster than the Nested Fixed Point (NFXP) method. Performance is illustrated via two numerical experiments: a dynamic discrete game with time-varying unobserved heterogeneity and a dynamic demand model.
Significance. If the convergence properties and efficiency claims hold under the stated conditions, and if the SLC algorithm delivers the promised speed improvements without sacrificing accuracy, the work could meaningfully reduce computational burdens in estimating equilibrium-constrained structural models, facilitating more extensive sensitivity analyses and larger-scale applications in empirical industrial organization and related fields.
major comments (2)
- [Numerical experiments] Numerical experiments section: The two experiments are presented as illustrations of the SLC algorithm's performance, but the manuscript does not verify or report whether the equilibrium mappings satisfy the Zero Jacobian Property at the estimated parameter values. Since the near-quadratic convergence and one-iteration efficiency results are conditioned on ZJP, the experiments do not provide direct evidence for the headline theoretical claims if ZJP does not hold in these cases.
- [Theoretical results on convergence] Theoretical results on convergence (abstract and main text): The claims of fast local convergence for MLE/GMM and asymptotic efficiency after one iteration are explicitly tied to ZJP, yet the manuscript provides no explicit statement or check confirming that the equilibrium constraints in the two example models satisfy this property at the reported estimates. This leaves the link between theory and numerical evidence unverified.
minor comments (1)
- Abstract: 'these algorithms attains fast (near-quadratic) local convergence' contains a subject-verb agreement error and should read 'these algorithms attain'.
Simulated Author's Rebuttal
We thank the referee for the careful and constructive comments. The two major comments correctly identify that the manuscript does not explicitly verify the Zero Jacobian Property (ZJP) at the estimated parameter values in the numerical experiments, leaving the connection between the theoretical convergence claims and the illustrations unverified. We address both points below and will revise the manuscript to close this gap.
read point-by-point responses
-
Referee: [Numerical experiments] Numerical experiments section: The two experiments are presented as illustrations of the SLC algorithm's performance, but the manuscript does not verify or report whether the equilibrium mappings satisfy the Zero Jacobian Property at the estimated parameter values. Since the near-quadratic convergence and one-iteration efficiency results are conditioned on ZJP, the experiments do not provide direct evidence for the headline theoretical claims if ZJP does not hold in these cases.
Authors: We agree that an explicit verification of ZJP at the reported estimates is needed to directly support the theoretical claims in the experiments. Although the two models were chosen because their equilibrium mappings satisfy ZJP by construction under the maintained assumptions of the paper, we did not report numerical confirmation at the estimated points. In the revision we will add this verification (via direct computation of the relevant Jacobian or an equivalent check) to the numerical experiments section or an appendix, thereby strengthening the link between theory and evidence. revision: yes
-
Referee: [Theoretical results on convergence] Theoretical results on convergence (abstract and main text): The claims of fast local convergence for MLE/GMM and asymptotic efficiency after one iteration are explicitly tied to ZJP, yet the manuscript provides no explicit statement or check confirming that the equilibrium constraints in the two example models satisfy this property at the reported estimates. This leaves the link between theory and numerical evidence unverified.
Authors: This comment correctly highlights the same evidentiary gap. We will revise the manuscript to include an explicit statement and verification that the equilibrium constraints satisfy ZJP at the reported estimates in both examples. This addition will be placed in the main text near the presentation of the theoretical results or in a dedicated subsection of the numerical experiments, ensuring the conditions for near-quadratic convergence and one-step efficiency are confirmed in the illustrations. revision: yes
Circularity Check
No circularity detected; derivation is self-contained under stated assumptions
full rationale
The paper introduces the Zero Jacobian Property (ZJP) as an assumption on the structural models and derives near-quadratic convergence rates plus one-step efficiency for MLE/GMM algorithms under that assumption. The SLC algorithm is presented as a computational alternative that avoids explicit Jacobian evaluation. No load-bearing step equates a claimed prediction or result to its inputs by construction, nor relies on self-citation chains for uniqueness or ansatz justification. The theoretical claims follow from standard constrained optimization and asymptotic arguments applied to equilibrium models satisfying ZJP; the numerical experiments function as illustrations rather than definitional inputs.
Assumptions & free parameters
assumptions (1)
- domain assumption Structural models satisfy the Zero Jacobian Property (ZJP)
Cite this review
Pith. "Pith review of Sequential algorithm for structural estimations with equilibrium constraints." pith.science (2026). https://pith.science/paper/RR6T5BHD
@misc{pith2026260604356,
author = {Pith},
title = {Pith review of: Sequential algorithm for structural estimations with equilibrium constraints},
year = {2026},
howpublished = {\url{https://pith.science/paper/RR6T5BHD}},
note = {Machine review of arXiv:2606.04356}
}
read the original abstract
This study examines sequential algorithms with the Zero Jacobian Property (ZJP) for estimating structural models subject to equilibrium constraints. For the Maximum Likelihood Estimation (MLE) and the Generalized Method of Moments (GMM), the current study shows that these algorithms attains fast (near-quadratic) local convergence in large samples to the solution of the constrained optimization problem. If consistent initial estimates of the parameters are available, the algorithms yield an asymptotically efficient estimator even after one iteration. It then proposes a novel algorithm called Sequential Linearly Constrained (SLC) algorithm, which is applicable to a broader class of structural models than existing methods. A key advantage of the SLC algorithm is that it can be implemented without explicitly computing the Jacobian of the equilibrium constraints and can be multiple times faster than the Nested Fixed Point (NFXP) approach. The current study illustrates its performance through two numerical experiments: a dynamic discrete game with time-varying unobserved heterogeneity and a dynamic demand model.
Figures
Forward citations
Cited by 1 Pith paper
-
Lagrange multipliers in Maximum likelihood estimations and Least squares problems with Constraints
Lagrange multipliers in constrained MLE and LS converge asymptotically to zero under correct specification, justifying zero initialization in algorithms like augmented Lagrangian methods.
Reference graph
Works this paper leans on
-
[1]
2015 , publisher=
Dai, Yu-Hong and Al-Baali, Mehiddin and Yang, Xiaoqi , booktitle=. 2015 , publisher=
2015
-
[2]
Management Science , volume=
Markov decision processes with exogenous variables , author=. Management Science , volume=. 2019 , publisher=
2019
-
[3]
Journal of Econometrics , volume=
Constrained estimation using penalization and MCMC , author=. Journal of Econometrics , volume=. 2022 , publisher=
2022
-
[4]
Aguirregabiria, Victor and Liu, Hui and Luo, Yao , journal=
-
[5]
arXiv preprint arXiv:2503.23792 , year=
When do firms sell high durability products? The case of light bulb industry , author=. arXiv preprint arXiv:2503.23792 , year=
-
[6]
Optimization methods and software , volume=
A derivative-free line search and global convergence of Broyden-like method for nonlinear equations , author=. Optimization methods and software , volume=. 2000 , publisher=
2000
-
[7]
Aguirregabiria, Victor and Magesan, Arvind , year=
-
[8]
Optimization Letters , volume=
A sequential quadratic programming algorithm for equality-constrained optimization without derivatives , author=. Optimization Letters , volume=. 2016 , publisher=
2016
Show all 89 references
-
[9]
Journal of Scientific Computing , volume=
A Derivative-Free Regularized Primal-Dual Interior-Point Algorithm for Constrained Nonlinear Least Squares Problems , author=. Journal of Scientific Computing , volume=. 2025 , publisher=
2025
-
[10]
Acta Numerica , volume=
Derivative-free optimization methods , author=. Acta Numerica , volume=. 2019 , publisher=
2019
-
[11]
SIAM Journal on Optimization , volume=
A matrix-free trust-region SQP method for equality constrained optimization , author=. SIAM Journal on Optimization , volume=. 2014 , publisher=
2014
-
[12]
SIAM Journal on Optimization , volume=
A regularized factorization-free method for equality-constrained optimization , author=. SIAM Journal on Optimization , volume=. 2018 , publisher=
2018
-
[13]
Quantitative Economics , volume=
Finding all pure-strategy equilibria in games with continuous strategies , author=. Quantitative Economics , volume=. 2012 , publisher=
2012
-
[14]
The Review of Economic Studies , volume=
Recursive lexicographical search: Finding all Markov perfect equilibria of finite state directional dynamic games , author=. The Review of Economic Studies , volume=. 2016 , publisher=
2016
-
[15]
Structural Estimation of Directional Dynamic Games With Multiple Equilibria , author=
-
[16]
Comparing Methods for Estimating Random Coefficient Logit Demand Models , author=
-
[17]
Econometrica , volume=
Nonparametric instrumental variable estimation under monotonicity , author=. Econometrica , volume=. 2017 , publisher=
2017
-
[18]
The annals of mathematical Statistics , pages=
Maximum-likelihood estimation of parameters subject to restraints , author=. The annals of mathematical Statistics , pages=. 1958 , publisher=
1958
-
[19]
2016 , publisher=
Lee, Jinhyuk and Seo, Kyoungwon , journal=. 2016 , publisher=
2016
-
[20]
2022 , publisher=
Gillingham, Kenneth and Iskhakov, Fedor and Munk-Nielsen, Anders and Rust, John and Schjerning, Bertel , journal=. 2022 , publisher=
2022
-
[21]
2025 , publisher=
Gowrisankaran, Gautam and Langer, Ashley and Zhang, Wendan , journal=. 2025 , publisher=
2025
-
[22]
2021 , publisher=
Bugni, Federico A and Bunting, Jackson , journal=. 2021 , publisher=
2021
-
[23]
Hall, BH and Hall, RE and Hausman, JA , journal=
-
[24]
Belloni, Alexandre and Chernozhukov, Victor and Chetverikov, Denis and Hansen, Christian and Kato, Kengo , journal=
-
[25]
1995 , publisher=
Gourieroux, Christian and Monfort, Alain , volume=. 1995 , publisher=
1995
-
[26]
2010 , publisher=
Herzog, Roland and Kunisch, Karl , journal=. 2010 , publisher=
2010
-
[27]
1972 , publisher=
Robinson, Stephen M , journal=. 1972 , publisher=
1972
-
[28]
The Econometrics Journal , volume =
Chernozhukov, Victor and Chetverikov, Denis and Demirer, Mert and Duflo, Esther and Hansen, Christian and Newey, Whitney and Robins, James , title =. The Econometrics Journal , volume =. 2018 , month =
2018
-
[29]
2008 , publisher=
Kasahara, Hiroyuki and Shimotsu, Katsumi , journal=. 2008 , publisher=
2008
-
[30]
2022 , publisher=
Chernozhukov, Victor and Escanciano, Juan Carlos and Ichimura, Hidehiko and Newey, Whitney K and Robins, James M , journal=. 2022 , publisher=
2022
-
[31]
Sawadogo, Sidi , journal=
-
[32]
2021 , publisher=
Pollock, Sara and Rebholz, Leo G , journal=. 2021 , publisher=
2021
-
[33]
2007 , publisher=
Bajari, Patrick and Benkard, C Lanier and Levin, Jonathan , journal=. 2007 , publisher=
2007
-
[34]
2009 , publisher=
Solodov, Mikhail V , journal=. 2009 , publisher=
2009
-
[35]
1982 , publisher=
Murtagh, Bruce A and Saunders, Michael A , journal=. 1982 , publisher=
1982
-
[36]
2019 , publisher=
Yamaguchi, Shintaro , journal=. 2019 , publisher=
2019
-
[37]
The Review of Economic Studies , volume=
Fern. The Review of Economic Studies , volume=. 2007 , publisher=
2007
-
[38]
2009 , publisher=
Imai, Susumu and Jain, Neelam and Ching, Andrew , journal=. 2009 , publisher=
2009
-
[39]
2004 , publisher=
Knoll, Dana A and Keyes, David E , journal=. 2004 , publisher=
2004
-
[40]
2014 , publisher=
Birgin, Ernesto G and Mart. 2014 , publisher=
2014
-
[41]
Kelley, Carl T , year=
-
[42]
2015 , publisher=
Egesdal, Michael and Lai, Zhenyu and Su, Che-Lin , journal=. 2015 , publisher=
2015
-
[43]
1993 , publisher=
Hotz, V Joseph and Miller, Robert A , journal=. 1993 , publisher=
1993
-
[44]
Fukasawa, Takeshi , journal=
-
[45]
Saad, Yousef , year=
-
[46]
2023 , publisher=
Lu, Zhentong and Shi, Xiaoxia and Tao, Jing , journal=. 2023 , publisher=
2023
-
[47]
2023 , publisher=
Foster, Dylan J and Syrgkanis, Vasilis , journal=. 2023 , publisher=
2023
-
[48]
2025 , publisher=
Dearing, Adam and Blevins, Jason R , journal=. 2025 , publisher=
2025
-
[49]
Lange, Kenneth , year=
-
[50]
2014 , publisher=
Su, Che-Lin , journal=. 2014 , publisher=
2014
-
[51]
2012 , publisher=
Su, Che-Lin and Judd, Kenneth L , journal=. 2012 , publisher=
2012
-
[52]
Nocedal, Jorge and Wright, Stephen J , year=
-
[53]
2016 , publisher=
Iskhakov, Fedor and Lee, Jinhyuk and Rust, John and Schjerning, Bertel and Seo, Kyoungwon , journal=. 2016 , publisher=
2016
-
[54]
2019 , publisher=
Bray, Robert L , journal=. 2019 , publisher=
2019
-
[55]
2015 , publisher=
Ahlfeldt, Gabriel M and Redding, Stephen J and Sturm, Daniel M and Wolf, Nikolaus , journal=. 2015 , publisher=
2015
-
[56]
2016 , publisher=
Shcherbakov, Oleksandr , journal=. 2016 , publisher=
2016
-
[57]
1997 , publisher=
Jamshidian, Mortaza and Jennrich, Robert I , journal=. 1997 , publisher=
1997
-
[58]
Tang, Bohao and Henderson, Nicholas C and Varadhan, Ravi , journal=
-
[59]
2017 , publisher=
Huang, Shuai and Wan, Zhong , journal=. 2017 , publisher=
2017
-
[60]
Mathematics of computation , volume=
La Cruz, William and Mart. Mathematics of computation , volume=
-
[61]
Reynaerts, Jo and Varadha, R and Nash, John C , year=
-
[62]
2022 , institution=
Salani. 2022 , institution=
2022
-
[63]
2006 , publisher=
Bonnans, Joseph-Fr. 2006 , publisher=
2006
-
[64]
2007 , publisher=
Berry, Steven and Pakes, Ariel , journal=. 2007 , publisher=
2007
-
[65]
2009 , publisher=
Kasahara, Hiroyuki and Shimotsu, Katsumi , journal=. 2009 , publisher=
2009
-
[66]
International Journal of Industrial Organization , volume=
P. International Journal of Industrial Organization , volume=. 2023 , publisher=
2023
-
[67]
2015 , publisher=
Lee, Jinhyuk and Seo, Kyoungwon , journal=. 2015 , publisher=
2015
-
[68]
Varadhan, Ravi and Gilbert, Paul , journal=
-
[69]
Du, Yu and Varadhan, Ravi , journal=
-
[70]
2008 , publisher=
Varadhan, Ravi and Roland, Christophe , journal=. 2008 , publisher=
2008
-
[71]
Judd, Kenneth L , year=
-
[72]
2011 , publisher=
Arcidiacono, Peter and Miller, Robert A , journal=. 2011 , publisher=
2011
-
[73]
2021 , publisher=
Aguirregabiria, Victor and Marcoux, Mathieu , journal=. 2021 , publisher=
2021
-
[74]
2020 , publisher=
Conlon, Christopher and Gortmaker, Jeff , journal=. 2020 , publisher=
2020
-
[75]
2007 , publisher =
Aguirregabiria, Victor and Mira, Pedro , journal =. 2007 , publisher =
2007
-
[76]
1994 , publisher =
Berry, Steven T , journal =. 1994 , publisher =
1994
-
[77]
Econometrica , pages=
Automobile prices in market equilibrium , author=. Econometrica , pages=. 1995 , publisher=
1995
-
[78]
Econometrica , volume =
Improving the numerical performance of static and dynamic aggregate discrete choice random coefficients demand estimation , author =. Econometrica , volume =. 2012 , publisher =
2012
-
[79]
Journal of Econometrics , volume=
A computationally efficient fixed point approach to dynamic structural demand estimation , author=. Journal of Econometrics , volume=. 2019 , publisher=
2019
-
[80]
Journal of Political Economy , volume =
Dynamics of consumer demand for new durable goods , author =. Journal of Political Economy , volume =. 2012 , publisher =
2012
-
[81]
IMA journal of numerical analysis , volume=
Two-point step size gradient methods , author=. IMA journal of numerical analysis , volume=. 1988 , publisher=
1988
-
[82]
Econometrica , volume=
Swapping the nested fixed point algorithm: A class of estimators for discrete Markov decision models , author=. Econometrica , volume=. 2002 , publisher=
2002
-
[83]
The Japanese Economic Review , volume=
Estimation of discrete choice dynamic programming models , author=. The Japanese Economic Review , volume=. 2018 , publisher=
2018
-
[84]
Econometrica , volume=
Sequential estimation of structural models with a fixed point constraint , author=. Econometrica , volume=. 2012 , publisher=
2012
-
[85]
The Review of Economic Studies , volume=
Asymptotic least squares estimators for dynamic games , author=. The Review of Economic Studies , volume=. 2008 , publisher=
2008
-
[86]
Journal of Econometrics , volume=
Nonparametric identification of dynamic models with unobserved state variables , author=. Journal of Econometrics , volume=. 2012 , publisher=
2012
-
[87]
2025 , publisher=
Fukasawa, Takeshi , journal=. 2025 , publisher=
2025
-
[88]
Econometrica , volume=
Optimal replacement of GMC bus engines: An empirical model of Harold Zurcher , author =. Econometrica , volume=. 1987 , publisher =
1987
-
[89]
The RAND journal of economics , volume =
Automobile replacement: a dynamic structural approach , author =. The RAND journal of economics , volume =. 2011 , publisher =
2011
Reviewed June 28, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.