Representing Random Utility Choice Models with Neural Networks
Motivated by the successes of deep learning, we propose a class of neural network-based discrete choice models, called RUMnets, inspired by the random utility maximization (RUM) framework. This model formulates the agents' random utility function using a sample average approximation. We show that RUMnets sharply approximate the class of RUM discrete choice models: any model derived from random utility maximization has choice probabilities that can be approximated arbitrarily closely by a RUMnet. Reciprocally, any RUMnet is consistent with the RUM principle. We derive an upper bound on the generalization error of RUMnets fitted on choice data, and gain theoretical insights on their ability to predict choices on new, unseen data depending on critical parameters of the dataset and architecture. By leveraging open-source libraries for neural networks, we find that RUMnets are competitive against several choice modeling and machine learning methods in terms of predictive accuracy on two real-world datasets.
Code (2)
Tasks
Discrete Choice ModelsSimilar Papers 제목 키워드 기반
Random Utility, Repeated Choice, and Consumption Dependence
We study consumption dependence in the context of random utility and repeated choice. We show that, in the presence of consumption dependence, the random utility model is a misspecified model of repeated rational choice.…
Stochastic Monotonicity and Random Utility Models: The Good and The Ugly
When it comes to structural estimation of risk preferences from data on choices, random utility models have long been one of the standard research tools in economics. A recent literature has challenged these models, poin…
validNonparametric Analysis of Dynamic Random Utility Models
We study a dynamic generalization of stochastic rationality in consumer behavior, the Dynamic Random Utility Model (DRUM). Under DRUM, a consumer draws a utility function from a stochastic utility process and maximizes t…
Time SeriesTime Series AnalysisApproximating Choice Data by Discrete Choice Models
We obtain a necessary and sufficient condition under which random-coefficient discrete choice models, such as mixed-logit models, are rich enough to approximate any nonparametric random utility models arbitrarily well ac…
Discrete Choice ModelsRandom Utility Models with Skewed Random Components: the Smallest versus Largest Extreme Value Distribution
At the core of most random utility models (RUMs) is an individual agent with a random utility component following a largest extreme value Type I (LEVI) distribution. What if, instead, the random component follows its mir…