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 8 of 8 for “"Metropolis-Adjusted Langevin Algorithm"”.
-
Topics in bayesian econometrics
… of two different formulations of the random walk Metropolis-Hastings algorithm, the Hamiltonian Monte Carlo algorithm, the Metropolis adjusted Langevin algorithm and the simplified manifold Metropolis adjusted Langevin algorithm, are considered and compared against a series of performance criteria …
-
Differential geometric MCMC methods and applications
… methods developed provide generalisations of the Metropolis-adjusted Langevin algorithm and the Hybrid Monte Carlo algorithm for Bayesian statistical inference, and resolve many shortcomings of existing Monte Carlo algorithms when sampling from target densities that may be high dimensional and …
-
Automatic massively parallel Markov chain Monte Carlo with quantifiable error
Simulated Tempering (ST) is an MCMC algorithm for complex target distributions that operates on a path between the target and an amenable reference distribution. Crucially, if the reference enables i.i.d. sampling, ST is regenerative and therefore embarrassingly parallel. However, the difficulty of …
-
Mobile Multisource Term Estimation in Fluctuating Fluid Concentration Fields
… sequential Monte Carlo (SMC) samplers with a Metropolis-adjusted Langevin algorithm (MALA) within a Gibbs kernel. Simulation experiments were conducted to evaluate the performance of the PG PFE MS STE method under varying conditions, including different plume configurations, concentration …
-
Audio-Visual Speech Enhancement Using Unsupervised Learning Methods
… posterior sampling strategies, including the Metropolis-Adjusted Langevin Algorithm (MALA), Barker sampling, Hamiltonian Monte Carlo (HMC), and hybrid samplers. We further propose a silence-aware latent noise prior that regularizes latent inference during non-speech regions, suppressing …
-
Advances in Log-concave Sampling and Domain Adaptation
… the study of distributions and the innovation of algorithms driving from them serve as foundation pursuits. This dissertation delves into two critical topics tied to distributions: log-concave sampling and domain adaptation. Our research encompasses both theoretical and methodological developments …
-
Computationally efficient statistical inference in Markovian models
… perspective gives rise to typically recursive algorithms, which sequentially process the observations to slowly refine the estimate of the current state of the system. The most common of these algorithms are the Kalman filter and its extensions via linearisation procedures, and particle …
-
Time-Varying Coefficient Models for Recurrent Events
… and the log baseline intensity. An EM algorithm is developed for parameter estimation. One issue with this approach is that the estimating procedure is conditional on smoothing parameters, which have to be selected by cross-validation or optimizing certain performance criterion. The …