Papers › Jacobian-free Efficient Pseudo-Likelihood (EPL) Algorithm
Jacobian-free Efficient Pseudo-Likelihood (EPL) Algorithm
Takeshi Fukasawa
This study proposes a simple procedure to compute Efficient Pseudo Likelihood (EPL) estimator proposed by Dearing and Blevins (2024) for estimating dynamic discrete games, without computing Jacobians of equilibrium constraints. EPL estimator is efficient, convergent, and computationally fast. However, the original algorithm requires deriving and coding the Jacobians, which are cumbersome and prone to coding mistakes especially when considering complicated models. The current study proposes to avoid the computation of Jacobians by combining the ideas of numerical derivatives (for computing Jacobian-vector products) and the Krylov method (for solving linear equations). It shows good computational performance of the proposed method by numerical experiments.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections