paper-with-me

Papers

Diversely Regularized Matrix Factorization for Accurate and Aggregately Diversified Recommendation

2022-10-19 · Jongjin Kim, Hyunsik Jeon, Jaeri Lee, U Kang

When recommending personalized top-$k$ items to users, how can we recommend the items diversely to them while satisfying their needs? Aggregately diversified recommender systems aim to recommend a variety of items across whole users without sacrificing the recommendation accuracy. They increase the exposure opportunities of various items, which in turn increase potential revenue of sellers as well as user satisfaction. However, it is challenging to tackle aggregate-level diversity with a matrix factorization (MF), one of the most common recommendation model, since skewed real world data lead to skewed recommendation results of MF. In this work, we propose DivMF (Diversely Regularized Matrix Factorization), a novel matrix factorization method for aggregately diversified recommendation. DivMF regularizes a score matrix of an MF model to maximize coverage and entropy of top-$k$ recommendation lists to aggregately diversify the recommendation results. We also propose an unmasking mechanism and carefully designed mi i-batch learning technique for accurate and efficient training. Extensive experiments on real-world datasets show that DivMF achieves the state-of-the-art performance in aggregately diversified recommendation.

📄 PDF Abstract BibTeX arXiv:2211.01328

Code (1)

divmf/divmf 공식 구현 pytorch

Tasks

DiversityRecommendation Systems

Similar Papers 제목 키워드 기반

On the Loss Landscape Geometry of Regularized Deep Matrix Factorization: Uniqueness and Sharpness

2026-03-28 · Anil Kamber, Rahul Parhi arxiv

Weight decay is ubiquitous in training deep neural network architectures. Its empirical success is often attributed to capacity control; nonetheless, our theoretical understanding of its effect on the loss landscape and …

Unsupervised Selective Manifold Regularized Matrix Factorization

2020-10-20 · Priya Mani, Carlotta Domeniconi, Igor Griva

Manifold regularization methods for matrix factorization rely on the cluster assumption, whereby the neighborhood structure of data in the input space is preserved in the factorization space. We argue that using the k-ne…

Clustering

Error bound of critical points and KL property of exponent $1/2$ for squared F-norm regularized factorization

2019-11-11 · Ting Tao, Shaohua Pan, Shujun Bi

This paper is concerned with the squared F(robenius)-norm regularized factorization form for noisy low-rank matrix recovery problems. Under a suitable assumption on the restricted condition number of the Hessian for the …

KL property of exponent $1/2$ of $\ell_{2,0}$-norm and DC regularized factorizations for low-rank matrix recovery

2019-08-24 · Shujun Bi, Ting Tao, Shaohua Pan

This paper is concerned with the factorization form of the rank regularized loss minimization problem. To cater for the scenario in which only a coarse estimation is available for the rank of the true matrix, an $\ell_{2…

Column $\ell_{2,0}$-norm regularized factorization model of low-rank matrix recovery and its computation

2020-08-24 · Ting Tao, Yitian Qian, Shaohua Pan

This paper is concerned with the column $\ell_{2,0}$-regularized factorization model of low-rank matrix recovery problems and its computation. The column $\ell_{2,0}$-norm of factor matrices is introduced to promote colu…

Matrix Completion