mlsanityData to 13 Oct 2026

A Neural Network Based Choice Model for Assortment Optimization

arXiv 2308.05617 ↗First posted 10 Aug 2023cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Discrete-choice models are used in economics, marketing and revenue management to predict customer purchase probabilities, say as a function of prices and other features of the offered assortment. While they have been shown to be expressive, capturing customer heterogeneity and behaviour, they are also hard to estimate, often based on many unobservables like utilities; and moreover, they still fail to capture many salient features of customer behaviour. A natural question then, given their success in other contexts, is if neural networks can eliminate the necessity of carefully building a context-dependent customer behaviour model and hand-coding and tuning the estimation. It is unclear however how one would incorporate assortment effects into such a neural network, and also how one would optimize the assortment with such a black-box generative model of choice probabilities. In this paper we investigate first whether a single neural network architecture can predict purchase probabilities for datasets from various contexts and generated under various models and assumptions. Next, we develop an assortment optimization formulation that is solvable by off-the-shelf integer programming solvers. We compare against a variety of benchmark discrete-choice models on simulated as well as real-world datasets, developing training tricks along the way to make the neural network prediction and subsequent optimization robust and comparable in performance to the alternates.

Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 10 Aug 2023.

Builds on

18 of 61 references.

References · 18

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,950
  2. 2017On Calibration of Modern Neural Networkscited by 4,902
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,344
  4. 2019Measuring Calibration in Deep Learningcited by 443
  5. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  6. 2017Size-Independent Sample Complexity of Neural Networkscited by 289
  7. 2016A vector-contraction inequality for Rademacher complexitiescited by 141
  8. 2021Choice modelling in the age of machine learning -- discussion papercited by 26
  9. 2017Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility Studycited by 25
  10. 2020Exploring Alternatives to Softmax Functioncited by 16
  11. 2019Discovering Context Effects from Raw Choice Datacited by 13
  12. 2022Representing Random Utility Choice Models with Neural Networkscited by 12
6 more
  1. 2019Decision Forest: A Nonparametric Approach to Modeling Irrational Choicecited by 11
  2. 2021Combining Discrete Choice Models and Neural Networks through Embeddings: Formulation, Interpretability and Performancecited by 9
  3. 2014Online Learning and Profit Maximization from Revealed Preferencescited by 6
  4. 2022Learning from Stochastically Revealed Preferencecited by 5
  5. 2017Parameter identification in Markov chain choice modelscited by 3
  6. 2021Submodular Order Functions and Assortment Optimizationcited by 2

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.