• Corpus ID: 239050166

A Row-Wise Update Algorithm for Sparse Stochastic Matrix Factorization

  title={A Row-Wise Update Algorithm for Sparse Stochastic Matrix Factorization},
  author={Guiyun Xiao and Zhengjian Bai and Wai-Ki Ching},
Nonnegative matrix factorization arises widely in machine learning and data analysis. In this paper, for a given factorization of rank r, we consider the sparse stochastic matrix factorization (SSMF) of decomposing a prescribed m-by-n stochastic matrix V into a product of an m-by-r stochastic matrix W and a sparse r-by-n stochastic matrix H. With the prescribed sparsity level, we reformulate the SSMF as an unconstrained nonvonvex-nonsmooth minimization problem and introduce a row-wise update… 

Figures and Tables from this paper


On Algorithms for Sparse Multi-factor NMF
  • Siwei Lyu, Xin Wang
  • Computer Science, Mathematics
  • 2013
A new simple and efficient algorithm for multi-factor nonnegative matrix factorization (mfNMF) problem that generalizes the original NMF problem to more than more than two factors is described and extended to incorporate a regularizer based on the Dirichlet distribution.
A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
This paper considers regularized block multiconvex optimization, where the feasible set and objective function are generally nonconvex but convex in each block of variables and proposes a generalized block coordinate descent method.
Smooth nonnegative matrix and tensor factorizations for robust multi-way data analysis
New efficient algorithms for nonnegative matrix factorization (NMF) with smoothness constraints imposed on nonnegative components or factors are discussed to alleviate certain ambiguity problems, which facilitates better physical interpretation or meaning.
Algorithms for Non-negative Matrix Factorization
Two different multiplicative algorithms for non-negative matrix factorization are analyzed and one algorithm can be shown to minimize the conventional least squares error while the other minimizes the generalized Kullback-Leibler divergence.
Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering
This paper proposes a non-negative low-rank matrix factorization (NLMF) method for image clustering, and develops an efficient alternating iterative algorithm to learn the low-dimensional representation of low- rank parts of images for clustering.
Learning from Incomplete Ratings Using Non-negative Matrix Factorization
Two variations on Non-negative Matrix Factorization (NMF) are introduced: one based on the Expectation-Maximization (EM) procedure and the other a Weighted Nonnegative Matrix factorization (WNMF), which obtain the best prediction performance compared with other popular collaborative filtering algorithms in experiments.
Fault Detection Using Structured Joint Sparse Nonnegative Matrix Factorization
A novel FD approach using the structured joint sparse NMF (SJSNMF) for non-Gaussian processes using the graph Laplacian to preserve the relationship between process variables and operation units and introduce the joint sparsity to exploit row-wise sparsity of the latent variables is proposed.
Efficient projections onto the l1-ball for learning in high dimensions
Efficient algorithms for projecting a vector onto the l1-ball are described and variants of stochastic gradient projection methods augmented with these efficient projection procedures outperform interior point methods, which are considered state-of-the-art optimization techniques.
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
An algorithm for nonconvex optimization is proposed and its global convergence (of the whole sequence) to a critical point is established and its asymptotic convergence rate is given and numerically demonstrated.
Structural properties of affine sparsity constraints
A number of fundamental structural properties of the solution set of such a non-standard system of inequalities, including its closedness and the description of its closure, continuous approximations and their set convergence, and characterizations of its tangent cones are investigated for use in optimization.