Neural-Bayesian Structure Learning for Discrete Choice Modeling

• URL: http://arxiv.org/abs/2608.25258v1
• Date: Wed, 26 Aug 2026 00:42:54 GMT
• Title: Neural-Bayesian Structure Learning for Discrete Choice Modeling
• Abstract summary: This paper proposes a framework coupling differentiable structure learning with random-utility-based discrete choice estimation.<n>Neural-BSL achieves predictive performance comparable to conventional benchmarks while recovering behaviorally coherent dependency structures.
• Score: 6.319601146638786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 for determining how related attributes should adjust when one is deliberately changed. This paper proposes Neural-Bayesian Structure Learning (Neural-BSL), a framework coupling differentiable structure learning with random-utility-based discrete choice estimation in a single differentiable procedure. To prevent mutually exclusive choice outcome from distorting the recovered attribute structure, the observed choice is maintained outside the graph as an alternative-specific utility comparison, while the attribute structure and random-utility parameters are learned jointly. The learned structure enters the choice model through structure-weighted attribute interactions and provides the structural basis for propagating interventions through downstream attributes. An intervention is evaluated by updating the intervened attribute, propagating its model-implied downstream changes in topological order, and then recomputing utilities and choice probabilities. This yields both predicted mode-share responses and the associated changes in downstream traveler or trip attributes. We evaluate Neural-BSL using stated-preference data from Seoul and the revealed-preference data from London. Neural-BSL achieves predictive performance comparable to conventional benchmarks while recovering behaviorally coherent dependency structures. Across policy scenarios, propagating interventions through the learned structure changes the predicted redistribution across modes while exposing the downstream traveler and trip adjustments underlying those responses.

Related papers

• Learning Bidirectional Causal Interactions with Heteroscedastic Neural Networks [1.0356094515229846]
  This paper proposes SEM-DNN, a heteroscedastic neural simultaneous-equation estimator.<n>It learns reciprocal structural interactions without external instruments.<n>An application to ready-to-eat cereal scanner data illustrates how the method can study contemporaneous price-sales feedback.
  arXiv  Detail & Related papers  (2026-07-24T13:53:58Z)
• Dynamics and Representation Structure of Local Approximations to Gradient-Based Learning in Linear Recurrent Neural Networks [56.42974363744522]
  We study the learning dynamics of random feedback local online (RFLO) and truncated backpropagation through time (tBPTT)<n>Our work provides analytical insight into how locality constraints shape learning dynamics, with implications for neuroscientific models of learning and alternative optimization approaches for RNNs.
  arXiv  Detail & Related papers  (2026-05-29T18:19:45Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Data-Driven Variational Basis Learning Beyond Neural Networks: A Non-Neural Framework for Adaptive Basis Discovery [0.0]
  We develop a non-neural alternative that learns basis functions directly from data through variational optimization.<n>The proposed framework, termed Data Driven Variational Basis Learning (DVBL), treats basis atoms as primary optimization variables.<n>This yields a data-adaptive basis expansion that remains explicit, interpretable, and amenable to rigorous analysis.
  arXiv  Detail & Related papers  (2026-04-17T23:01:34Z)
• Semi-structured multi-state delinquency model for mortgage default [7.0177704222466994]
  We propose a semi-structured discrete-time multi-state model to analyse mortgage delinquency transitions.<n>This model combines an easy-to-understand structured additive predictor, with a flexible neural network component that captures complex nonlinearities and higher-order interactions.
  arXiv  Detail & Related papers  (2026-03-27T11:22:22Z)
• On the Structural Limitations of Weight-Based Neural Adaptation and the Role of Reversible Behavioral Learning [0.0]
  We show that when parameters are directly mutated, the resulting model behaves divergently from the original model.<n>This divergence cannot be reversed deterministically without an explicit parameter snapshot.<n>We introduce reversible behavioral learning, in which model behaviors are structurally dissociated from identity parameters.
  arXiv  Detail & Related papers  (2026-03-03T12:44:12Z)
• Detecting and Pruning Prominent but Detrimental Neurons in Large Language Models [68.57424628540907]
  Large language models (LLMs) often develop learned mechanisms specialized to specific datasets.<n>We introduce a fine-tuning approach designed to enhance generalization by identifying and pruning neurons associated with dataset-specific mechanisms.<n>Our method employs Integrated Gradients to quantify each neuron's influence on high-confidence predictions, pinpointing those that disproportionately contribute to dataset-specific performance.
  arXiv  Detail & Related papers  (2025-07-12T08:10:10Z)
• Structural Entropy Guided Probabilistic Coding [52.01765333755793]
  We propose a novel structural entropy-guided probabilistic coding model, named SEPC.<n>We incorporate the relationship between latent variables into the optimization by proposing a structural entropy regularization loss.<n> Experimental results across 12 natural language understanding tasks, including both classification and regression tasks, demonstrate the superior performance of SEPC.
  arXiv  Detail & Related papers  (2024-12-12T00:37:53Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Attitudes and Latent Class Choice Models using Machine learning [0.0]
  We present a method of efficiently incorporating attitudinal indicators in the specification of Latent Class Choice Models (LCCM) This formulation overcomes structural equations in its capability of exploring the relationship between the attitudinal indicators and the decision choice. We test our proposed framework for estimating a Car-Sharing (CS) service subscription choice with stated preference data from Copenhagen, Denmark.
  arXiv  Detail & Related papers  (2023-02-20T10:03:01Z)
• Instance-Based Neural Dependency Parsing [56.63500180843504]
  We develop neural models that possess an interpretable inference process for dependency parsing. Our models adopt instance-based inference, where dependency edges are extracted and labeled by comparing them to edges in a training set.
  arXiv  Detail & Related papers  (2021-09-28T05:30:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.