Scalable Gaussian Process Computations Using Hierarchical Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Matrices in Computations of Electron Dynamics

We discuss the approximation of the meanfield terms appearing in computations of the multi-configuration time-dependent Hartree–Fock method for the solution of the timedependent multi-particle (electronic) Schrödinger equation by hierarchical matrices. We give theoretical error bounds for the cross approximation defined by low rank approximations of admissible matrix sub-blocks, and illustrate ...

متن کامل

Hierarchical Gaussian Process Regression

We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while off-diagonal blocks are approximated. Partitioning input data points, we present a two-layer hierarchical model for GP regression, where prototypes of clusters in the upper layer are involved for coarse modeling by a GP...

متن کامل

Scalable Logit Gaussian Process Classification

We propose an efficient stochastic variational approach to Gaussian Process (GP) classification building on Pólya-Gamma data augmentation and inducing points, which is based on closed-form updates of natural gradients. We evaluate the algorithm on real-world datasets containing up to 11 million data points and demonstrate that it is up to two orders of magnitude faster than the state-of-the-art...

متن کامل

Scalable Variational Gaussian Process Classification

Gaussian process classification is a popular method with a number of appealing properties. We show how to scale the model within a variational inducing point framework, outperforming the state of the art on benchmark datasets. Importantly, the variational formulation can be exploited to allow classification in problems with millions of data points, as we demonstrate in experiments.

متن کامل

Parallel Computations for Hierarchical Agglomerative Clustering using CUDA Fast and Scalable Computations on Graphics Processors

Graphics Processing Units (GPU) in today’s desktops can well be thought of as a high performance parallel processor. Traditionally, parallel computing is the usage of multiple computing resources to execute computational problems simultaneously. Such computations are possible using multi-core CPUs or computers with multiple CPUs or by using a network of computers in parallel. Today’s GPUs are c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2019

ISSN: 1061-8600,1537-2715

DOI: 10.1080/10618600.2019.1652616