arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1711.11269math.NAcs.NAmath.AG
收藏

有限维中复数最佳$r$-项近似几乎总是存在的

Complex best $r$-term approximations almost always exist in finite dimensions

University of Chicago(芝加哥大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学促进研究所数学系);Polish Academy of Sciences(波兰科学院)

Yang Qi, Mateusz Michałek, Lek-Heng Lim

AI总结:

本文研究了有限维非线性近似中复数最佳$r$-项近似的存在性,证明在复数域下几乎总是可达到,但在实数域下不一定成立,并扩展到具有特殊性质的函数。

摘要:

我们证明在有限维非线性近似中,函数$f$的最佳$r$-项近似几乎总是存在复数域上,但不在实数域上成立。即,对于$f_1,\dots,f_r\in Y$,$\inf_{f_1,\dots,f_r\in Y}\lVert f - f_1 - \dots - f_r \rVert$几乎总是由复值函数$f_1,\dots,f_r$在$Y$中达到,$Y$是具有某些期望结构的函数集。我们的结果扩展到具有对称或反对称性质的函数。当$Y$是分离函数集时,问题变为最佳秩$r$张量近似问题。我们证明在复数域下,任何张量几乎总是有唯一的最佳秩$r$近似。此结果扩展到其他张量秩概念,如对称秩和交替秩,最佳$r$-块项近似,以及最佳张量网络近似。当应用于稀疏加低秩近似时,我们得到对于任何给定的$r$和$k$,一般张量有唯一的最佳近似,由一个秩$r$张量和一个固定稀疏模式的$k$-稀疏张量之和构成;这例如出现在高斯隐藏变量模型的协方差矩阵估计中。我们的结果的存在的部分也适用于无固定稀疏模式的秩$r$张量与$k$-稀疏张量之和的最佳近似,以及张量补全问题。

英文摘要:

We show that in finite-dimensional nonlinear approximations, the best $r$-term approximant of a function $f$ almost always exists over $\mathbb{C}$ but that the same is not true over $\mathbb{R}$, i.e., the infimum $\inf_{f_1,\dots,f_r \in Y} \lVert f - f_1 - \dots - f_r \rVert$ is almost always attainable by complex-valued functions $f_1,\dots, f_r$ in $Y$, a set of functions that have some desired structures. Our result extends to functions that possess special properties like symmetry or skew-symmetry under permutations of arguments. For the case where $Y$ is the set of separable functions, the problem becomes that of best rank-$r$ tensor approximations. We show that over $\mathbb{C}$, any tensor almost always has a unique best rank-$r$ approximation. This extends to other notions of tensor ranks such as symmetric rank and alternating rank, to best $r$-block-terms approximations, and to best approximations by tensor networks. When applied to sparse-plus-low-rank approximations, we obtain that for any given $r$ and $k$, a general tensor has a unique best approximation by a sum of a rank-$r$ tensor and a $k$-sparse tensor with a fixed sparsity pattern; this arises in, for example, estimation of covariance matrices of a Gaussian hidden variable model with $k$ observed variables conditionally independent given $r$ hidden variables. The existential (but not the uniqueness) part of our result also applies to best approximations by a sum of a rank-$r$ tensor and a $k$-sparse tensor with no fixed sparsity pattern, as well as to tensor completion problems.

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

↑