語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Efficient Bayesian Machine Learning ...
~
Peng, Hao.
FindBook
Google Book
Amazon
博客來
Efficient Bayesian Machine Learning with Gaussian Processes.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Efficient Bayesian Machine Learning with Gaussian Processes./
作者:
Peng, Hao.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:
90 p.
附註:
Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
Contained By:
Dissertation Abstracts International78-12B(E).
標題:
Computer science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10269758
ISBN:
9780355089172
Efficient Bayesian Machine Learning with Gaussian Processes.
Peng, Hao.
Efficient Bayesian Machine Learning with Gaussian Processes.
- Ann Arbor : ProQuest Dissertations & Theses, 2017 - 90 p.
Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
Thesis (Ph.D.)--Purdue University, 2017.
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.
ISBN: 9780355089172Subjects--Topical Terms:
523869
Computer science.
Efficient Bayesian Machine Learning with Gaussian Processes.
LDR
:03275nmm a2200313 4500
001
2156378
005
20180517112609.5
008
190424s2017 ||||||||||||||||| ||eng d
020
$a
9780355089172
035
$a
(MiAaPQ)AAI10269758
035
$a
(MiAaPQ)purdue:21206
035
$a
AAI10269758
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Peng, Hao.
$3
1919537
245
1 0
$a
Efficient Bayesian Machine Learning with Gaussian Processes.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2017
300
$a
90 p.
500
$a
Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
500
$a
Advisers: Yuan Qi; Ninghui Li.
502
$a
Thesis (Ph.D.)--Purdue University, 2017.
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.
590
$a
School code: 0183.
650
4
$a
Computer science.
$3
523869
690
$a
0984
710
2
$a
Purdue University.
$b
Computer Sciences.
$3
1019069
773
0
$t
Dissertation Abstracts International
$g
78-12B(E).
790
$a
0183
791
$a
Ph.D.
792
$a
2017
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10269758
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9355925
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入