arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.06115math.NAcs.NA
收藏

使用层次分解的高效可扩展核矩阵近似

Efficient and Scalable Kernel Matrix Approximations using Hierarchical Decomposition

Keerthi Gaddameedi, Severin Reiz, Tobias Neckel, Hans-Joachim Bungartz

AI总结:

本文结合datafold和GOFMM框架,利用层次分解在Lanczos迭代中近似计算扩散映射的特征分解,将复杂度从O(N^3)降至O(NlogN),并在scurve和MNIST数据集上验证了可扩展性。

摘要:

随着人工智能的出现,数值算法正朝着更近似的方法发展。对于PCA或扩散映射等方法,需要计算大矩阵的特征值,该矩阵可能因核函数而变得稠密。全局方法,即需要同时处理所有数据点的方法,其规模随数据维度N而非内在维度d变化;精确稠密特征分解的复杂度为$\mathcal{O}(N^{3})$。我们结合了两个框架,$\mathsf{datafold}$和$\mathsf{GOFMM}$。第一个框架计算扩散映射,其计算瓶颈是特征分解,而第二个框架我们在迭代Lanczos方法内近似计算特征分解。层次近似方法的运行时间复杂度约为$\mathcal{O}(N\log(N))$,而经典方法为$\mathcal{O}(N^{3})$。我们在两个基准数据集——scurve和MNIST——上评估了该方法,使用OpenMP和MPI对最大尺寸为$100k\times100k$的稠密矩阵进行了强扩展和弱扩展测试。

英文摘要:

With the emergence of Artificial Intelligence, numerical algorithms are moving towards more approximate approaches. For methods such as PCA or diffusion maps, it is necessary to compute eigenvalues of a large matrix, which may also be dense depending on the kernel. A global method, i.e. a method that requires all data points simultaneously, scales with the data dimension N and not with the intrinsic dimension d; the complexity for an exact dense eigendecomposition leads to $\mathcal{O}(N^{3})$. We have combined the two frameworks, $\mathsf{datafold}$ and $\mathsf{GOFMM}$. The first framework computes diffusion maps, where the computational bottleneck is the eigendecomposition while with the second framework we compute the eigendecomposition approximately within the iterative Lanczos method. A hierarchical approximation approach scales roughly with a runtime complexity of $\mathcal{O}(Nlog(N))$ vs. $\mathcal{O}(N^{3})$ for a classic approach. We evaluate the approach on two benchmark datasets -- scurve and MNIST -- with strong and weak scaling using OpenMP and MPI on dense matrices with maximum size of $100k\times100k$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑