Optimization Online


A Matrix-Free Approach For Solving The Gaussian Process Maximum Likelihood Problem

Mihai Anitescu(anitescu***at***mcs.anl.gov)
Jie Chen(jiechen***at***mcs.anl.gov)
Lei Wang(lwang***at***mcs.anl.gov)

Abstract: Gaussian processes are the cornerstone of statistical analysis in many application ar- eas. Nevertheless, most of the applications are limited by their need to use the Cholesky factorization in the computation of the likelihood. In this work, we present a matrix-free approach for comput- ing the solution of the maximum likelihood problem involving Gaussian processes. The approach is based on a stochastic programming reformulation followed by sample average approximation applied to either the maximization problem or its optimality conditions. We provide statistical estimates of the approximate solution. The method is illustrated on several examples where the data is provided on a regular or irregular grid. In the latter case, the action of a covariance matrix on a vector is computed by means of fast multipole methods. For each of the examples presented, we demonstrate that the approach scales linearly with an increase in the number of sites.

Keywords: Gaussian process, maximum likelihood estimation, sample average approximation, preconditioned conjugate gradient, Toeplitz system, circulant preconditioner, fast multipole method

Category 1: Nonlinear Optimization (Unconstrained Optimization )

Category 2: Applications -- Science and Engineering (Statistics )

Citation: Preprint ANL/MCS-P1857-0311

Download: [PDF]

Entry Submitted: 05/19/2011
Entry Accepted: 05/19/2011
Entry Last Modified: 05/19/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society