资源分类
》 资源 》论文》Low-Rank Tucker Decomposition of Large Tensors Using TensorSketch

Low-Rank Tucker Decomposition of Large Tensors Using TensorSketch

2020-02-13 | |  59 |   41 |   0

Abstract

 We propose two randomized algorithms for low-rank Tucker decomposition of tensors. The algorithms, which incorporate sketching, only require a single pass of the input tensor and can handle tensors whose elements are streamed in any order. To the best of our knowledge, ours are the only algorithms which can do this. We test our algorithms on sparse synthetic data and compare them to multiple other methods. We also apply one of our algorithms to a real dense 38 GB tensor representing a video and use the resulting decomposition to correctly classify frames containing disturbances.

上一篇：Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression

下一篇：Exact natural gradient in deep linear networks and application to the nonlinear case

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...