paper-with-me

Papers

Primal-Dual Algorithms for Non-negative Matrix Factorization with the Kullback-Leibler Divergence

2014-12-04 · Felipe Yanez, Francis Bach

Non-negative matrix factorization (NMF) approximates a given matrix as a product of two non-negative matrices. Multiplicative algorithms deliver reliable results, but they show slow convergence for high-dimensional data and may be stuck away from local minima. Gradient descent methods have better behavior, but only apply to smooth losses such as the least-squares loss. In this article, we propose a first-order primal-dual algorithm for non-negative decomposition problems (where one factor is fixed) with the KL divergence, based on the Chambolle-Pock algorithm. All required computations may be obtained in closed form and we provide an efficient heuristic way to select step-sizes. By using alternating optimization, our algorithm readily extends to NMF and, on synthetic examples, face recognition or music source separation datasets, it is either faster than existing algorithms, or leads to improved local optima, or both.

📄 PDF Abstract BibTeX arXiv:1412.1788

Code (2)

felipeyanez/nmf
fnyanez/nmf

Tasks

Face RecognitionMusic Source Separation

Similar Papers 제목 키워드 기반

Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization

2024-03-29 · Maryam Abdolali, Giovanni Barbarino, Nicolas Gillis

Simplex-structured matrix factorization (SSMF) is a generalization of nonnegative matrix factorization, a fundamental interpretable data analysis model, and has applications in hyperspectral unmixing and topic modeling. …

Hyperspectral Unmixing

Sparse Linear Programming via Primal and Dual Augmented Coordinate Descent

2015-12-01 · NeurIPS 2015 12 · Ian En-Hsu Yen, Kai Zhong, Cho-Jui Hsieh, Pradeep K. Ravikumar 외

Over the past decades, Linear Programming (LP) has been widely used in different areas and considered as one of the mature technologies in numerical optimization. However, the complexity offered by state-of-the-art algor…

A New Alternating Direction Method for Linear Programming

2017-12-01 · NeurIPS 2017 12 · Sinong Wang, Ness Shroff

It is well known that, for a linear program (LP) with constraint matrix $\mathbf{A}\in\mathbb{R}^{m\times n}$, the Alternating Direction Method of Multiplier converges globally and linearly at a rate $O((\|\mathbf{A}\|_F…

Non-negative matrix factorization based on generalized dual divergence

2019-05-16 · Karthik Devarajan

A theoretical framework for non-negative matrix factorization based on generalized dual Kullback-Leibler divergence, which includes members of the exponential family of models, is proposed. A family of algorithms is deve…

Unsupervised Classification in Hyperspectral Imagery with Nonlocal Total Variation and Primal-Dual Hybrid Gradient Algorithm

2016-04-27 · Wei Zhu, Victoria Chayes, Alexandre Tiard, Stephanie Sanchez 외

In this paper, a graph-based nonlocal total variation method (NLTV) is proposed for unsupervised classification of hyperspectral images (HSI). The variational problem is solved by the primal-dual hybrid gradient (PDHG) a…

Classification Of Hyperspectral ImagesClusteringGeneral Classification