矩阵计算的方差缩减及其在高斯过程中的应用
Variance Reduction for Matrix Computations with Applications to Gaussian Processes
Anant Mathur · Sarat Moka · Zdravko Botev
中文摘要
除计算速度和内存的最新进展外,方法学进步也显著提升了随机模拟的性能。聚焦通过矩阵分解实现矩阵计算的方差缩减,深入分析估计大矩阵元素时的现有方差缩减方法。常用方法未利用矩阵分解后可实现的方差降低。展示计算矩阵的平方根分解在某些重要情形下可获得任意更好的随机性能。详述矩阵乘积迹的分解估计器,数值实验表明在估计高斯过程对数似然的某些问题上效率可提升至多1,000倍。此外,提出对称正定矩阵对数行列式的新估计器,将对数行列式视为概率密度的归一化常数。
关键要点
- 01常用方差缩减方法未利用矩阵分解带来的方差降低
- 02平方根分解在某些重要情形下可实现任意更好的随机性能
- 03矩阵乘积迹的分解估计器在高斯过程对数似然估计中效率提升至多1,000倍
- 04提出对称正定矩阵对数行列式的新估计器,将其视为概率密度归一化常数
解读
尚无解读。
原始英文摘要
arXiv:2106.14565v4 Announce Type: replace Abstract: In addition to recent developments in computing speed and memory, methodological advances have contributed to significant gains in the performance of stochastic simulation. In this paper we focus on variance reduction for matrix computations via matrix factorization. We provide insights into existing variance reduction methods for estimating the entries of large matrices. Popular methods do not exploit the reduction in variance that is possible when the matrix is factorized. We show how computing the square root factorization of the matrix can achieve in some important cases arbitrarily better stochastic performance. In addition, we detail a factorized estimator for the trace of a product of matrices and numerically demonstrate that the estimator can be up to 1,000 times more efficient on certain problems of estimating the log-likelihood of a Gaussian process. Additionally, we provide a new estimator of the log-determinant of a symmetric positive-definite matrix where the log-determinant is treated as a normalizing constant of a probability density.