This article presents EVM (Expectation-Variance-Maximization) — an alternative algorithm to the EM algorithm that can reduce training times dramatically. The new approach belongs to the class of general Newton algorithms and is applicable in most situations where the EM algorithm is currently...

A new algorithm for calibrating agent-based models is proposed, which employs a popular gradient boosting framework. Machine learning techniques are not used to develop a surrogate model, but rather assist in narrowing down the parameter space during the search for optimal parameters. Our...

Markov chain Monte Carlo (MCMC) methods have an important role in solving high dimensionality stochastic problems characterized by computational complexity. Given their critical importance, there is need for network and security risk management research to relate the MCMC quantitative...

This chapter provides an overview of solution and estimation techniques for dynamic stochastic general equilibrium models. We cover the foundations of numerical approximation techniques as well as statistical inference and survey the latest developments in the field.

We propose a new methodology to estimate the empirical pricing kernel implied from option data. In contrast to most of the studies in the literature that use an indirect approach, i.e. first estimating the physical and risk-neutral densities and obtaining the pricing kernel in a second step, we...

We present a fast and accurate computational method for solving and estimating a class of dynamic programming models with discrete and continuous choice variables. The solution method we develop for structural estimation extends the en- dogenous grid-point method (EGM) to discrete-continuous...

Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...

Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based on the idea of evaluating the posterior in parallel and ahead of time. Improved Metropolis-Hastings prefetching algorithms are presented and evaluated. It is shown how to use...