Block-Iterative Algorithms for Non-Negative Matrix Approximation

Sra, S

Local TagsRelease HistoryDetailsSummary

Block-Iterative Algorithms for Non-Negative Matrix Approximation

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

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C761-F Version Permalink: https://hdl.handle.net/21.11116/0000-0002-8708-D

Genre: Report

Files

show Files

hide Files

:

MPIK-TR-176.pdf (Publisher version), 398KB

View Save

File Permalink:
https://hdl.handle.net/21.11116/0000-0002-8709-C

Name:
MPIK-TR-176.pdf

Description:
-

OA-Status:

Visibility:
Public

MIME-Type / Checksum:
application/pdf / [MD5]

Technical Metadata:

View

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Sra, S^{1, 2}, Author

Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794

Content

show

hide

Free keywords: -

Abstract: 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.

Details

show

hide

Language(s):

Dates: Date issued: 2008-09

Publication Status: Issued

Pages: 16

Publishing info: Tübingen, Germany : Max Planck Institute for Biological Cybernetics

Table of Contents: -

Rev. Type: -

Identifiers: Report Nr.: 176
BibTex Citekey: 5556

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Technical Report of the Max Planck Institute for Biological Cybernetics

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 176 Sequence Number: - Start / End Page: - Identifier: -