paper-with-me

Papers

Designing Graph Convolutional Neural Networks for Discrete Choice with Network Effects

2025-03-12 · Daniel F. Villarraga, Ricardo A. Daziano

We introduce a novel model architecture that incorporates network effects into discrete choice problems, achieving higher predictive performance than standard discrete choice models while offering greater interpretability than general-purpose flexible model classes. Econometric discrete choice models aid in studying individual decision-making, where agents select the option with the highest reward from a discrete set of alternatives. Intuitively, the utility an individual derives from a particular choice depends on their personal preferences and characteristics, the attributes of the alternative, and the value their peers assign to that alternative or their previous choices. However, most applications ignore peer influence, and models that do consider peer or network effects often lack the flexibility and predictive performance of recently developed approaches to discrete choice, such as deep learning. We propose a novel graph convolutional neural network architecture to model network effects in discrete choices, achieving higher predictive performance than standard discrete choice models while retaining the interpretability necessary for inference--a quality often lacking in general-purpose deep learning architectures. We evaluate our architecture using revealed commuting choice data, extended with travel times and trip costs for each travel mode for work-related trips in New York City, as well as 2016 U.S. election data aggregated by county, to test its performance on datasets with highly imbalanced classes. Given the interpretability of our models, we can estimate relevant economic metrics, such as the value of travel time savings in New York City. Finally, we compare the predictive performance and behavioral insights from our architecture to those derived from traditional discrete choice and general-purpose deep learning models.

📄 PDF Abstract BibTeX arXiv:2503.09786

Code (0)

등록된 구현이 없습니다.

Tasks

Discrete Choice Models

Methods 이 논문이 사용한 방법론

Travel 설명 없음
SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

RenderNet: A deep convolutional network for differentiable rendering from 3D shapes

2018-06-18 · NeurIPS 2018 12 · Thu Nguyen-Phuoc, Chuan Li, Stephen Balaban, Yong-Liang Yang

Traditional computer graphics rendering pipeline is designed for procedurally generating 2D quality images from 3D shapes with high performance. The non-differentiability due to discrete operations such as visibility com…

Inverse Rendering

Bounds on Average Effects in Discrete Choice Panel Data Models

2023-09-17 · Cavit Pakel, Martin Weidner

In discrete choice panel data, the estimation of average effects is crucial for quantifying the effect of covariates, and for policy evaluation and counterfactual analysis. This task is challenging in short panels with i…

counterfactualvalid

Learning Interpretable Feature Context Effects in Discrete Choice

2020-09-07 · Kiran Tomlinson, Austin R. Benson

The outcomes of elections, product sales, and the structure of social connections are all determined by the choices individuals make when presented with a set of options, so understanding the factors that contribute to c…

Identification of time-varying counterfactual parameters in nonlinear panel models

2022-12-18 · Irene Botosaru, Chris Muris

We develop a general framework for the identification of counterfactual parameters in a class of nonlinear semiparametric panel models with fixed effects and time effects. Our method applies to models for discrete outcom…

counterfactual

Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs

2021-05-03 · Saurav Manchanda, Da Zheng, George Karypis

Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. GCNs incorporate the graph structure information and the node (or edge) features throu…