arXiv:2603. 24705v3 Announce Type: replace-cross Abstract: Discrete choice models are fundamental tools in management science, economics, and marketing for understanding and predicting decision-making.
By Easton Huch, Michael Keane
arXiv:2607. 13314v1 Announce Type: cross Abstract: Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation.
By Liu Liu, Dan Zhang
arXiv:2505. 18077v3 Announce Type: replace-cross Abstract: Discrete choice models (DCMs) are used to analyze individual decision-making in contexts such as transportation choices, political elections, and consumer preferences.
By Daniel F. Villarraga, Ricardo A. Daziano
arXiv:2606. 26432v1 Announce Type: new Abstract: Tabular foundation models achieve strong accuracy on choice prediction tasks, but their predictions often violate the economic logic those tasks require: raising a price can increase predicted demand, implied willingness-to-pay estimates are frequently negative or implausible, and unavailable alternatives receive nonzero probability.
By Yingshuo Wang, Xian Sun, Yanhang Li, Zhichao Fan, Zexin Zhuang
arXiv:2207. 12877v3 Announce Type: replace Abstract: 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.
By Ali Aouad, Antoine D\'esir
Delphos is a multitask reinforcement learning framework that automates discrete choice model specification by treating it as a sequential decision-making problem. It learns transferable specification strategies across multiple transport choice datasets using a DeepSet‑Q architecture, enabling a shared policy to adapt to varying variable sets. Trained on nine datasets, Delphos outperforms single‑task agents, and when applied to unseen Swissmetro and Decisions datasets, it quickly identifies competitive specifications with higher log‑likelihoods than existing methods.
By Gabriel Nova, Stephane Hess, Sander Van Cranenburgh
Neural-Bayesian Structure Learning (Neural-BSL) integrates differentiable structure learning with random-utility discrete choice estimation in a single differentiable framework. It keeps observed choices outside the graph to avoid distortion, learns attribute interactions through a structure-weighted network, and propagates interventions by updating attributes in topological order before recomputing utilities and choice probabilities. Evaluations on Seoul stated-preference and London revealed-preference data show Neural-BSL matches conventional benchmarks in predictive performance while uncovering behaviorally coherent dependency structures and revealing downstream traveler and trip adjustments under policy scenarios.
By Hyunsoo Yun, Eun Hak Lee, Jiaru Zhang, Ziran Wang, Eui-Jin Kim
The paper introduces a method for learning heterogeneous, individually conditioned utility functions—termed individuated utility—by leveraging rational choice theory. It presents a multi-stage architecture that estimates these functions from multimodal data and evaluates it on a large dataset of aesthetic judgments about automotive wheel designs. Results show that individuated models outperform universal utility models and foundation baselines, indicating that annotator disagreement reflects meaningful preference diversity.
By Shiwali Mohan, Matt Hong, Dule Shu, Aniek Fransen, Shabnam Hakimi, Matt Klenk
Conventional discrete choice and machine learning models are estimated primarily from observational data and typically treat explanatory covariates as parallel inputs, providing no internal mechanism...
arXiv:2607. 16232v1 Announce Type: cross Abstract: The growing use of statistical learning algorithms to infer human preferences from high-dimensional choice data runs up against a fundamental challenge: choice alternatives typically differ in many ways simultaneously, so it is generally unclear which factors actually drove an observed decision and should be credited as preferences.
By Zachary Wojtowicz, Ayush Nayak, Jacob Andreas
arXiv:2509. 07123v2 Announce Type: replace-cross Abstract: Generalized extreme value models capture dependence among choice alternatives in discrete choice modeling, but require this dependence to be predefined, symmetric, and shared uniformly across individuals.
By Yuqi Zhou, Zhanhong Cheng, Dingyi Zhuang, Lingqian Hu, Yuheng Bu, Shenhao Wang
arXiv:2609.21525v1 Announce Type: new
Abstract: Preference-based reward shaping can guide reinforcement learning, but adding preference signals to the reward may unintentionally change the task being...
By Xuening Wu, Yanlan Kang, Shenqin Yin