Metric Learning for Session-based Recommendations

• URL: http://arxiv.org/abs/2101.02655v1
• Date: Thu, 7 Jan 2021 17:51:04 GMT
• Title: Metric Learning for Session-based Recommendations
• Authors: Bart{\l}omiej Twardowski, Pawe{\l} Zawistowski, Szymon Zaborowski
• Abstract summary: We discuss and compare metric learning approaches to commonly used learning-to-rank methods. We propose a simple architecture for problem analysis and demonstrate that neither extensively big nor deep architectures are necessary.
• Score: 3.706222947143855
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Session-based recommenders, used for making predictions out of users' uninterrupted sequences of actions, are attractive for many applications. Here, for this task we propose using metric learning, where a common embedding space for sessions and items is created, and distance measures dissimilarity between the provided sequence of users' events and the next action. We discuss and compare metric learning approaches to commonly used learning-to-rank methods, where some synergies exist. We propose a simple architecture for problem analysis and demonstrate that neither extensively big nor deep architectures are necessary in order to outperform existing methods. The experimental results against strong baselines on four datasets are provided with an ablation study.

Related papers

• Hierarchical Reinforcement Learning for Temporal Abstraction of Listwise Recommendation [51.06031200728449]
  We propose a novel framework called mccHRL to provide different levels of temporal abstraction on listwise recommendation. Within the hierarchical framework, the high-level agent studies the evolution of user perception, while the low-level agent produces the item selection policy. Results observe significant performance improvement by our method, compared with several well-known baselines.
  arXiv  Detail & Related papers  (2024-09-11T17:01:06Z)
• Denoising Pre-Training and Customized Prompt Learning for Efficient Multi-Behavior Sequential Recommendation [69.60321475454843]
  We propose DPCPL, the first pre-training and prompt-tuning paradigm tailored for Multi-Behavior Sequential Recommendation. In the pre-training stage, we propose a novel Efficient Behavior Miner (EBM) to filter out the noise at multiple time scales. Subsequently, we propose to tune the pre-trained model in a highly efficient manner with the proposed Customized Prompt Learning (CPL) module.
  arXiv  Detail & Related papers  (2024-08-21T06:48:38Z)
• Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion [86.6191592951269]
  Merging models fine-tuned from common extensively pretrained large model but specialized for different tasks has been demonstrated as a cheap and scalable strategy to construct a multitask model that performs well across diverse tasks. We propose the CONtinuous relaxation dis (Concrete) subspace learning method to identify a common lowdimensional subspace and utilize its shared information track interference problem without sacrificing performance.
  arXiv  Detail & Related papers  (2023-12-11T07:24:54Z)
• Boosting the Learning for Ranking Patterns [6.142272540492935]
  This paper formulates the problem of learning pattern ranking functions as a multi-criteria decision making problem. Our approach aggregates different interestingness measures into a single weighted linear ranking function, using an interactive learning procedure. Experiments conducted on well-known datasets show that our approach significantly reduces the running time and returns precise pattern ranking.
  arXiv  Detail & Related papers  (2022-03-05T10:22:44Z)
• Sequential Search with Off-Policy Reinforcement Learning [48.88165680363482]
  We propose a highly scalable hybrid learning model that consists of an RNN learning framework and an attention model. As a novel optimization step, we fit multiple short user sequences in a single RNN pass within a training batch, by solving a greedy knapsack problem on the fly. We also explore the use of off-policy reinforcement learning in multi-session personalized search ranking.
  arXiv  Detail & Related papers  (2022-02-01T06:52:40Z)
• Deep Relational Metric Learning [84.95793654872399]
  This paper presents a deep relational metric learning framework for image clustering and retrieval. We learn an ensemble of features that characterizes an image from different aspects to model both interclass and intraclass distributions. Experiments on the widely-used CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate that our framework improves existing deep metric learning methods and achieves very competitive results.
  arXiv  Detail & Related papers  (2021-08-23T09:31:18Z)
• An Investigation of Replay-based Approaches for Continual Learning [79.0660895390689]
  Continual learning (CL) is a major challenge of machine learning (ML) and describes the ability to learn several tasks sequentially without catastrophic forgetting (CF) Several solution classes have been proposed, of which so-called replay-based approaches seem very promising due to their simplicity and robustness. We empirically investigate replay-based approaches of continual learning and assess their potential for applications.
  arXiv  Detail & Related papers  (2021-08-15T15:05:02Z)
• Improved Representation Learning for Session-based Recommendation [0.0]
  Session-based recommendation systems suggest relevant items to users by modeling user behavior and preferences using short-term anonymous sessions. Existing methods leverage Graph Neural Networks (GNNs) that propagate and aggregate information from neighboring nodes. We propose using a Transformer in combination with a target attentive GNN, which allows richer Representation Learning.
  arXiv  Detail & Related papers  (2021-07-04T00:57:28Z)
• Session-aware Recommendation: A Surprising Quest for the State-of-the-art [6.617487928813376]
  Session-aware recommendations can be personalized according to the users' long-term preferences. We benchmarked recent session-aware algorithms against each other and against a number of session-based recommendation algorithms. Our work indicates that there remains a huge potential for more sophisticated session-aware recommendation algorithms.
  arXiv  Detail & Related papers  (2020-11-06T15:18:01Z)
• How do Offline Measures for Exploration in Reinforcement Learning behave? [5.573543601558405]
  We compare the behavior of three data-based, offline exploration metrics and highlight problems to be aware of when using them. We propose a fourth metric, relative entropy, and implement it using either a k-nearest-neighbor or a nearest-neighbor-uniform estimator.
  arXiv  Detail & Related papers  (2020-10-29T12:58:30Z)
• Comprehensive Empirical Evaluation of Deep Learning Approaches for Session-based Recommendation in E-Commerce [38.42250061908039]
  In session-based recommendation, a recommendation system counts on the sequence of events made by a user within the same session to predict and endorse other items. We present a comprehensive evaluation of the state-of-the-art deep learning approaches used in the session-based recommendation.
  arXiv  Detail & Related papers  (2020-10-17T17:22:35Z)

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.