资源分类
》 资源 》论文》Multiresolution Matrix Factorization

Multiresolution Matrix Factorization

2020-03-04 | |  67 |   46 |   0

Abstract

Large matrices appearing in machine learning problems often have complex hierarchical structures that go beyond what can be found by traditional linear algebra tools, such as eigendecomposition. Inspired by ideas from multiresolution analysis, this paper introduces a new notion of matrix factorization that can capture struc ture in matrices at multiple different scales. The resulting Multiresolution Matrix Factorizations (MMFs) not only provide a wavelet basis for sparse approximation, but can also be used for matrix compression (similar to Nystr¨om approximations) and as a prior for matrix completion.

上一篇：Nearest Neighbors Using Compact Sparse Codes

下一篇：A Divide-and-Conquer Solver for Kernel Support Vector Machines

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...