國立虎尾科技大學 |

Efficient Bayesian Machine Learning with Gaussian Processes.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Efficient Bayesian Machine Learning with Gaussian Processes./
作者:	Peng, Hao.
面頁冊數:	1 online resource (90 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
Contained By:	Dissertation Abstracts International78-12B(E).
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9780355089172

Efficient Bayesian Machine Learning with Gaussian Processes.
Peng, Hao.

Efficient Bayesian Machine Learning with Gaussian Processes. - 1 online resource (90 pages)

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

Thesis (Ph.D.)

Includes bibliographical references

Statistical inference for functions is an important topic for regression and classification problems in machine learning. One of the challenges in function inference is to model the non-linear relationships between data inputs and outputs. Gaussian processes (GPs) are powerful non-linear models that provide a nonparametric representation of functions. However, exact GP inference suffers from a high computational cost for big data. In this dissertation, we target to provide efficient and scalable but yet accurate approximate inference algorithms for GPs.

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

Mode of access: World Wide Web

ISBN: 9780355089172Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Efficient Bayesian Machine Learning with Gaussian Processes.
LDR:03612ntm a2200361Ki 4500 001 910739
005 20180517112609.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355089172
035 $a (MiAaPQ)AAI10269758
035 $a (MiAaPQ)purdue:21206
035 $a AAI10269758
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Peng, Hao. $3 1182182
245 1 0 $a Efficient Bayesian Machine Learning with Gaussian Processes.
264 0 $c 2017
300 $a 1 online resource (90 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-12(E), Section: B.
500 $a Advisers: Yuan Qi; Ninghui Li.
502 $a Thesis (Ph.D.) $c Purdue University $d 2017.
504 $a Includes bibliographical references
520 $a Statistical inference for functions is an important topic for regression and classification problems in machine learning. One of the challenges in function inference is to model the non-linear relationships between data inputs and outputs. Gaussian processes (GPs) are powerful non-linear models that provide a nonparametric representation of functions. However, exact GP inference suffers from a high computational cost for big data. In this dissertation, we target to provide efficient and scalable but yet accurate approximate inference algorithms for GPs.
520 $a First, we purpose a new Bayesian approach, EigenGP, which learns both the dictionary basis functions---eigenfunctions of a GP prior---and the prior precision in a sparse finite model. EigenGP can be viewed as a low-rank approximation to the exact GPs by projecting the GP prior to an eigensubspace. By maximizing the model evidence, EigenGP can construct sparse basis functions in a reproducing kernel Hilbert space as a finite linear combination of kernel functions. The learned basis functions of EigenGP can interpolate non-stationary functions even with a stationary kernel. We further extend EigenGP to parallel computing and classification problems. The experimental results on benchmark datasets demonstrate the advantages of EigenGP over alternative state-of-the-art sparse GP methods as well as Relevance Vector Machines (RVMs).
520 $a Second, we propose a more general but principled model, ADVGP, in the variational Bayesian framework. ADVGP approximates the exact GP inference using a weight-space argumentation with a flexible choice of the basis functions. By choosing different basis functions, we show that ADVGP not only relates many existing sparse GPs but also creates new sparse GP models. More importantly, as far as we know, we are the first to implement the delayed proximal gradient algorithm for sparse GPs on the recent distributed platform, PARAMETERSERVER. By utilizing the structure of the ADVGP's log evidence lower bound, we derive efficient element-wise asynchronous updates with convergence guarantees for our variational parameters on the servers. Our experiments show that ADVGP has a better predictive performance than other distributed or stochastic spare GP models and scales GP regression to a real-world application with billions of samples.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Purdue University. $b Computer Sciences. $3 1179390
773 0 $t Dissertation Abstracts International $g 78-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10269758 $z click for full text (PQDT)