ProVe -- Self-supervised pipeline for automated product replacement and cold-starting based on neural language models

• URL: http://arxiv.org/abs/2006.14994v2
• Date: Tue, 12 Jan 2021 12:55:40 GMT
• Title: ProVe -- Self-supervised pipeline for automated product replacement and cold-starting based on neural language models
• Authors: Andrei Ionut Damian, Laurentiu Piciu, Cosmin Mihai Marinescu
• Abstract summary: This paper proposes a pipeline approach for recommending the most suitable replacements for products that are out-of-stock. We will also propose a solution for managing products that were newly introduced in a retailer's portfolio with almost no transactional history. This solution will help businesses: automatically assign the new products to the right category; recommend complementary products for cross-sell from day 1; perform sales predictions even with almost no transactional history.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In retail vertical industries, businesses are dealing with human limitation of quickly understanding and adapting to new purchasing behaviors. Moreover, retail businesses need to overcome the human limitation of properly managing a massive selection of products/brands/categories. These limitations lead to deficiencies from both commercial (e.g. loss of sales, decrease in customer satisfaction) and operational perspective (e.g. out-of-stock, over-stock). In this paper, we propose a pipeline approach based on Natural Language Understanding, for recommending the most suitable replacements for products that are out-of-stock. Moreover, we will propose a solution for managing products that were newly introduced in a retailer's portfolio with almost no transactional history. This solution will help businesses: automatically assign the new products to the right category; recommend complementary products for cross-sell from day 1; perform sales predictions even with almost no transactional history. Finally, the vector space model resulted by applying the pipeline presented in this paper is directly used as semantic information in deep learning-based demand forecasting solutions, leading to more accurate predictions. The whole research and experimentation process have been done using real-life private transactional data, however the source code is available on https://github.com/Lummetry/ProVe

Related papers

• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Playing hide and seek: tackling in-store picking operations while improving customer experience [0.0]
  We formalize a new problem called Dynamic In-store Picker Problem routing (diPRP) In this relevant problem - diPRP - a picker tries to pick online orders while minimizing customer encounters. Our work suggests that retailers should be able to scale the in-store picking of online orders without jeopardizing the experience of offline customers.
  arXiv  Detail & Related papers  (2023-01-05T16:35:17Z)
• Let Offline RL Flow: Training Conservative Agents in the Latent Space of Normalizing Flows [58.762959061522736]
  offline reinforcement learning aims to train a policy on a pre-recorded and fixed dataset without any additional environment interactions. We build upon recent works on learning policies in latent action spaces and use a special form of Normalizing Flows for constructing a generative model. We evaluate our method on various locomotion and navigation tasks, demonstrating that our approach outperforms recently proposed algorithms.
  arXiv  Detail & Related papers  (2022-11-20T21:57:10Z)
• Augmented Bilinear Network for Incremental Multi-Stock Time-Series Classification [83.23129279407271]
  We propose a method to efficiently retain the knowledge available in a neural network pre-trained on a set of securities. In our method, the prior knowledge encoded in a pre-trained neural network is maintained by keeping existing connections fixed. This knowledge is adjusted for the new securities by a set of augmented connections, which are optimized using the new data.
  arXiv  Detail & Related papers  (2022-07-23T18:54:10Z)
• A Simulation Environment and Reinforcement Learning Method for Waste Reduction [50.545552995521774]
  We study the problem of restocking a grocery store's inventory with perishable items over time, from a distributional point of view. The objective is to maximize sales while minimizing waste, with uncertainty about the actual consumption by costumers. We frame inventory restocking as a new reinforcement learning task that exhibits behavior conditioned on the agent's actions.
  arXiv  Detail & Related papers  (2022-05-30T22:48:57Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Well Googled is Half Done: Multimodal Forecasting of New Fashion Product Sales with Image-based Google Trends [13.873453929997776]
  New fashion product sales forecasting is a challenging problem that involves many business dynamics. We propose a neural network-based approach, where an encoder learns a representation of the time series. Our model works in a non-autoregressive manner, avoiding the compounding effect of large first-step errors.
  arXiv  Detail & Related papers  (2021-09-20T20:15:08Z)
• PreSizE: Predicting Size in E-Commerce using Transformers [76.33790223551074]
  PreSizE is a novel deep learning framework which utilizes Transformers for accurate size prediction. We demonstrate that PreSizE is capable of achieving superior prediction performance compared to previous state-of-the-art baselines. As a proof of concept, we demonstrate that size predictions made by PreSizE can be effectively integrated into an existing production recommender system.
  arXiv  Detail & Related papers  (2021-05-04T15:23:59Z)
• Online Fashion Commerce: Modelling Customer Promise Date [0.0]
  In e-commerce, accurate prediction of delivery dates plays a major role in customer experience. We present a machine learning-based approach for penalizing incorrect predictions differently. The proposed model is deployed internally for Fashion e-Commerce and is operational.
  arXiv  Detail & Related papers  (2021-05-01T18:16:12Z)
• Consumer Behaviour in Retail: Next Logical Purchase using Deep Neural Network [0.0]
  Accurate prediction of consumer purchase pattern enables better inventory planning and efficient personalized marketing strategies. Nerve network architectures like Multi Layer Perceptron, Long Short Term Memory (LSTM), Temporal Convolutional Networks (TCN) and TCN-LSTM bring over ML models like Xgboost and RandomForest.
  arXiv  Detail & Related papers  (2020-10-14T11:00:00Z)
• How Much Can A Retailer Sell? Sales Forecasting on Tmall [20.51263243320733]
  We study the case of retailers' sales forecasting on Tmall|the world's leading online B2C platform. We design two mechanisms for sales forecasting, i.e., seasonality extraction and distribution transformation.
  arXiv  Detail & Related papers  (2020-02-27T06:41:00Z)

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.