Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A fast two-stage algorithm for non-negative matrix factorization in streaming data (2101.08431v1)

Published 21 Jan 2021 in math.OC, cs.NA, and math.NA

Abstract: In this article, we study algorithms for nonnegative matrix factorization (NMF) in various applications involving streaming data. Utilizing the continual nature of the data, we develop a fast two-stage algorithm for highly efficient and accurate NMF. In the first stage, an alternating non-negative least squares (ANLS) framework is used, in combination with active set method with warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. The results demonstrate the advantage of our algorithm in finding high-precision solutions.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Ran Gu (36 papers)
  2. Qiang Du (95 papers)
  3. Simon J. L. Billinge (54 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.