An analysis of machine learning approaches for enhancing decision-making in complex discrete choice tasks
Summary
This paper evaluates four machine learning models for discrete choice modeling in policy preference elicitation, using Monte Carlo experiments and a real energy policy case study to assess performance under individual heterogeneity and choice complexity.
View Cached Full Text
Cached at: 08/03/26, 07:33 AM
# An analysis of machine learning approaches for enhancing decision-making in complex discrete choice tasks Source: [https://arxiv.org/abs/2607.28854](https://arxiv.org/abs/2607.28854) [View PDF](https://arxiv.org/pdf/2607.28854) > Abstract:Discrete choice modeling is a common tool used for preference elicitation during policy\-making, but this is typically done through parametric models\. Machine learning can push the boundaries of discrete choice modeling for policy\-based preference elicitation by adopting a data\-driven approach or learning individual preferences\. However, there is limited knowledge of how well machine learning methods can estimate individual discrete choice rules under individual heterogeneity, especially in the context of challenges often experienced during preference elicitation\. This study evaluates four machine learning models \(multinomial logistic regression, generalized additive model, twinned neural network, and Gaussian process\) with respect to their capacity to learn and predict five choice rules that are important in the behavioral and social sciences \(linear strong utility, monotonic strong utility, ideal point, lexicographic semiorder, and multiattribute linear ballistic accumulator\)\. Monte Carlo experiments were performed to assess model performance when increasing a\) the number of attributes in the choice alternatives, b\) the number of training choice sets, and c\) the choice rule's determinism\. The simulation results demonstrated that semi\-parametric and non\-parametric models generally outperform parametric models across all choice rules and experimental contexts\. Model performance also generally improves by 6% to 96% and 0% to 55%, respectively, with an increase in training choice sets and choice rule determinism\. A case study using real energy policy preference data was also conducted, where TNN performed best with a BIC of 13\.351\. This work demonstrated the viability and limitations of semi\-parametric and non\-parametric models in the context of policy\-centric discrete choice modeling and showed how the choice task context should drive model selection\. ## Submission history From: Sheng Lun Christine Cao \[[view email](https://arxiv.org/show-email/2af25bc8/2607.28854)\] **\[v1\]**Thu, 30 Jul 2026 21:38:37 UTC \(3,537 KB\)
Similar Articles
Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Data
This paper proposes a framework for Markov chain choice models with panel data, including estimation via novel EM algorithms that leverage partial-ordering preference information, personalized choice prediction, and assortment optimization. Experimental results on synthetic data and the sushi dataset show improvements over traditional methods.
Discretizing Reward Models
This paper identifies oversensitivity in continuous reward models for reinforcement learning, where equally good responses receive different scores, and proposes a discretization technique using Monte Carlo dropout to reduce this oversensitivity while maintaining discriminative ability, leading to better policies and less reward hacking.
When Choices Become Risks: Safety Failures of Large Language Models under Multiple-Choice Constraints
Researchers identify a systematic safety failure in LLMs where reformulating harmful requests as forced-choice multiple-choice questions (MCQs) bypasses refusal behavior, even in models that reject equivalent open-ended prompts. Evaluated across 14 proprietary and open-source models, the study reveals current safety benchmarks substantially underestimate risks in structured decision-making settings.
Reward Models Can Be Too Sensitive (22 minute read)
This paper argues that reward models in RL are often oversensitive, assigning different scores to equally good responses, and proposes a training-free discretization algorithm using Monte Carlo dropout to reduce oversensitivity, improving policy quality.
Reinforcement Learning with Pairwise Preferences in Long-Term Decision Problems
This paper introduces the Markov decision contest, a new problem model for reinforcement learning with pairwise preferences. It proves optimality guarantees for stationary policies, exact solvability in P, and presents a learning-efficient approximate algorithm.