...
首页> 外文期刊>Linear Algebra and its Applications >Subtracting a best rank-1 approximation may increase tensor rank
【24h】

Subtracting a best rank-1 approximation may increase tensor rank

机译:减去最佳等级1逼近可能会增加张量等级

获取原文
获取原文并翻译 | 示例
           

摘要

It has been shown that a best rank-R approximation of an order-k tensor may not exist when R≥2 and k≥3. This poses a serious problem to data analysts using tensor decompositions. It has been observed numerically that, generally, this issue cannot be solved by consecutively computing and subtracting best rank-1 approximations. The reason for this is that subtracting a best rank-1 approximation generally does not decrease tensor rank. In this paper, we provide a mathematical treatment of this property for real-valued 2×2×2 tensors, with symmetric tensors as a special case. Regardless of the symmetry, we show that for generic 2×2×2 tensors (which have rank 2 or 3), subtracting a best rank-1 approximation results in a tensor that has rank 3 and lies on the boundary between the rank-2 and rank-3 sets. Hence, for a typical tensor of rank 2, subtracting a best rank-1 approximation increases the tensor rank.
机译:已经表明,当R≥2且k≥3时,可能不存在k阶张量的最佳rank-R近似。这给使用张量分解的数据分析人员带来了严重的问题。从数值上观察到,通常,不能通过连续计算和减去最佳等级1近似来解决此问题。其原因是,减去最佳等级-1近似值通常不会降低张量等级。在本文中,我们为实值2×2×2张量提供了对此属性的数学处理,其中对称张量为特例。无论对称性如何,我们都表明,对于一般2×2×2张量(具有等级2或3),减去最佳等级1近似将得出具有等级3且位于等级2之间的边界的张量和等级3集。因此,对于等级2的典型张量,减去最佳等级1逼近会增加张量等级。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号