arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.13436math.NAcs.NA
收藏

基于最优最小二乘的树型张量网络主动学习

Active learning of tree tensor networks using optimal least-squares

Cécile Haberstich, Anthony Nouy, Guillaume Perrin

摘要:

在本文中,我们提出了新的学习算法近似高维函数,在最小二乘设置使用树张量网络。给定张量网络的维度树或架构,我们提供了一种算法,该算法基于多元函数的主成分分析的推广来生成嵌套张量子空间的序列。一个最佳的最小二乘法用于计算投影到生成的张量子空间,使用的样本从分布取决于先前生成的子空间。我们提供了一个误差界的期望所获得的近似。实用的策略,提出了适应的特征空间和排名,以实现规定的错误。此外,我们提出了一种算法,逐步构建的维度树,通过合适的配对的变量,允许进一步减少所需的样本的样本个数,以达到该错误。数值例子说明了所提出的算法的性能,并表明,稳定的近似得到的样本个数接近估计张量网络的自由参数的数量。

英文摘要:

In this paper, we propose new learning algorithms for approximating high-dimensional functions using tree tensor networks in a least-squares setting. Given a dimension tree or architecture of the tensor network, we provide an algorithm that generates a sequence of nested tensor subspaces based on a generalization of principal component analysis for multivariate functions. An optimal least-squares method is used for computing projections onto the generated tensor subspaces, using samples generated from a distribution depending on the previously generated subspaces. We provide an error bound in expectation for the obtained approximation. Practical strategies are proposed for adapting the feature spaces and ranks to achieve a prescribed error. Also, we propose an algorithm that progressively constructs the dimension tree by suitable pairings of variables, that allows to further reduce the number of samples necessary to reach that error. Numerical examples illustrate the performance of the proposed algorithms and show that stable approximations are obtained with a number of samples close to the number of free parameters of the estimated tensor networks.

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

↑