Comparison Between Stochastic Gradient Descent and VLE Metaheuristic for Optimizing Matrix Factorization

被引:0
|
作者
Gomez-Pulido, Juan A. [1 ]
Cortes-Toro, Enrique [2 ]
Duran-Dominguez, Arturo [1 ]
Lanza-Gutierrez, Jose M. [3 ]
Crawford, Broderick [4 ]
Soto, Ricardo [4 ]
机构
[1] Univ Extremadura, Badajoz, Spain
[2] Univ Playa Ancha, Valparaiso, Chile
[3] Univ Carlos III Madrid, Madrid, Spain
[4] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
来源
OPTIMIZATION AND LEARNING | 2020年 / 1173卷
关键词
Matrix factorization; Gradient descent; Metaheuristics; OPTIMIZATION; SEARCH;
D O I
10.1007/978-3-030-41913-4_13
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Matrix factorization is used by recommender systems in collaborative filtering for building prediction models based on a couple of matrices. These models are usually generated by stochastic gradient descent algorithm, which learns the model minimizing the error done. Finally, the obtained models are validated according to an error criterion by predicting test data. Since the model generation can be tackled as an optimization problem where there is a huge set of possible solutions, we propose to use metaheuristics as alternative solving methods for matrix factorization. In this work we applied a novel metaheuristic for continuous optimization, which works inspired by the vapour-liquid equilibrium. We considered a particular case were matrix factorization was applied: the prediction student performance problem. The obtained results surpassed thoroughly the accuracy provided by stochastic gradient descent.
引用
收藏
页码:153 / 164
页数:12
相关论文
共 50 条
  • [21] A comparison between gradient descent and stochastic approaches for parameter optimization of a sea ice model
    Sumata, H.
    Kauker, F.
    Gerdes, R.
    Koeberle, C.
    Karcher, M.
    [J]. OCEAN SCIENCE, 2013, 9 (04) : 609 - 630
  • [22] Gradient descent fisher non-negative matrix factorization for face recognition
    Liu, Yuhao
    Jia, Chengcheng
    Li, Bin
    Yu, Zhezhou
    [J]. Journal of Information and Computational Science, 2013, 10 (08): : 2453 - 2461
  • [23] Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization
    Ye, Tian
    Du, Simon S.
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [24] STRUCTURALLY-CONSTRAINED GRADIENT DESCENT FOR MATRIX FACTORIZATION IN HAPLOTYPE ASSEMBLY PROBLEMS
    Cai, Changxiao
    Sanghavi, Sujay
    Vikalo, Hanis
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS, 2016, : 2638 - 2641
  • [25] On a Relationship between Integral Compensation and Stochastic Gradient Descent
    Fujimoto, Yusuke
    Maruta, Ichiro
    Sugie, Toshiharu
    [J]. 2017 56TH ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS OF JAPAN (SICE), 2017, : 343 - 343
  • [26] A Comparison of Continuous-Time Approximations to Stochastic Gradient Descent
    Ankirchner, Stefan
    Perko, Stefan
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2024, 25 : 1 - 55
  • [27] Beyond Stochastic Gradient Descent for Matrix Completion Based Indoor Localization
    Njima, Wafa
    Zayani, Rafik
    Ahriz, Iness
    Terre, Michel
    Bouallegue, Ridha
    [J]. APPLIED SCIENCES-BASEL, 2019, 9 (12):
  • [28] Stochastic gradient descent for linear systems with sequential matrix entry accumulation
    Mukhopadhyay, Samrat
    [J]. SIGNAL PROCESSING, 2020, 171
  • [29] Stochastic gradient descent for linear systems with sequential matrix entry accumulation
    Mukhopadhyay, Samrat
    [J]. 1600, Elsevier B.V., Netherlands (171):
  • [30] Scaled stochastic gradient descent for low-rank matrix completion
    Mishra, Bamdev
    Sepulchre, Rodolphe
    [J]. 2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 2820 - 2825