mlsanityData to 7 Oct 2026

Deep neural networks for choice analysis: Enhancing behavioral regularity with gradient regularization

arXiv 2404.14701 ↗First posted 23 Apr 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Deep neural networks (DNNs) frequently present behaviorally irregular patterns, significantly limiting their practical potentials and theoretical validity in travel behavior modeling. This study proposes strong and weak behavioral regularities as novel metrics to evaluate the monotonicity of individual demand functions (known as the "law of demand"), and further designs a constrained optimization framework with six gradient regularizers to enhance DNNs' behavioral regularity. The proposed framework is applied to travel survey data from Chicago and London to examine the trade-off between predictive power and behavioral regularity for large vs. small sample scenarios and in-domain vs. out-of-domain generalizations. The results demonstrate that, unlike models with strong behavioral foundations such as the multinomial logit, the benchmark DNNs cannot guarantee behavioral regularity. However, gradient regularization (GR) increases DNNs' behavioral regularity by around 6 percentage points (pp) while retaining their relatively high predictive power. In the small sample scenario, GR is more effective than in the large sample scenario, simultaneously improving behavioral regularity by about 20 pp and log-likelihood by around 1.7%. Comparing with the in-domain generalization of DNNs, GR works more effectively in out-of-domain generalization: it drastically improves the behavioral regularity of poorly performing benchmark DNNs by around 65 pp, indicating the criticality of behavioral regularization for enhancing model transferability and application in forecasting. Moreover, the proposed framework is applicable to other NN-based choice models such as TasteNets. Future studies could use behavioral regularity as a metric along with log-likelihood in evaluating travel demand models, and investigate other methods to further enhance behavioral regularity when adopting complex machine learning models.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 17 of its 62 references that are in the map. First posted on arXiv 23 Apr 2024.

Builds on

17 of 62 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2021Convex optimizationcited by 2,479
  3. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  4. 2018Deep Visual Domain Adaptation: A Surveycited by 634
  5. 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
  6. 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
  7. 2016Robust Large Margin Deep Neural Networkscited by 117
  8. 2019Unconstrained Monotonic Neural Networkscited by 91
  9. 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
  10. 2017Deep Lattice Networks and Partial Monotonic Functionscited by 62
  11. 2015A Unified Gradient Regularization Family for Adversarial Examplescited by 43
  12. 2021Choice modelling in the age of machine learning -- discussion papercited by 26
5 more
  1. 2019How to Incorporate Monotonicity in Deep Networks While Preserving Flexibility?cited by 21
  2. 2020A Neural-embedded Choice Model: TasteNet-MNL Modeling Taste Heterogeneity with Flexibility and Interpretabilitycited by 20
  3. 2020Theory-based residual neural networks: A synergy of discrete choice models and deep neural networkscited by 15
  4. 2021Equality of opportunity in travel behavior prediction with deep neural networks and discrete choice modelscited by 10
  5. 2023Incorporating Domain Knowledge in Deep Neural Networks for Discrete Choice Modelscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 5.

5 papers.