Simulation-Based Fitting of Intractable Models via Sequential Sampling and Local Smoothing
By: Guido Masarotto
Potential Business Impact:
Helps computers learn from complex, unknown models.
This paper presents a comprehensive algorithm for fitting generative models whose likelihood, moments, and other quantities typically used for inference are not analytically or numerically tractable. The proposed method aims to provide a general solution that requires only limited prior information on the model parameters. The algorithm combines a global search phase, aimed at identifying the region of the solution, with a local search phase that mimics a trust region version of the Fisher scoring algorithm for computing a quasi-likelihood estimator. Comparisons with alternative methods demonstrate the strong performance of the proposed approach. An R package implementing the algorithm is available on CRAN.
Similar Papers
SLIM: Stochastic Learning and Inference in Overidentified Models
Econometrics
Solves complex math problems much faster.
SLIM: Stochastic Learning and Inference in Overidentified Models
Econometrics
Makes complex math problems solve much faster.
Improved Bounds for Context-Dependent Evolutionary Models Using Sequential Monte Carlo
Computation
Helps scientists understand how life changes over time.