6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Negative Binomial Matrix Completion

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Matrix completion focuses on recovering missing or incomplete information in matrices. This problem arises in various applications, including image processing and network analysis. Previous research proposed Poisson matrix completion for count data with noise that follows a Poisson distribution, which assumes that the mean and variance are equal. Since overdispersed count data, whose variance is greater than the mean, is more likely to occur in realistic settings, we assume that the noise follows the negative binomial (NB) distribution, which can be more general than the Poisson distribution. In this paper, we introduce NB matrix completion by proposing a nuclear-norm regularized model that can be solved by proximal gradient descent. In our experiments, we demonstrate that the NB model outperforms Poisson matrix completion in various noise and missing data settings on real data.

          Related collections

          Author and article information

          Journal
          28 August 2024
          Article
          2408.16113
          4259fa86-f2f1-44bc-9d92-5cb331d61e34

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          6 pages, Accepted by the IEEE International Workshop on Machine Learning for Signal Processing (MLSP)
          cs.LG cs.CV eess.IV eess.SP math.OC

          Computer vision & Pattern recognition,Numerical methods,Artificial intelligence,Electrical engineering

          Comments

          Comment on this article