arXiv:2205.01882
Approximating 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 across choice sets. The condition turns out to be the affine-independence of the set of characteristic vectors. When the condition fails, resulting in some random utility models that cannot be closely approximated, we identify preferences and substitution patterns that are challenging to approximate accurately. We also propose algorithms to quantify the magnitude of approximation errors.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
The Mixed Aggregate Preference Logit Model: A Machine Learning Approach to Modeling Unobserved Heterogeneity in Discrete Choice Analysis
A prediction and behavioural analysis of machine learning methods for modelling travel mode choice
Representing Random Utility Choice Models with Neural Networks
Graph-Based Methods for Discrete Choice
Fast Learning of MNL Model from General Partial Rankings with Application to Network Formation Modeling
Equality of opportunity in travel behavior prediction with deep neural networks and discrete choice models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.