A Scalable Method to Exploit Screening in Gaussian Process Models with Noise

被引:1
作者
Geoga, Christopher J. [1 ]
Stein, Michael L. [1 ]
机构
[1] Rutgers State Univ, Dept Stat, New Brunswick, NJ 08901 USA
关键词
EM algorithm; Gaussian processes; Stochastic trace estimation; Vecchia's approximation; MAXIMUM-LIKELIHOOD; ALGORITHM; EM; APPROXIMATION; MATRIX; SPARSE; TRACE;
D O I
10.1080/10618600.2023.2218027
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A common approach to approximating Gaussian log-likelihoods at scale exploits the fact that precision matrices can be well-approximated by sparse matrices in some circumstances. This strategy is motivated by the screening effect, which refers to the phenomenon in which the linear prediction of a process Z at a point x0 depends primarily on measurements nearest to x0. But simple perturbations, such as iid measurement noise, can significantly reduce the degree to which this exploitable phenomenon occurs. While strategies to cope with this issue already exist and are certainly improvements over ignoring the problem, in this work we present a new one based on the EM algorithm that offers several advantages. While in this work we focus on the application to Vecchia's approximation (Vecchia), a particularly popular and powerful framework in which we can demonstrate true second-order optimization of M steps, the method can also be applied using entirely matrix-vector products, making it applicable to a very wide class of precision matrix-based approximation methods. for this article are available online.
引用
收藏
页码:603 / 613
页数:11
相关论文
共 53 条
[1]   Fast Direct Methods for Gaussian Processes [J].
Ambikasaran, Sivaram ;
Foreman-Mackey, Daniel ;
Greengard, Leslie ;
Hogg, David W. ;
O'Neil, Michael .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2016, 38 (02) :252-265
[2]   A MATRIX-FREE APPROACH FOR SOLVING THE PARAMETRIC GAUSSIAN PROCESS MAXIMUM LIKELIHOOD PROBLEM [J].
Anitescu, Mihai ;
Chen, Jie ;
Wang, Lei .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (01) :A240-A262
[3]   Randomized Algorithms for Estimating the Trace of an Implicit Symmetric Positive Semi-Definite Matrix [J].
Avron, Haim ;
Toledo, Sivan .
JOURNAL OF THE ACM, 2011, 58 (02)
[4]  
Beckman P. G., 2022, SCALABLE COMPUTATION
[5]   Linear-Cost Covariance Functions for Gaussian Random Fields [J].
Chen, Jie ;
Stein, Michael L. .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2023, 118 (541) :147-164
[6]  
Chen Tianrui, 2022, arXiv
[7]   Fixed rank kriging for very large spatial data sets [J].
Cressie, Noel ;
Johannesson, Gardar .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2008, 70 :209-226
[8]   Hierarchical Nearest-Neighbor Gaussian Process Models for Large Geostatistical Datasets [J].
Datta, Abhirup ;
Banerjee, Sudipto ;
Finley, Andrew O. ;
Gelfand, Alan E. .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2016, 111 (514) :800-812
[9]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[10]   Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes [J].
Finley, Andrew O. ;
Datta, Abhirup ;
Cook, Bruce D. ;
Morton, Douglas C. ;
Andersen, Hans E. ;
Banerjee, Sudipto .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2019, 28 (02) :401-414