资源分类
》 资源 》论文》A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound

A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound

2020-01-13 | |  69 |   59 |   0

Abstract

The CUR matrix decomposition is an important extension of Nystro?m approximation to a general matrix. It approximates any data matrix in terms of a small number of its columns and rows. In this paper we propose a novel randomized CUR algorithm with an expected relative-error bound. The proposed algorithm has the advantages over the existing relative-error CUR algorithms that it possesses tighter theoretical bound and lower time complexity, and that it can avoid maintaining the whole data matrix in main memory. Finally, experiments on several real-world datasets demonstrate significant improvement over the existing relative-error algorithms.

上一篇：Learning with Target Prior

下一篇：A Generative Model for Parts-based Object Segmentation

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...