On Application of Block Kaczmarz Methods in Matrix Factorization
원문 초록
Matrix factorization techniques compute low-rank product approximations of high dimensional data matrices and as a result, are often employed in recommender systems and collaborative filtering applications. However, many algorithms for this task utilize an exact least-squares solver whose computation is time consuming and memory-expensive. In this paper we discuss and test a block Kaczmarz solver that replaces the least-squares subroutine in the common alternating scheme for matrix factorization. This variant trades a small increase in factorization error for significantly faster algorithmic performance. In doing so we find block sizes that produce a solution comparable to that of the least-squares solver for only a fraction of the runtime and working memory requirement.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
Uncertainty in Repeated Implicit Feedback as a Measure of Reliability
Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.