UserReg: A Simple but Strong Model for Rating Prediction
- URL: http://arxiv.org/abs/2102.07601v1
- Date: Mon, 15 Feb 2021 15:44:29 GMT
- Title: UserReg: A Simple but Strong Model for Rating Prediction
- Authors: Haiyang Zhang, Ivan Ganchev, Nikola S. Nikolov, Mark Stevenson
- Abstract summary: Collaborative filtering (CF) has achieved great success in the field of recommender systems.
This paper proposes a simple linear model based on Matrix Factorization (MF), called UserReg, which regularizes users' latent representations with explicit feedback for rating prediction.
Experimental results show that UserReg achieves overall better performance than the fine-tuned baselines considered and is highly competitive when compared with other recently proposed models.
- Score: 12.149991243126808
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Collaborative filtering (CF) has achieved great success in the field of
recommender systems. In recent years, many novel CF models, particularly those
based on deep learning or graph techniques, have been proposed for a variety of
recommendation tasks, such as rating prediction and item ranking. These newly
published models usually demonstrate their performance in comparison to
baselines or existing models in terms of accuracy improvements. However, others
have pointed out that many newly proposed models are not as strong as expected
and are outperformed by very simple baselines.
This paper proposes a simple linear model based on Matrix Factorization (MF),
called UserReg, which regularizes users' latent representations with explicit
feedback information for rating prediction. We compare the effectiveness of
UserReg with three linear CF models that are widely-used as baselines, and with
a set of recently proposed complex models that are based on deep learning or
graph techniques. Experimental results show that UserReg achieves overall
better performance than the fine-tuned baselines considered and is highly
competitive when compared with other recently proposed models. We conclude that
UserReg can be used as a strong baseline for future CF research.
Related papers
- Performance Comparison of Session-based Recommendation Algorithms based on GNNs [6.617487928813376]
In session-based recommendation settings, a recommender system has no access to long-term user profiles.
We present the results of an evaluation of eight recent GNN-based approaches that were published in high-quality outlets.
arXiv Detail & Related papers (2023-12-27T19:24:26Z) - Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
We present a code that successfully replicates results from six popular and recent graph recommendation models.
We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations.
By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
arXiv Detail & Related papers (2023-08-01T09:31:44Z) - Attentive Graph-based Text-aware Preference Modeling for Top-N
Recommendation [2.3991565023534083]
We propose a new model named Attentive Graph-based Text-aware Recommendation Model (AGTM)
In this work, we aim to further improve top-N recommendation by effectively modeling both item textual content and high-order connectivity in user-item graph.
arXiv Detail & Related papers (2023-05-22T12:32:06Z) - Universal Domain Adaptation from Foundation Models: A Baseline Study [58.51162198585434]
We make empirical studies of state-of-the-art UniDA methods using foundation models.
We introduce textitCLIP distillation, a parameter-free method specifically designed to distill target knowledge from CLIP models.
Although simple, our method outperforms previous approaches in most benchmark tasks.
arXiv Detail & Related papers (2023-05-18T16:28:29Z) - Multidimensional Item Response Theory in the Style of Collaborative
Filtering [0.8057006406834467]
This paper presents a machine learning approach to multidimensional item response theory (MIRT)
Inspired by collaborative filtering, we define a general class of models that includes many MIRT models.
We discuss the use of penalized joint maximum likelihood (JML) to estimate individual models and cross-validation to select the best performing model.
arXiv Detail & Related papers (2023-01-03T00:56:27Z) - Investigating Ensemble Methods for Model Robustness Improvement of Text
Classifiers [66.36045164286854]
We analyze a set of existing bias features and demonstrate there is no single model that works best for all the cases.
By choosing an appropriate bias model, we can obtain a better robustness result than baselines with a more sophisticated model design.
arXiv Detail & Related papers (2022-10-28T17:52:10Z) - Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions.
OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences.
We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
arXiv Detail & Related papers (2022-09-12T09:19:22Z) - Re-parameterizing Your Optimizers rather than Architectures [119.08740698936633]
We propose a novel paradigm of incorporating model-specific prior knowledge into Structurals and using them to train generic (simple) models.
As an implementation, we propose a novel methodology to add prior knowledge by modifying the gradients according to a set of model-specific hyper- parameters.
For a simple model trained with a Repr, we focus on a VGG-style plain model and showcase that such a simple model trained with a Repr, which is referred to as Rep-VGG, performs on par with the recent well-designed models.
arXiv Detail & Related papers (2022-05-30T16:55:59Z) - Top-N Recommendation with Counterfactual User Preference Simulation [26.597102553608348]
Top-N recommendation, which aims to learn user ranking-based preference, has long been a fundamental problem in a wide range of applications.
In this paper, we propose to reformulate the recommendation task within the causal inference framework to handle the data scarce problem.
arXiv Detail & Related papers (2021-09-02T14:28:46Z) - Interpretable Learning-to-Rank with Generalized Additive Models [78.42800966500374]
Interpretability of learning-to-rank models is a crucial yet relatively under-examined research area.
Recent progress on interpretable ranking models largely focuses on generating post-hoc explanations for existing black-box ranking models.
We lay the groundwork for intrinsically interpretable learning-to-rank by introducing generalized additive models (GAMs) into ranking tasks.
arXiv Detail & Related papers (2020-05-06T01:51:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.