Block-Iterative Algorithms for Non-Negative Matrix Approximation

Sra, S

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

Block-Iterative Algorithms for Non-Negative Matrix Approximation

MPS-Authors

/persons/resource/persons76142

Sra, S
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

MPIK-TR-176.pdf
(出版社版), 398KB

付随資料 (公開)

There is no public supplementary material available

引用

Sra, S.(2008). Block-Iterative Algorithms for Non-Negative Matrix Approximation (176). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-C761-F

要旨

In this report we present new algorithms for non-negative matrix approximation (NMA),
commonly known as the NMF problem. Our methods improve upon the well-known methods of Lee
Seung [19] for both the Frobenius norm as well the Kullback-Leibler divergence versions of the problem.
For the latter problem, our results are especially interesting because it seems to have witnessed much
lesser algorithmic progress as compared to the Frobenius norm NMA problem. Our algorithms are
based on a particular block-iterative acceleration technique for EM, which preserves the multiplicative
nature of the updates and also ensures monotonicity. Furthermore, our algorithms also naturally apply
to the Bregman-divergence NMA algorithms of Dhillon and Sra [8]. Experimentally, we show that our
algorithms outperform the traditional Lee/Seung approach most of the time.