ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Fast and Low Memory Cost Matrix Factorization: Algorithm, Analysis, and Case Study

Yan, Yan*; Tan, Mingkui; Tsang, Ivor W.; Yang, Yi; Shi, Qinfeng; Zhang, Chengqiy
IEEE Transactions on Knowledge and Data Engineering2020-2-1DOI: 10.1109/TKDE.2018.2882197
3被引5阅读
引用收藏
分享

摘要

Matrix factorization has been widely applied to various applications. With the fast development of storage and internet technologies, we have been witnessing a rapid increase of data. In this paper, we propose new algorithms for matrix factorization with the emphasis on efficiency. In addition, most existing methods of matrix factorization only consider a general smooth least square loss. Differently, many real-world applications have distinctive characteristics. As a result, different losses should be used accordingly. Therefore, it is beneficial to design new matrix factorization algorithms that are able to deal with both smooth and non-smooth losses. To this end, one needs to analyze the characteristics of target data and use the most appropriate loss based on the analysis. We particularly study two representative cases of low-rank matrix recovery, i.e., collaborative filtering for recommendation and high dynamic range imaging. To solve these two problems, we respectively propose a stage-wise matrix factorization algorithm by exploiting manifold optimization techniques. From our theoretical analysis, they are both are provably guaranteed to converge to a stationary point. Extensive experiments on recommender systems and high dynamic range imaging demonstrate the satisfactory performance and efficiency of our proposed method on large-scale real data.

学科与关键词

关键词
ImagingOptimizationRecommender systemsManifoldsConvergenceMinimizationDynamic rangeMatrix factorizationmatrix recoveryefficient optimizationconvergence guaranteesrecommender systemsHDR imagingbatch image alignment
相关
加载中…
  • A survey on deep matrix factorizations
    De Handschutter, Pierre*; Gillis, Nicolas; Siebert, XavierComputer Science Review, 2021, 42: 100423.被引 43
  • Adaptive Rank-One Matrix Completion Using Sum of Outer Products
    Wang, Zhi-Yong; Li, Xiao Peng*; So, Hing Cheung*; Zoubir, Abdelhak M.IEEE Transactions on Circuits and Systems for Video Technology, 2023, 33(9): 4868-4880.
  • Matrix Completion Based on Low-Rank and Local Features Applied to Images Recovery and Recommendation Systems
    Zhang, Ying; Xu, Kai; Liang, Songfeng*; Zhao, Chen*IEEE Access, 2022, 10: 97010-97021.
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Knowledge and Data Engineering
发表日期
2020-02-01
卷期
第 32 卷, 第 2 期
页码
288-301
DOI
10.1109/TKDE.2018.2882197
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE

作者

  • Y

    Yan, Yan (通讯) (第一作者)

  • T

    Tan, Mingkui

查看全部 6 位作者收起作者
  • T

    Tsang, Ivor W.

  • Y

    Yang, Yi

  • S

    Shi, Qinfeng

  • Z

    Zhang, Chengqi

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417