REVIEW 1 cited by
Noisy, Non-Smooth, Non-Convex Estimation of Moment Condition Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
A practical challenge for structural estimation is the requirement to accurately minimize a sample objective function which is often non-smooth, non-convex, or both. This paper proposes a simple algorithm designed to find accurate solutions without performing an exhaustive search. It augments each iteration from a new Gauss-Newton algorithm with a grid search step. A finite sample analysis derives its optimization and statistical properties simultaneously using only econometric assumptions. After a finite number of iterations, the algorithm automatically transitions from global to fast local convergence, producing accurate estimates with high probability. Simulated examples and an empirical application illustrate the results.
Forward citations
Cited by 1 Pith paper
-
Permutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study
Coordinate permutation is claimed to guarantee coverage of the global optimum in nonsmooth nonconvex optimization, but the proof assumes the coverage property it concludes and the convergence-rate result is a tautolog...
Discussion (0). Continue with ORCID to comment.