Solving Fashion Recommendation -- The Farfetch Challenge

• URL: http://arxiv.org/abs/2108.01314v1
• Date: Tue, 3 Aug 2021 06:22:31 GMT
• Title: Solving Fashion Recommendation -- The Farfetch Challenge
• Abstract summary: We present our solution to ECML PKDD Farfetch Fashion Recommendation Challenge. The goal of this challenge is to maximize the chances of a click when the users are presented with set of fashion items.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommendation engines are integral to the modern e-commerce experience, both for the seller and the end user. Accurate recommendations lead to higher revenue and better user experience. In this paper, we are presenting our solution to ECML PKDD Farfetch Fashion Recommendation Challenge.The goal of this challenge is to maximize the chances of a click when the users are presented with set of fashion items. We have approached this problem as a binary classification problem. Our winning solution utilizes Catboost as the classifier and Bayesian Optimization for hyper parameter tuning. Our baseline model achieved MRR of 0.5153 on the validation set. Bayesian optimization of hyper parameters improved the MRR to 0.5240 on the validation set. Our final submission on the test set achieved a MRR of 0.5257.

Related papers

• PairJudge RM: Perform Best-of-N Sampling with Knockout Tournament [37.97757796124621]
  Pairwise Judge Reward Model (PariJudge RM) combined with a knockout tournament for BoN sampling. Instead of assigning absolute scores, PariJudge RM judges two candidate solutions' correctness with chain-of-thought reasoning simultaneously. In the knockout tournament, PariJudge RM conducts pairwise Judgment between candidate solutions and eliminates the incorrect ones iteratively.
  arXiv  Detail & Related papers  (2025-01-22T16:49:37Z)
• 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)
• Preference Diffusion for Recommendation [50.8692409346126]
  We propose PreferDiff, a tailored optimization objective for DM-based recommenders. PreferDiff transforms BPR into a log-likelihood ranking objective to better capture user preferences. It is the first personalized ranking loss designed specifically for DM-based recommenders.
  arXiv  Detail & Related papers  (2024-10-17T01:02:04Z)
• MADA: Meta-Adaptive Optimizers through hyper-gradient Descent [73.1383658672682]
  We introduce Meta-Adaptives (MADA), a unified framework that can generalize several known convergences and dynamically learn the most suitable one during training. We empirically compare MADA to other populars on vision and language tasks, and find that MADA consistently outperforms Adam and other populars. We also propose AVGrad, a modification of AMS that replaces the maximum operator with averaging, which is more suitable for hyper-gradient optimization.
  arXiv  Detail & Related papers  (2024-01-17T00:16:46Z)
• Ranking-based Adaptive Query Generation for DETRs in Crowded Pedestrian Detection [49.27380156754935]
  We find that the number of DETRs' queries must be adjusted manually, otherwise, the performance would degrade to varying degrees. We propose Rank-based Adaptive Query Generation (RAQG) to alleviate the problem. Our method is simple and effective, which can be plugged into any DETRs to make it query-adaptive in theory.
  arXiv  Detail & Related papers  (2023-10-24T11:00:56Z)
• Lightweight Boosting Models for User Response Prediction Using Adversarial Validation [2.4040470282119983]
  The ACM RecSys Challenge 2023, organized by ShareChat, aims to predict the probability of the app being installed. This paper describes the lightweight solution to this challenge.
  arXiv  Detail & Related papers  (2023-10-05T13:57:05Z)
• Fine-Grained Hard Negative Mining: Generalizing Mitosis Detection with a Fifth of the MIDOG 2022 Dataset [1.2183405753834562]
  We describe a candidate deep learning solution for the Mitosis Domain Generalization Challenge 2022 (MIDOG) Our approach consists in training a rotation-invariant deep learning model using aggressive data augmentation. Our model ensemble achieved a F1-score of.697 on the final test set after automated evaluation.
  arXiv  Detail & Related papers  (2023-01-03T13:06:44Z)
• Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
  We show how to return a set of items rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate. We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
  arXiv  Detail & Related papers  (2022-07-04T17:49:25Z)
• NTIRE 2022 Challenge on Efficient Super-Resolution: Methods and Results [279.8098140331206]
  The NTIRE 2022 challenge was to super-resolve an input image with a magnification factor of $times$4 based on pairs of low and corresponding high resolution images. The aim was to design a network for single image super-resolution that achieved improvement of efficiency measured according to several metrics.
  arXiv  Detail & Related papers  (2022-05-11T17:58:54Z)
• 5th Place Solution for VSPW 2021 Challenge [29.246666942808673]
  In this article, we introduce the solution we used in the VSPW 2021 Challenge. Our experiments are based on two baseline models, Swin Transformer and MaskFormer. Without using any external segmentation dataset, our solution ranked the 5th place in the private leaderboard.
  arXiv  Detail & Related papers  (2021-12-13T02:27:05Z)
• Context-aware Retail Product Recommendation with Regularized Gradient Boosting [4.524282268368634]
  In the FARFETCH Fashion Recommendation challenge, the participants needed to predict the order in which various products would be shown to a user. The dataset comprises over 5,000,000 recommendation events, 450,000 products and 230,000 unique users. We have designed a unique context-aware system that takes the similarity of a product to the user context into account to rank products more effectively.
  arXiv  Detail & Related papers  (2021-09-17T14:08:37Z)
• Compositional ADAM: An Adaptive Compositional Solver [69.31447856853833]
  C-ADAM is the first adaptive solver for compositional problems involving a non-linear functional nesting of expected values. We prove that C-ADAM converges to a stationary point in $mathcalO(delta-2.25)$ with $delta$ being a precision parameter.
  arXiv  Detail & Related papers  (2020-02-10T14:00:45Z)

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.