國立虎尾科技大學 |

Scalable Hamiltonian Monte Carlo via Surrogate Methods.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Scalable Hamiltonian Monte Carlo via Surrogate Methods./
Author:	Zhang, Cheng.
Description:	1 online resource (154 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 78-08(E), Section: B.
Contained By:	Dissertation Abstracts International78-08B(E).
Subject:	Applied mathematics. -
Online resource:	click for full text (PQDT)
ISBN:	9781369688245

Scalable Hamiltonian Monte Carlo via Surrogate Methods.
Zhang, Cheng.

Scalable Hamiltonian Monte Carlo via Surrogate Methods. - 1 online resource (154 pages)

Source: Dissertation Abstracts International, Volume: 78-08(E), Section: B.

Thesis (Ph.D.)

Includes bibliographical references

Markov chain Monte Carlo (MCMC) methods have been widely used in Bayesian inference involving intractable probabilistic models. However, simple MCMC algorithms (e.g., random walk Metropolis and Gibbs sampling) are notorious for their lack of computational efficiency in complex, high-dimensional models and poor scaling to large data sets. In recent years, many advanced MCMC methods (e.g., Hamiltonian Monte Carlo and Riemannian Manifold Hamiltonian Monte Carlo) have been proposed that utilize geometrical and statistical quantities from the model in order to explore the target distribution more effectively. The gain in the efficacy of exploration, however, often comes at a significant computational cost which hinders their application to problems with large data sets or complex likelihoods.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781369688245Subjects--Topical Terms:

1069907
Applied mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Scalable Hamiltonian Monte Carlo via Surrogate Methods.
LDR:03242ntm a2200373Ki 4500 001 909671
005 20180426091043.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9781369688245
035 $a (MiAaPQ)AAI10247951
035 $a (MiAaPQ)uci:14337
035 $a AAI10247951
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Zhang, Cheng. $3 1180566
245 1 0 $a Scalable Hamiltonian Monte Carlo via Surrogate Methods.
264 0 $c 2017
300 $a 1 online resource (154 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-08(E), Section: B.
500 $a Adviser: Hongkai Zhao.
502 $a Thesis (Ph.D.) $c University of California, Irvine $d 2017.
504 $a Includes bibliographical references
520 $a Markov chain Monte Carlo (MCMC) methods have been widely used in Bayesian inference involving intractable probabilistic models. However, simple MCMC algorithms (e.g., random walk Metropolis and Gibbs sampling) are notorious for their lack of computational efficiency in complex, high-dimensional models and poor scaling to large data sets. In recent years, many advanced MCMC methods (e.g., Hamiltonian Monte Carlo and Riemannian Manifold Hamiltonian Monte Carlo) have been proposed that utilize geometrical and statistical quantities from the model in order to explore the target distribution more effectively. The gain in the efficacy of exploration, however, often comes at a significant computational cost which hinders their application to problems with large data sets or complex likelihoods.
520 $a In practice, it remains challenging to design scalable MCMC algorithms that can balance computational complexity and exploration efficacy well. To address this issue, some recent algorithms rely on stochastic gradient methods by approximating full data gradients using mini-batches of data. In contrast, this thesis focuses on accelerating the computation of MCMC samplers based on various surrogate methods via exploring the regularity of the target distribution.
520 $a We start with a precomputing strategy that can be used to build efficient surrogates in relatively low-dimension parameter spaces. We then propose a random network surrogate architecture which can effectively capture the collective properties of large data sets or complex models with scalability, flexibility and efficiency. Finally, we provide a variational perspective for our random network surrogate methods and propose an approximate inference framework that combines the advantages of both variational Bayes and Markov chain Monte Carlo methods. The properties and efficiency of our proposed methods are demonstrated on a variety of synthetic and real-world data problems.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Statistics. $3 556824
655 7 $a Electronic books. $2 local $3 554714
690 $a 0364
690 $a 0463
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, Irvine. $b Mathematics - Ph.D.. $3 1180567
773 0 $t Dissertation Abstracts International $g 78-08B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10247951 $z click for full text (PQDT)