Search Results for author: Johan Dahlin

Found 12 papers, 6 papers with code

Correlated pseudo-marginal Metropolis-Hastings using quasi-Newton proposals

1 code implementation26 Jun 2018 Johan Dahlin, Adrian Wills, Brett Ninness

Pseudo-marginal Metropolis-Hastings (pmMH) is a versatile algorithm for sampling from target distributions which are not easy to evaluate point-wise.

Constructing Metropolis-Hastings proposals using damped BFGS updates

1 code implementation4 Jan 2018 Johan Dahlin, Adrian Wills, Brett Ninness

The computation of Bayesian estimates of system parameters and functions of them on the basis of observed system performance data is a common problem within system identification.

Computation Computational Finance

Accelerating pseudo-marginal Metropolis-Hastings by correlating auxiliary variables

no code implementations17 Nov 2015 Johan Dahlin, Fredrik Lindsten, Joel Kronander, Thomas B. Schön

Pseudo-marginal Metropolis-Hastings (pmMH) is a powerful method for Bayesian inference in models where the posterior distribution is analytical intractable or computationally costly to evaluate directly.

Bayesian Inference

Getting Started with Particle Metropolis-Hastings for Inference in Nonlinear Dynamical Models

1 code implementation5 Nov 2015 Johan Dahlin, Thomas B. Schön

This tutorial provides a gentle introduction to the particle Metropolis-Hastings (PMH) algorithm for parameter inference in nonlinear state-space models together with a software implementation in the statistical programming language R. We employ a step-by-step approach to develop an implementation of the PMH algorithm (and the particle filter within) together with the reader.

Bayesian optimisation for fast approximate inference in state-space models with intractable likelihoods

2 code implementations23 Jun 2015 Johan Dahlin, Mattias Villani, Thomas B. Schön

We consider the problem of approximate Bayesian parameter inference in non-linear state-space models with intractable likelihoods.

Bayesian Optimisation

Sequential Monte Carlo Methods for System Identification

no code implementations20 Mar 2015 Thomas B. Schön, Fredrik Lindsten, Johan Dahlin, Johan Wågberg, Christian A. Naesseth, Andreas Svensson, Liang Dai

One of the key challenges in identifying nonlinear and possibly non-Gaussian state space models (SSMs) is the intractability of estimating the system state.

Newton-based maximum likelihood estimation in nonlinear state space models

1 code implementation12 Feb 2015 Manon Kok, Johan Dahlin, Thomas B. Schön, Adrian Wills

Maximum likelihood (ML) estimation using Newton's method in nonlinear state space models (SSMs) is a challenging problem due to the analytical intractability of the log-likelihood and its gradient and Hessian.

valid

Quasi-Newton particle Metropolis-Hastings

1 code implementation12 Feb 2015 Johan Dahlin, Fredrik Lindsten, Thomas B. Schön

A possible application is parameter inference in the challenging class of SSMs with intractable likelihoods.

Marginalizing Gaussian Process Hyperparameters using Sequential Monte Carlo

no code implementations6 Feb 2015 Andreas Svensson, Johan Dahlin, Thomas B. Schön

Gaussian process regression is a popular method for non-parametric probabilistic modeling of functions.

regression

Particle Metropolis-Hastings using gradient and Hessian information

no code implementations4 Nov 2013 Johan Dahlin, Fredrik Lindsten, Thomas B. Schön

Particle Metropolis-Hastings (PMH) allows for Bayesian parameter inference in nonlinear state space models by combining Markov chain Monte Carlo (MCMC) and particle filtering.

Particle filter-based Gaussian process optimisation for parameter inference

no code implementations4 Nov 2013 Johan Dahlin, Fredrik Lindsten

Finally, we use a heuristic procedure to obtain a revised parameter iterate, providing an automatic trade-off between exploration and exploitation of the surrogate model.

Ensemble approaches for improving community detection methods

no code implementations1 Sep 2013 Johan Dahlin, Pontus Svenson

This ensemble can found by re-sampling methods, multiple runs of a stochastic community detection method, or by several different community detection algorithms applied to the same network.

Clustering Community Detection

Cannot find the paper you are looking for? You can Submit a new open access paper.