Nonnegative Matrix Factorization Using Autoencoders And Exponentiated Gradient Descent
Lists
Only you see this
Abstract
We introduce a new autoencoder-based algorithm for non-negative matrix factorization. Instead of stochastic gradient descent-based update rules, our approach employs exponentiated gradient decent which, unlike the former, inherently guarantees the non-negativity of basis vectors when they are initialized to non-negative values. Moreover, we explore the potential of our autoencoder-based non-negative matrix factorization model for clustering applications, and show that it can learn hierarchical factorizations, each of which corresponding to a different and meaningful clustering. Further, we show that adding a supervised loss at intermediate layers results in more diverse representations at the different layers of the NMF hierarchy. We provide extensive empirical evaluations on text and image datasets and compare our proposed model to two alternative approaches, including another autoencoder-based algorithm.
BibTeX
@inproceedings{khatib2018nonnegative,
author = {Alaa El Khatib and Shimeng Huang and Ali Ghodsi and Fakhri Karray},
title = {{Nonnegative Matrix Factorization Using Autoencoders And Exponentiated Gradient Descent}},
booktitle = {IJCNN},
year = {2018},
url = {https://openreview.net/forum?id=gH4fEEY8CnKL},
}Loading related content...