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 \emph{screening effect}, which refers to the phenomenon in which the linear prediction of a process $Z$ at a point $\mathbf{x}_0$ depends primarily on measurements nearest to $\mathbf{x}_0$. But simple perturbations, such as i.i.d. 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 (1988), 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.
翻译:大规模接近高斯日志相似性的常见方法利用了精确矩阵在某些情况下可以与稀少的基质相近这一事实。 该战略的动机是 \ emph{ 筛选效果}, 它指的是一个现象, 即对一个过程的线性预测在 $\ mathbf{x ⁇ %0$ 的点上主要取决于最接近于 $\ mathbf{x ⁇ 0$的测量。 但是, 简单的扰动, 如 i.d. 测量噪音, 能够大大降低这种可利用现象发生的程度。 虽然对付这一问题的战略已经存在,而且显然在忽视这一问题方面有了改进,但在这项工作中,我们提出了一个基于EM算法的新现象,具有若干优势。 在这项工作中,我们把重点放在对Vecchia的近距离(一个特别受欢迎和强大的框架)的应用上, 我们可以展示M 步骤的真正的第二阶次优化, 这种方法也可以使用完全的基质测量产品来应用, 使该方法适用于非常广泛的精确的基质接近方法。