eBook - ePub
Advanced Markov Chain Monte Carlo Methods
Learning from Past Samples
This is a test
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
Advanced Markov Chain Monte Carlo Methods
Learning from Past Samples
Book details
Book preview
Table of contents
Citations
About This Book
Markov Chain Monte Carlo (MCMC) methods are now an indispensable tool in scientific computing. This book discusses recent developments of MCMC methods with an emphasis on those making use of past sample information during simulations. The application examples are drawn from diverse fields such as bioinformatics, machine learning, social science, combinatorial optimization, and computational physics.
Key Features:
- Expanded coverage of the stochastic approximation Monte Carlo and dynamic weighting algorithms that are essentially immune to local trap problems.
- A detailed discussion of the Monte Carlo Metropolis-Hastings algorithm that can be used for sampling from distributions with intractable normalizing constants.
- Up-to-date accounts of recent developments of the Gibbs sampler.
- Comprehensive overviews of the population-based MCMC algorithms and the MCMC algorithms with adaptive proposals.
This book can be used as a textbook or a reference book for a one-semester graduate course in statistics, computational biology, engineering, and computer sciences. Applied or theoretical researchers will also find this book beneficial.
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Advanced Markov Chain Monte Carlo Methods by Faming Liang, Chuanhai Liu, Raymond Carroll in PDF and/or ePUB format, as well as other popular books in Mathematics & Probability & Statistics. We have over one million books available in our catalogue for you to explore.
Information
Chapter 1
Bayesian Inference and Markov Chain Monte Carlo
1.1 Bayes
Bayesian inference is a probabilistic inferential method. In the last two decades, it has become more popular than ever due to affordable computing power and recent advances in Markov chain Monte Carlo (MCMC) methods for approximating high dimensional integrals.
Bayesian inference can be traced back to Thomas Bayes (1764), who derived the inverse probability of the success probability θ in a sequence of independent Bernoulli trials, where θ was taken from the uniform distribution on the unit interval (0, 1) but treated as unobserved. For later reference, we describe his experiment using familiar modern terminology as follows.
Suppose that θ ~ Unif(0, 1), the uniform distribution over the unit interval (0, 1), and that x1,..., xn is a sample from Bernoulli(θ), which has the sample space = {0, 1} and probability mass function (pmf)
(1.1)
where X denotes the Bernoulli random variable (r.v.) with X = 1 for success and X =0 for failure. Write the observed number of successes in the n Bernoulli trials. Then N|θ ~ Binomial(n, θ), the Binomial distribution with parameters size n and probability of success θ.
The inverse probability of θ given x1,..., xn, known as the posterior distribution, is obtained from Bayesâ theorem, or more rigorously in modern probability theory, the definition of conditional distribution, as the Beta distribution Beta(1 + N, 1+n â N) with probability density function (pdf)
(1.2)
where B(¡, ¡) stands for the Beta function.
1.1.1 Specification of Bayesian Models
Real world problems in statistical inference involve the unknown quantity θ and observed data X. For different views on the philosophical foundations of Bayesian approach, see Savage (1967a, b), Berger (1985), Rubin (1984), and Bernardo and Smith (1994). As far as the mathematical description of a Bayesian model is concerned, Bayesian data analysis amounts to
(i) specifying a sampling model for the observed data X, conditioned on an unknown quantity θ,
(1.3)
where f(X|θ) stands for either pdf or pmf as appropriate, and
(ii) specifying a marginal distribution Ď(θ) for θ, called the prior distribution or simply the prior for short,
(1.4)
Technically, data analysis for producing inferential results on assertions of interest is reduced to computing integrals with respect to the posterior distribution, or posterior for short,
(1.5)
where L(θ|X) â f(X|θ) in θ, called the likelihood of θ given X. Our focus in this book is on efficient and accurate approximations to these integrals for scientific inference. Thus, limited discussion of Bayesian inference is necessary.
1.1.2 The Jeffreys Priors and Beyond
By its nature, Bayesian inference is necessarily subjective because specification of the full Bayesian model amounts to practically summarizing available information in terms of precise probabilities. Specification of prob...
Table of contents
- Cover
- Title
- Copyright
- Preface
- Acknowledgments
- Publisherâs Acknowledgments
- Chapter 1: Bayesian Inference and Markov Chain Monte Carlo
- Chapter 2: The Gibbs Sampler
- Chapter 3: The Metropolis-Hastings Algorithm
- Chapter 4: Auxiliary Variable MCMC Methods
- Chapter 5: Population-Based MCMC Methods
- Chapter 6: Dynamic Weighting
- Chapter 7: Stochastic Approximation Monte Carlo
- Chapter 8: Markov Chain Monte Carlo with Adaptive Proposals
- Reference
- Index