Monday, April 06, 2020, 16:00
The thesis focuses on the computation of high-dimensional multivariate normal (MVN) and multivariate Student-t (MVT) probabilities. Firstly, a generalization of the conditioning method for MVN probabilities is proposed and combined with the hierarchical matrix representation. Next, I revisit the Quasi-Monte Carlo (QMC) method and improve the state-of-the-art QMC method for MVN probabilities with block reordering, resulting in a ten-time-speed improvement. The thesis proceeds to discuss a novel matrix compression scheme using Kronecker products. This novel matrix compression method has a memory footprint smaller than the hierarchical matrices by more than one order of magnitude. A Cholesky factorization algorithm is correspondingly designed and shown to accomplish the factorization in 1 million dimensions within 600 seconds. To make the computational methods for MVN probabilities more accessible, I introduce an R package that implements the methods developed in this thesis and show that the package is currently the most scalable package for computing MVN probabilities in R. Finally, as an application, I derive the posterior properties of the probit Gaussian random field and show that the R package I introduce makes the model selection and posterior prediction feasible in high dimensions.