This article describes how when using Restricted Boltzmann Machine (RBM) algorithm to design the image classification network. The node number in each hidden layer, and the layer number of the entire network are designed by experiments, it increases the complexity for the RBM design. In order to...

This paper presents the Matlab package DeCo (Density Combination) which is based on the paper by Billio et al. (2013) where a constructive Bayesian approach is presented for combining predictive densities originating from different models or other sources of information. The combination weights...

In this paper we propose a new measure for systemic risk: the Financial Risk Meter (FRM). This measure is based on the penalization parameter () of a linear quantile lasso regression. The FRM is calculated by taking the average of the penalization parameters over the 100 largest US publicly...

This paper introduces a nonlinear certainty-equivalent approximation method for dynamic stochastic problems. We first introduce a novel, stable, and efficient method for computing the decision rules in deterministic dynamic economic problems. We use the results as nonlinear and global...

This paper gives a review of numerical methods for solving the BSDEs, especially, finite difference methods. For numerical methods of finite difference, we should divide them into three branches. Distributed method (or parallel method) should now become a hot topic. It is a key reason we present...

Since the advent of Markov chain Monte Carlo (MCMC) methods in the early 1990s, Bayesian methods have been proposed for a large and growing number of applications. One of the main advantages of Bayesian inference is the ability to deal with many different sources of uncertainty, including data,...

This paper presents the parallel computing implementation of the MitISEM algorithm, labeled Parallel MitISEM. The basic MitISEM algorithm provides an automatic and flexible method to approximate a non-elliptical target density using adaptive mixtures of Student-t densities, where only a kernel...

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...