A Quasi-Newton Matrix Factorization-Based Model for Recommendation

IF 0.8 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Web Services Research Pub Date : 2023-12-11 DOI:10.4018/ijwsr.334703
Shiyun Shao, Yunni Xia, Kaifeng Bai, Xiaoxin Zhou
{"title":"A Quasi-Newton Matrix Factorization-Based Model for Recommendation","authors":"Shiyun Shao, Yunni Xia, Kaifeng Bai, Xiaoxin Zhou","doi":"10.4018/ijwsr.334703","DOIUrl":null,"url":null,"abstract":"Solving large-scale non-convex optimization problems is the fundamental challenge in the development of matrix factorization (MF)-based recommender systems. Unfortunately, employing conventional first-order optimization approaches proves to be an arduous endeavor since their curves are very complex. The exploration of second-order optimization methods holds great promise. They are more powerful because they consider the curvature of the optimization problem, which is captured by the second-order derivatives of the objective function. However, a significant obstacle arises when directly applying Hessian-based approaches: their computational demands are often prohibitively high. Therefore, the authors propose AdaGO, a novel quasi-Newton method-based optimizer to meet the specific requirements of large-scale non-convex optimization problems. AdaGO can strike a balance between computational efficiency and optimization performance. In the comparative studies with state-of-the-art MF-based models, AdaGO demonstrates its superiority by achieving higher prediction accuracy.","PeriodicalId":54936,"journal":{"name":"International Journal of Web Services Research","volume":"19 2","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Services Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4018/ijwsr.334703","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Solving large-scale non-convex optimization problems is the fundamental challenge in the development of matrix factorization (MF)-based recommender systems. Unfortunately, employing conventional first-order optimization approaches proves to be an arduous endeavor since their curves are very complex. The exploration of second-order optimization methods holds great promise. They are more powerful because they consider the curvature of the optimization problem, which is captured by the second-order derivatives of the objective function. However, a significant obstacle arises when directly applying Hessian-based approaches: their computational demands are often prohibitively high. Therefore, the authors propose AdaGO, a novel quasi-Newton method-based optimizer to meet the specific requirements of large-scale non-convex optimization problems. AdaGO can strike a balance between computational efficiency and optimization performance. In the comparative studies with state-of-the-art MF-based models, AdaGO demonstrates its superiority by achieving higher prediction accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于准牛顿矩阵因式分解的推荐模型
解决大规模非凸优化问题是开发基于矩阵因式分解(MF)的推荐系统所面临的基本挑战。遗憾的是,采用传统的一阶优化方法证明是一项艰巨的工作,因为它们的曲线非常复杂。二阶优化方法的探索前景广阔。二阶优化方法考虑了优化问题的曲率,并通过目标函数的二阶导数加以捕捉,因此功能更为强大。然而,在直接应用基于 Hessian 的方法时会遇到一个重大障碍:它们的计算要求往往高得令人望而却步。因此,作者提出了基于准牛顿法的新型优化器 AdaGO,以满足大规模非凸优化问题的特殊要求。AdaGO 可以在计算效率和优化性能之间取得平衡。在与最先进的基于 MF 的模型的比较研究中,AdaGO 通过获得更高的预测精度证明了其优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Web Services Research
International Journal of Web Services Research 工程技术-计算机:软件工程
CiteScore
2.40
自引率
0.00%
发文量
19
审稿时长
>12 weeks
期刊介绍: The International Journal of Web Services Research (IJWSR) is the first refereed, international publication featuring the latest research findings and industry solutions involving all aspects of Web services technology. This journal covers advancements, standards, and practices of Web services, as well as identifies emerging research topics and defines the future of Web services on grid computing, multimedia, and communication. IJWSR provides an open, formal publication for high quality articles developed by theoreticians, educators, developers, researchers, and practitioners for those desiring to stay abreast of challenges in Web services technology.
期刊最新文献
A Quasi-Newton Matrix Factorization-Based Model for Recommendation A Service Recommendation Algorithm Based on Self-Attention Mechanism and DeepFM Secure Cloud Storage and Retrieval of Personal Health Data From Smart Wearable Devices With Privacy-Preserving Techniques User Interaction Within Online Innovation Communities Research on a New Reconstruction Technology and Evaluation Method for 3D Digital Core Pore Structure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1