Please use this identifier to cite or link to this item:
http://ir.mu.ac.ke:8080/jspui/handle/123456789/6066
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Milgo, Edna | - |
dc.contributor.author | Ronoh, Nixon | - |
dc.contributor.author | Wagacha, Peter Waiganjo | - |
dc.contributor.author | Manderick, Bernard | - |
dc.date.accessioned | 2022-03-08T09:32:55Z | - |
dc.date.available | 2022-03-08T09:32:55Z | - |
dc.date.issued | 2016 | - |
dc.identifier.uri | http://ir.mu.ac.ke:8080/jspui/handle/123456789/6066 | - |
dc.description.abstract | The Metropolis-Hastings Markov Chain Monte Carlo algorithm uses a proposal distribution to sample from a given target distribution. The proposal distribution has to be tuned beforehand which is an expensive exercise. However, adaptive algorithms automatically tune the proposal distribution based on knowledge from past samples, reducing the tuning cost. In this study we first examine Adaptive Metropolis, Metropolis Gaussian Adaptation and Covariance Matrix Adaptation Evolutionary Strategies. The latter is usually used as an optimization strategy but it is feasible to incorporate it in MCMC. | en_US |
dc.language.iso | en | en_US |
dc.subject | Markov Chain Monte Carlo | en_US |
dc.subject | Covariance matrix adaptation | en_US |
dc.title | Improving the effectiveness of MCMC through adaptation | en_US |
dc.type | Presentation | en_US |
Appears in Collections: | School of Information Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Benelearn_2016_paper_10.pdf | 170.39 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.