Context-aware Retail Product Recommendation with Regularized Gradient
Boosting
- URL: http://arxiv.org/abs/2109.08561v1
- Date: Fri, 17 Sep 2021 14:08:37 GMT
- Title: Context-aware Retail Product Recommendation with Regularized Gradient
Boosting
- Abstract summary: 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.
- Score: 4.524282268368634
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the FARFETCH Fashion Recommendation challenge, the participants needed to
predict the order in which various products would be shown to a user in a
recommendation impression. The data was provided in two phases - a validation
phase and a test phase. The validation phase had a labelled training set that
contained a binary column indicating whether a product has been clicked or not.
The dataset comprises over 5,000,000 recommendation events, 450,000 products
and 230,000 unique users. It represents real, unbiased, but anonymised,
interactions of actual users of the FARFETCH platform. The final evaluation was
done according to the performance in the second phase. A total of 167
participants participated in the challenge, and we secured the 6th rank during
the final evaluation with an MRR of 0.4658 on the test set. 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. Post evaluation, we
have been able to fine-tune our approach with an MRR of 0.4784 on the test set,
which would have placed us at the 3rd position.
Related papers
- Aegix Pulse: A Traceable Three-Stage Architecture for Personalized Content Generation and Context-Preserving Revision [4.828072294068721]
Aegix Pulse is a production-oriented three-stage architecture that separates current-task clarification and Task Persona finalization.<n>We evaluate four preregistered claims using 96 synthetic social-media generation tasks.
arXiv Detail & Related papers (2026-09-07T16:00:50Z) - SurveyReview: A Reviewer-Aligned Benchmark for Survey Evaluators [50.129606229339146]
SurveyReview is a reviewer-aligned, multi-dimensional benchmark and dataset for survey evaluation.<n>We structure authentic peer-review reports by converting free-form comments into four-dimensional scores.<n>We release standardized train/test splits and an evaluation protocol to measure alignment between automatic evaluators and human reviewers.
arXiv Detail & Related papers (2026-08-07T16:11:46Z) - A Calibrated Multimodal Ensemble for Ambivalence/Hesitancy Recognition: System Description and Private-Test Submission Strategy [10.437764544103276]
We describe a calibrated, equal-weight ensemble of three fusion models over frozen face, audio, text, and pose embeddings.<n>This year's private test, released on a disjoint set of 30 new participants, is scored on five allowed submissions.<n>Our first submission, an exact replica of the calibrated ensemble tuned only on public validation, scored 0.7361 macro-F1 on the private test.
arXiv Detail & Related papers (2026-07-13T21:50:19Z) - Vibe Code Bench: Evaluating AI Models on End-to-End Web Application Development [6.072381417546439]
Existing benchmarks measure isolated tasks rather than the complete "zero-to-one" process of building a working application from scratch.<n>We introduce Vibe Code Bench, a benchmark of 100 web application specifications with 964 browser-based substeps.<n>Our contributions include (1) a novel benchmark dataset and browser-based evaluation pipeline for end-to-end web application development, (2) a comprehensive evaluation of 16 frontier models with cost, latency, and error analysis, and (3) an evaluator alignment protocol with both cross-model and human annotation results.
arXiv Detail & Related papers (2026-03-04T21:00:33Z) - ConvApparel: A Benchmark Dataset and Validation Framework for User Simulators in Conversational Recommenders [48.83868690303791]
We introduce ConvApparel, a new dataset of human-AI conversations designed to address this gap.<n>Its unique dual-agent data collection protocol -- using both "good" and "bad" recommenders -- enables counterfactual validation.<n>We propose a comprehensive validation framework that combines statistical alignment, a human-likeness score, and counterfactual validation.
arXiv Detail & Related papers (2026-02-18T23:00:21Z) - Robust Relevance Feedback for Interactive Known-Item Video Search [30.382002857815497]
We introduce a pairwise relative judgment feedback that improves the stability of top-k selections.<n>We decompose user perception into multiple sub-perceptions, each represented as an independent embedding space.<n>We develop a predictive user model that estimates the combination of sub-perceptions based on each user feedback instance.
arXiv Detail & Related papers (2025-05-21T05:31:49Z) - Centrality-aware Product Retrieval and Ranking [14.710718676076327]
This paper addresses the challenge of improving user experience on e-commerce platforms by enhancing product ranking relevant to users' search queries.
We curate samples from eBay, manually annotated with buyer-centric relevance scores and centrality scores, which reflect how well the product title matches the users' intent.
We introduce a User-intent Centrality Optimization (UCO) approach for existing models, which optimises for the user intent in semantic product search.
arXiv Detail & Related papers (2024-10-21T11:59:14Z) - PERSONA: A Reproducible Testbed for Pluralistic Alignment [46.750587209286344]
We introduce PERSONA, a test bed designed to evaluate and improve pluralistic alignment of language models.
We procedurally generate diverse user profiles from US census data, resulting in 1,586 synthetic personas.
We then generate a large-scale evaluation dataset containing 3,868 prompts and 317,200 feedback pairs.
arXiv Detail & Related papers (2024-07-24T16:11:39Z) - Self-Training with Pseudo-Label Scorer for Aspect Sentiment Quad Prediction [54.23208041792073]
Aspect Sentiment Quad Prediction (ASQP) aims to predict all quads (aspect term, aspect category, opinion term, sentiment polarity) for a given review.
A key challenge in the ASQP task is the scarcity of labeled data, which limits the performance of existing methods.
We propose a self-training framework with a pseudo-label scorer, wherein a scorer assesses the match between reviews and their pseudo-labels.
arXiv Detail & Related papers (2024-06-26T05:30:21Z) - Prometheus: Inducing Fine-grained Evaluation Capability in Language
Models [66.12432440863816]
We propose Prometheus, a fully open-source Large Language Model (LLM) that is on par with GPT-4's evaluation capabilities.
Prometheus scores a Pearson correlation of 0.897 with human evaluators when evaluating with 45 customized score rubrics.
Prometheus achieves the highest accuracy on two human preference benchmarks.
arXiv Detail & Related papers (2023-10-12T16:50:08Z) - Privacy Aware Experiments without Cookies [13.488622527004082]
Two brands want to jointly test alternate web experiences for their customers with an A/B test.
Such collaborative tests are today enabled using textitthird-party cookies, where each brand has information on the identity of visitors to another website.
With the imminent elimination of third-party cookies, such A/B tests will become untenable.
We propose a two-stage experimental design, where the two brands only need to agree on high-level aggregate parameters of the experiment to test the alternate experiences.
arXiv Detail & Related papers (2022-11-03T23:44:01Z) - 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) - Solving Fashion Recommendation -- The Farfetch Challenge [0.0]
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.
arXiv Detail & Related papers (2021-08-03T06:22:31Z) - 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) - OpenKBP: The open-access knowledge-based planning grand challenge [0.6157382820537718]
We hosted OpenKBP, a 2020 AAPM Grand Challenge, and challenged participants to develop the best method for predicting the dose of contoured CT images.
The models were evaluated according to two separate scores: (1) dose score, which evaluates the full 3D dose distributions, and (2) dose-volume histogram (DVH) score, which evaluates a set DVH metrics.
The Challenge attracted 195 participants from 28 countries, and 73 of those participants formed 44 teams in the validation phase, which received a total of 1750 submissions.
arXiv Detail & Related papers (2020-11-28T06:45:06Z)
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.