arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.06359math.NAcs.NAstat.CO
收藏

完全对称核quadrature

Fully symmetric kernel quadrature

Toni Karvonen, Simo Särkkä

摘要:

核求积和其他基于核的近似方法通常在函数求值的数量方面遭受令人望而却步的三次时间和二次空间复杂度。这个问题的出现是因为需要求解一个线性方程组。在这篇文章中,我们表明,核求积规则的权重可以有效地计算和准确地高达数千万个节点,如果内核,积分域和措施是完全对称的,节点集是一个工会的完全对称集。这是基于这样的观察,即在这样的设置中,仅存在与完全对称集一样多的不同权重,并且这些权重可以从由完全核矩阵的某些子矩阵的行和构造的方程的线性系求解。我们提出了几个数值例子,显示出可行性,无论是大量的节点和高维,发达国家完全对称核求积规则。最突出的完全对称核求积规则,我们提出的是那些使用稀疏网格。

英文摘要:

Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs to be solved. In this article we show that the weights of a kernel quadrature rule can be computed efficiently and exactly for up to tens of millions of nodes if the kernel, integration domain, and measure are fully symmetric and the node set is a union of fully symmetric sets. This is based on the observations that in such a setting there are only as many distinct weights as there are fully symmetric sets and that these weights can be solved from a linear system of equations constructed out of row sums of certain submatrices of the full kernel matrix. We present several numerical examples that show feasibility, both for a large number of nodes and in high dimensions, of the developed fully symmetric kernel quadrature rules. Most prominent of the fully symmetric kernel quadrature rules we propose are those that use sparse grids.

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

↑