The Use of Binary Choice Forests to Model and Estimate Discrete Choices

• URL: http://arxiv.org/abs/1908.01109v5
• Date: Wed, 17 Apr 2024 04:02:41 GMT
• Title: The Use of Binary Choice Forests to Model and Estimate Discrete Choices
• Authors: Ningyuan Chen, Guillermo Gallego, Zhuodong Tang,
• Abstract summary: In retailing, discrete choice models (DCMs) are commonly used to capture the choice behavior of customers. In this study, we use a forest of binary decision trees to represent DCMs. We show that our approach can predict the choice probability of any DCM consistently and thus never suffers from misspecification.
• Score: 15.952584576883973
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Problem definition. In retailing, discrete choice models (DCMs) are commonly used to capture the choice behavior of customers when offered an assortment of products. When estimating DCMs using transaction data, flexible models (such as machine learning models or nonparametric models) are typically not interpretable and hard to estimate, while tractable models (such as the multinomial logit model) tend to misspecify the complex behavior represeted in the data. Methodology/results. In this study, we use a forest of binary decision trees to represent DCMs. This approach is based on random forests, a popular machine learning algorithm. The resulting model is interpretable: the decision trees can explain the decision-making process of customers during the purchase. We show that our approach can predict the choice probability of any DCM consistently and thus never suffers from misspecification. Moreover, our algorithm predicts assortments unseen in the training data. The mechanism and errors can be theoretically analyzed. We also prove that the random forest can recover preference rankings of customers thanks to the splitting criterion such as the Gini index and information gain ratio. Managerial implications. The framework has unique practical advantages. It can capture customers' behavioral patterns such as irrationality or sequential searches when purchasing a product. It handles nonstandard formats of training data that result from aggregation. It can measure product importance based on how frequently a random customer would make decisions depending on the presence of the product. It can also incorporate price information and customer features. Our numerical experiments using synthetic and real data show that using random forests to estimate customer choices can outperform existing methods.

Related papers

• SKADA-Bench: Benchmarking Unsupervised Domain Adaptation Methods with Realistic Validation [55.87169702896249]
  Unsupervised Domain Adaptation (DA) consists of adapting a model trained on a labeled source domain to perform well on an unlabeled target domain with some data distribution shift. We propose a framework to evaluate DA methods and present a fair evaluation of existing shallow algorithms, including reweighting, mapping, and subspace alignment. Our benchmark highlights the importance of realistic validation and provides practical guidance for real-life applications.
  arXiv  Detail & Related papers  (2024-07-16T12:52:29Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Standardizing Structural Causal Models [80.21199731817698]
  We propose internally-standardized structural causal models (iSCMs) for benchmarking algorithms. By construction, iSCMs are not $operatornameVar$-sortable, and as we show experimentally, not $operatornameR2$-sortable either for commonly-used graph families.
  arXiv  Detail & Related papers  (2024-06-17T14:52:21Z)
• Gaussian Process Probes (GPP) for Uncertainty-Aware Probing [61.91898698128994]
  We introduce a unified and simple framework for probing and measuring uncertainty about concepts represented by models. Our experiments show it can (1) probe a model's representations of concepts even with a very small number of examples, (2) accurately measure both epistemic uncertainty (how confident the probe is) and aleatory uncertainty (how fuzzy the concepts are to the model), and (3) detect out of distribution data using those uncertainty measures as well as classic methods do.
  arXiv  Detail & Related papers  (2023-05-29T17:00:16Z)
• Active Learning for Non-Parametric Choice Models [9.737139416043949]
  We study the problem of actively learning a non-parametric choice model based on consumers' decisions. We present a negative result showing that such choice models may not be identifiable.
  arXiv  Detail & Related papers  (2022-08-05T18:26:33Z)
• Leveraging Unlabeled Data to Predict Out-of-Distribution Performance [63.740181251997306]
  Real-world machine learning deployments are characterized by mismatches between the source (training) and target (test) distributions. In this work, we investigate methods for predicting the target domain accuracy using only labeled source data and unlabeled target data. We propose Average Thresholded Confidence (ATC), a practical method that learns a threshold on the model's confidence, predicting accuracy as the fraction of unlabeled examples.
  arXiv  Detail & Related papers  (2022-01-11T23:01:12Z)
• On the estimation of discrete choice models to capture irrational customer behaviors [4.683806391173103]
  We show how to use partially-ranked preferences to efficiently model rational and irrational customer types from transaction data. An extensive set of experiments assesses the predictive accuracy of the proposed approach.
  arXiv  Detail & Related papers  (2021-09-08T19:19:51Z)
• An exact counterfactual-example-based approach to tree-ensemble models interpretability [0.0]
  High-performance models do not exhibit the necessary transparency to make their decisions fully understandable. We could derive an exact geometrical characterisation of their decision regions under the form of a collection of multidimensional intervals. An adaptation to reasoning on regression problems is also envisaged.
  arXiv  Detail & Related papers  (2021-05-31T09:32:46Z)
• How to Learn when Data Reacts to Your Model: Performative Gradient Descent [10.074466859579571]
  We introduce performative gradient descent (PerfGD), which is the first algorithm which converges to the performatively optimal point. PerfGD explicitly captures how changes in the model affects the data distribution and is simple to use.
  arXiv  Detail & Related papers  (2021-02-15T17:49:36Z)
• Model family selection for classification using Neural Decision Trees [4.286327408435937]
  In this paper we propose a method to reduce the scope of exploration needed for the task. The idea is to quantify how much it would be necessary to depart from trained instances of a given family, reference models (RMs) carrying rigid' decision boundaries.
  arXiv  Detail & Related papers  (2020-06-20T01:27:01Z)
• Decision-Making with Auto-Encoding Variational Bayes [71.44735417472043]
  We show that a posterior approximation distinct from the variational distribution should be used for making decisions. Motivated by these theoretical results, we propose learning several approximate proposals for the best model. In addition to toy examples, we present a full-fledged case study of single-cell RNA sequencing.
  arXiv  Detail & Related papers  (2020-02-17T19:23:36Z)

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.