Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1227 for “"mcmc"”.
-
AutoStep : locally adaptive involutive MCMC
Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is often a challenging task in practice; and for complex multiscale targets, there may not be one choice of step size that …
-
Bayesian optimization for adaptive MCMC
… strategy for adaptive Markov chain Monte Carlo (MCMC) using Bayesian optimization, called Bayesian-optimized MCMC, is proposed. This approach can handle non-differentiable objective functions and trades off exploration and exploitation to reduce the number of function evaluations. …
-
Mcmc- Based Optimization And Application
… we study the theory of Markov Chain Monte Carlo (MCMC) and its application in statistical optimization. The MCMC method is a class of evolutionary algorithms for generating samples from given probability distributions. In the thesis, we first focus on the methods of slice sampling and simulated …
-
Bayesovský odhad parametru pomocí MCMC
… parametrů pomocí metod Markov chain Monte Carlo (MCMC). Nejprve je představen potřebný teoretický aparát, jmenovitě některé statě z inferenční statistiky, základy Markovských řetězců, lineární modely (pojato Bayesovsky) a v neposlední řadě také základy z teorie MCMC -- algoritmus …
-
Sisteminės rizikos matų skaičiavimas MCMC metodais /
… of the GARCH and GJR-GARCH models the MCMC Metropolis-Hastings algorithm is proposed. In addition, this paper examines the several assumptions about the distribution of stock returns - it is assumed that the logarithmic return is distributed according to the normal, Laplace, asymmetric …
-
Convergence and Efficiency of Adaptive MCMC
Adaptive Markov Chain Monte Carlo (MCMC) algorithms attempt to ‘learn’ from the results of past iterations so the Markov chain can converge quicker. Unfortunately, adaptive MCMC algorithms are no longer Markovian, so their convergence is difficult to guarantee. The first part of this thesis …
-
Differential geometric MCMC methods and applications
This thesis presents novel Markov chain Monte Carlo methodology that exploits the natural representation of a statistical model as a Riemannian manifold. The methods developed provide generalisations of the Metropolis-adjusted Langevin algorithm and the Hybrid Monte Carlo algorithm for Bayesian …
-
Conditional Copula Inference and Efficient Approximate MCMC
… is required. I propose to use perturbed MCMC versions of ABC and BSL algorithms and attempt to significantly accelerate these samplers. The main idea of the proposed strategy is to utilize past samples with k-Nearest-Neighbor approach for likelihood approximation. This general method …
-
Ergodicity of Adaptive MCMC and its Applications
Markov chain Monte Carlo algorithms (MCMC) and Adaptive Markov chain Monte Carlo algorithms (AMCMC) are most important methods of approximately sampling from complicated probability distributions and are widely used in statistics, computer science, chemistry, physics, etc. The core problem to use …
-
Bayesian Model Selection And Estimation Without Mcmc
This dissertation explores Bayesian model selection and estimation in settings where the model space is too vast to rely on Markov Chain Monte Carlo for posterior calculation. First, we consider the problem of sparse multivariate linear regression, in which several correlated outcomes are …
-
Stratified MCMC Sampling of non-Reversible Dynamics
… to another. We present a new form of stratified MCMC algorithm built with non-reversible stochastic dynamics in mind. The method has potential usefulness in that many systems of interest are non-reversible, and can also benefit from stratification at the same time. It may also be useful for …
-
Stochastic Approximation and Its Application in MCMC
Stochastic approximation has been widely used since first proposed by Herbert Robbins and Sutton Monro in 1951. It is an iterative stochastic method that attempts to find the zeros of functions that cannot be computed directly. In this thesis, we used the technique in several different aspects. It …
-
An Approximate MCMC Method for Convex Hulls
Markov chain Monte Carlo (MCMC) is an extremely popular class of algorithms for computing summaries of posterior distributions. One problem for MCMC in the so-called Big Data regime is the growing computational cost of most MCMC algorithms. Most popular and basic MCMC algorithms, like …
-
Qwixx Strategies Using Simulation and MCMC Methods
… scorebased approach that uses a formula tuned by MCMC random walks, and race-to-lock approaches which use absorbing Markov chain qualities of individual score sheet rows to find ways to lock rows as quickly as possible. Results indicate that employing a scorebased strategy, considering gap, count, …
-
MCMC simulation for modelling airline passenger choice behaviour
… used then to classify any new booking data. The MCMC model uses the Metropolis Algorithm for its estimation process. We also examine briefly the computational feasibility of our approach using parallel processing.
-
MCMC Methods for Non-linear State Space Models
… thesis is concerned with developing efficient MCMC (Markov Chain Monte Carlo) techniques for non-linear, non-Gaussian state space models. These models are widely applicable in many fields, such as population ecology and economics. However, Bayesian inference in such models remains challenging, …
-
Rejection-Free and Partial Neighbor Search MCMC Algorithms
The Metropolis algorithm involves producing a Markov chain to converge in distribution to a specified target density $\pi$. To improve its efficiency, we can use the Rejection-Free version of the Metropolis algorithm, which avoids the inefficiency of rejections by evaluating all neighbors. …
-
Inflated Standard Errors of MCMC Estimates in IRT
… (IRT) parameters are Markov chain Monte Carlo (MCMC) and the EM algorithm. In general, the MCMC algorithm has advantages over the EM algorithm - for example, the MCMC algorithm allows one to estimate the desired posterior distribution and also works more straightforwardly with complex IRT …
-
A Bayesian/MCMC Approach to Galaxy Modelling: NGC 6503
… statistics and Markov chain Monte Carlo (MCMC) techniques to construct dynamical models for the spiral galaxy NGC 6503. The constraints include surface brightness profiles which display a Freeman Type II structure; HI and ionized gas rotation curves; the stellar rotation, which is nearly …
Page 1 of 62