mlsanityData to 14 Oct 2026

Better Capturing Interactions Between Products in~Retail: Revisited Negative Sampling for~Basket Choice Modeling

arXiv 2610.17963 ↗First posted 13 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Brick-and-mortar retailers face many different challenges that involve understanding thoroughly its products catalog and customer preferences. In particular, assortment optimization - proposing the ideal mix of products - and promotion planning hold a pivotal role in their strategy. By leveraging sales data, retailers can make informed decisions on which products to sell and how to manage inventory, based on customer preferences as well as regional and seasonal trends. It is especially crucial to capture interactions between products, in order to minimize the number of items that cannibalize each other's sales and to ensure that complementary products, which are often purchased together, are conjointly available and sold across all stores. In this paper, we propose a model of shopping basket that learns embeddings to represent interactions between products, prices and stores. Our model is built to uncover sales patterns from very large transaction datasets. In particular, the optimization loss is computed with random negative samples in order to overcome the computational bottlenecks that arise with large number of items. Our experiments on synthetic data show the efficiency of drawing such negative samples based on the actual assortment of available products, with better results than approaches from the literature. We also validate our approach by training and evaluating our model on a dataset composed of millions of transactions from Fortenova Group, one of the leading retail company in Southeast Europe. Our model showcases promising applications in the sector of retail, with enriched interfaces to efficiently support category managers.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 39 references that are in the map. First posted on arXiv 13 Oct 2026.

Builds on

19 of 39 references.

References · 19

  1. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  2. 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 664
  3. 2023A Cookbook of Self-Supervised Learningcited by 250
  4. 2015Label-Embedding for Image Classificationcited by 165
  5. 2016Entity Embeddings of Categorical Variablescited by 87
  6. 2024CARTE: Pretraining and Transfer for Tabular Learningcited by 76
  7. 2017Translation-based Recommendationcited by 71
  8. 2020Understanding graph embedding methods and their applicationscited by 51
  9. 2018Beyond One-hot Encoding: lower dimensional target embeddingcited by 43
  10. 2020A Neural-embedded Choice Model: TasteNet-MNL Modeling Taste Heterogeneity with Flexibility and Interpretabilitycited by 22
  11. 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 15
  12. 2017SHOPPER: A Probabilistic Model of Consumer Choice with Substitutes and Complementscited by 14
7 more
  1. 2024Embedding Compression in Recommender Systems: A Surveycited by 14
  2. 2022Representing Random Utility Choice Models with Neural Networkscited by 13
  3. 2021Combining Discrete Choice Models and Neural Networks through Embeddings: Formulation, Interpretability and Performancecited by 10
  4. 2019Rethinking travel behavior modeling representations through embeddingscited by 5
  5. 2024RUMBoost: Gradient Boosted Random Utility Modelscited by 3
  6. 2023Modeling Choice via Self-Attentioncited by 2
  7. 2023Torch-Choice: A PyTorch Package for Large-Scale Choice Modeling with Pythoncited by 1

Built on by

Not cited yet.