GAN-based Recommendation with Positive-Unlabeled Sampling

• URL: http://arxiv.org/abs/2012.06901v1
• Date: Sat, 12 Dec 2020 20:08:51 GMT
• Title: GAN-based Recommendation with Positive-Unlabeled Sampling
• Abstract summary: We propose a Generative Adversaunlabeled Network based recommendation framework using a positive-unlabeled sampling strategy. We show the effectiveness and efficiency of our framework on three publicly accessible data sets with eight ranking-based evaluation metrics.
• Score: 38.13310245787665
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems are popular tools for information retrieval tasks on a large variety of web applications and personalized products. In this work, we propose a Generative Adversarial Network based recommendation framework using a positive-unlabeled sampling strategy. Specifically, we utilize the generator to learn the continuous distribution of user-item tuples and design the discriminator to be a binary classifier that outputs the relevance score between each user and each item. Meanwhile, positive-unlabeled sampling is applied in the learning procedure of the discriminator. Theoretical bounds regarding positive-unlabeled sampling and optimalities of convergence for the discriminators and the generators are provided. We show the effectiveness and efficiency of our framework on three publicly accessible data sets with eight ranking-based evaluation metrics in comparison with thirteen popular baselines.

Related papers

• Personalized Recommendations via Active Utility-based Pairwise Sampling [1.704905100460915]
  We propose a utility-based framework that learns preferences from simple and intuitive pairwise comparisons.<n>A central contribution of our work is a novel utility-based active sampling strategy for preference elicitation.
  arXiv  Detail & Related papers  (2025-08-12T19:09:33Z)
• Multiview graph dual-attention deep learning and contrastive learning for multi-criteria recommender systems [0.8575004906002217]
  We present a novel representation for Multi-Criteria Recommender Systems based on a multi-edge bipartite graph, where each edge represents one criterion rating of items by users. We employ local and global contrastive learning to distinguish between positive and negative samples across each view and the entire graph. We evaluate our method on two real-world datasets and assess its performance based on item rating predictions.
  arXiv  Detail & Related papers  (2025-02-26T16:25:58Z)
• Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Models [0.0]
  Large-scale industrial recommendation models predict the most relevant items from catalogs containing millions or billions of options. To train these models efficiently, a small set of irrelevant items (negative samples) is selected from the vast catalog for each relevant item. Our study serves as a practical guide to the trade-offs in selecting a negative sampling method for large-scale sequential recommendation models.
  arXiv  Detail & Related papers  (2024-10-08T00:23:17Z)
• Text-Based Product Matching -- Semi-Supervised Clustering Approach [9.748519919202986]
  This paper aims to present a new philosophy to product matching utilizing a semi-supervised clustering approach. We study the properties of this method by experimenting with the IDEC algorithm on the real-world dataset.
  arXiv  Detail & Related papers  (2024-02-01T18:52:26Z)
• AutoSAM: Towards Automatic Sampling of User Behaviors for Sequential Recommender Systems [48.461157194277504]
  We propose a general automatic sampling framework, named AutoSAM, to non-uniformly treat historical behaviors. Specifically, AutoSAM augments the standard sequential recommendation architecture with an additional sampler layer to adaptively learn the skew distribution of the raw input. We theoretically design multi-objective sampling rewards including Future Prediction and Sequence Perplexity, and then optimize the whole framework in an end-to-end manner.
  arXiv  Detail & Related papers  (2023-11-01T09:25:21Z)
• ELECRec: Training Sequential Recommenders as Discriminators [94.93227906678285]
  Sequential recommendation is often considered as a generative task, i.e., training a sequential encoder to generate the next item of a user's interests. We propose to train the sequential recommenders as discriminators rather than generators. Our method trains a discriminator to distinguish if a sampled item is a'real' target item or not.
  arXiv  Detail & Related papers  (2022-04-05T06:19:45Z)
• Bi-Discriminator Class-Conditional Tabular GAN [5.429166489331484]
  We introduce a bi-discriminator GAN for synthesizing datasets containing continuous, binary, and discrete columns. Our experimental results on four benchmarking public datasets corroborate the superior performance of our GAN.
  arXiv  Detail & Related papers  (2021-11-12T03:31:28Z)
• Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons [85.5955376526419]
  In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items. We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons. We prove that our algorithm can return the true ranking of items with high probability.
  arXiv  Detail & Related papers  (2021-10-08T13:51:55Z)
• Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation [59.183016033308014]
  In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
  arXiv  Detail & Related papers  (2021-05-16T08:06:22Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)
• MatchGAN: A Self-Supervised Semi-Supervised Conditional Generative Adversarial Network [51.84251358009803]
  We present a novel self-supervised learning approach for conditional generative adversarial networks (GANs) under a semi-supervised setting. We perform augmentation by randomly sampling sensible labels from the label space of the few labelled examples available. Our method surpasses the baseline with only 20% of the labelled examples used to train the baseline.
  arXiv  Detail & Related papers  (2020-06-11T17:14:55Z)

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.