MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive Model Selection

• URL: http://arxiv.org/abs/2001.10378v3
• Date: Tue, 5 May 2020 03:18:32 GMT
• Title: MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive Model Selection
• Authors: Mi Luo, Fei Chen, Pengxiang Cheng, Zhenhua Dong, Xiuqiang He, Jiashi Feng, Zhenguo Li
• Abstract summary: We propose a meta-learning framework to facilitate user-level adaptive model selection in recommender systems. We conduct experiments on two public datasets and a real-world production dataset.
• Score: 110.87712780017819
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems often face heterogeneous datasets containing highly personalized historical data of users, where no single model could give the best recommendation for every user. We observe this ubiquitous phenomenon on both public and private datasets and address the model selection problem in pursuit of optimizing the quality of recommendation for each user. We propose a meta-learning framework to facilitate user-level adaptive model selection in recommender systems. In this framework, a collection of recommenders is trained with data from all users, on top of which a model selector is trained via meta-learning to select the best single model for each user with the user-specific historical data. We conduct extensive experiments on two public datasets and a real-world production dataset, demonstrating that our proposed framework achieves improvements over single model baselines and sample-level model selector in terms of AUC and LogLoss. In particular, the improvements may lead to huge profit gain when deployed in online recommender systems.

Related papers

• Context-aware adaptive personalised recommendation: a meta-hybrid [0.41436032949434404]
  We propose a meta-hybrid recommender that uses machine learning to predict an optimal algorithm. Based on the proposed model, it is possible to predict which recommender will provide the most precise recommendations to a user.
  arXiv  Detail & Related papers  (2024-10-17T09:24:40Z)
• MLRS-PDS: A Meta-learning recommendation of dynamic ensemble selection pipelines [3.1140073169854485]
  This paper introduces a meta-learning recommendation system (MLRS) to recommend the optimal pool generation scheme for dynamic ensemble selection. The system employs a meta-model built from dataset meta-features to predict the most suitable pool generation scheme and DES method for a given dataset. We demonstrate that this meta-learning recommendation system outperforms traditional fixed pool or DES method selection strategies.
  arXiv  Detail & Related papers  (2024-07-10T10:31:57Z)
• A Large Language Model Enhanced Sequential Recommender for Joint Video and Comment Recommendation [77.42486522565295]
  We propose a novel recommendation approach called LSVCR to jointly conduct personalized video and comment recommendation. Our approach consists of two key components, namely sequential recommendation (SR) model and supplemental large language model (LLM) recommender. In particular, we achieve a significant overall gain of 4.13% in comment watch time.
  arXiv  Detail & Related papers  (2024-03-20T13:14:29Z)
• DsDm: Model-Aware Dataset Selection with Datamodels [81.01744199870043]
  Standard practice is to filter for examples that match human notions of data quality. We find that selecting according to similarity with "high quality" data sources may not increase (and can even hurt) performance compared to randomly selecting data. Our framework avoids handpicked notions of data quality, and instead models explicitly how the learning process uses train datapoints to predict on the target tasks.
  arXiv  Detail & Related papers  (2024-01-23T17:22:00Z)
• Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential Recommendations [50.03560306423678]
  We propose Ada-Retrieval, an adaptive multi-round retrieval paradigm for recommender systems. Ada-Retrieval iteratively refines user representations to better capture potential candidates in the full item space.
  arXiv  Detail & Related papers  (2024-01-12T15:26:40Z)
• Membership Inference Attacks Against Latent Factor Model [0.0]
  We use the latent factor model as the recommender to get the list of recommended items. A shadow recommender is established to derive the labeled training data for the attack model. The experimental data show that the AUC index of our attack model can reach 0.857 on the real dataset MovieLens.
  arXiv  Detail & Related papers  (2022-12-15T08:16:08Z)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• MAMO: Memory-Augmented Meta-Optimization for Cold-start Recommendation [46.0605442943949]
  A common challenge for most recommender systems is the cold-start problem. In this paper, we design two memory matrices that can store task-specific memories and feature-specific memories. We adopt a meta-optimization approach for optimizing the proposed method.
  arXiv  Detail & Related papers  (2020-07-07T03:25:15Z)

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.