Estimating dynamic models by matching random features
TL;DR
It is shown that, for a large class of dynamic models, parameters can be estimated by matching a small number of random features of the observed and simulated data and serves as the foundation for a new class of random feature methods for simulation-based estimation and inference.
Abstract
Scientists increasingly express their ideas as dynamic models of complex processes. It is often much easier to simulate these models than to calculate the probability of their generating a particular outcome, making likelihood-based estimation infeasible. Existing likelihood-free approaches rely either on manually chosen summary statistics or on representations learned by neural networks. The former is error-prone and laborious, while the latter is computationally intensive, leaving many scientists in a difficult position. We show that, for a large class of dynamic models, parameters can be estimated by matching a small number of random features of the observed and simulated data. Specifically, we show that models with a $p$-dimensional parameter can be identified from just $2p+1$ generic random Fourier features. We introduce two estimators for stationary and nonstationary processes, respectively, and we establish their consistency under mild regularity conditions. More broadly, our results serve as the foundation for a new class of random feature methods for simulation-based estimation and inference.