Graph-Based Methods for Discrete Choice

• URL: http://arxiv.org/abs/2205.11365v2
• Date: Fri, 17 Nov 2023 22:12:13 GMT
• Title: Graph-Based Methods for Discrete Choice
• Authors: Kiran Tomlinson and Austin R. Benson
• Abstract summary: We use graph learning to study choice in networked contexts. We show that incorporating social network structure can improve the predictions of the standard econometric choice model.
• Score: 27.874979682322376
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Choices made by individuals have widespread impacts--for instance, people choose between political candidates to vote for, between social media posts to share, and between brands to purchase--moreover, data on these choices are increasingly abundant. Discrete choice models are a key tool for learning individual preferences from such data. Additionally, social factors like conformity and contagion influence individual choice. Traditional methods for incorporating these factors into choice models do not account for the entire social network and require hand-crafted features. To overcome these limitations, we use graph learning to study choice in networked contexts. We identify three ways in which graph learning techniques can be used for discrete choice: learning chooser representations, regularizing choice model parameters, and directly constructing predictions from a network. We design methods in each category and test them on real-world choice datasets, including county-level 2016 US election results and Android app installation and usage data. We show that incorporating social network structure can improve the predictions of the standard econometric choice model, the multinomial logit. We provide evidence that app installations are influenced by social context, but we find no such effect on app usage among the same participants, which instead is habit-driven. In the election data, we highlight the additional insights a discrete choice framework provides over classification or regression, the typical approaches. On synthetic data, we demonstrate the sample complexity benefit of using social information in choice models.

Related papers

• ComPO: Community Preferences for Language Model Personalization [122.54846260663922]
  ComPO is a method to personalize preference optimization in language models. We collect and release ComPRed, a question answering dataset with community-level preferences from Reddit.
  arXiv  Detail & Related papers  (2024-10-21T14:02:40Z)
• ASPEST: Bridging the Gap Between Active Learning and Selective Prediction [56.001808843574395]
  Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain. Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples. In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
  arXiv  Detail & Related papers  (2023-04-07T23:51:07Z)
• In Search of Insights, Not Magic Bullets: Towards Demystification of the Model Selection Dilemma in Heterogeneous Treatment Effect Estimation [92.51773744318119]
  This paper empirically investigates the strengths and weaknesses of different model selection criteria. We highlight that there is a complex interplay between selection strategies, candidate estimators and the data used for comparing them.
  arXiv  Detail & Related papers  (2023-02-06T16:55:37Z)
• Strategic Classification with Graph Neural Networks [10.131895986034316]
  Using a graph for learning introduces inter-user dependencies in prediction. We propose a differentiable framework for strategically-robust learning of graph-based classifiers.
  arXiv  Detail & Related papers  (2022-05-31T13:11:25Z)
• Budget-aware Few-shot Learning via Graph Convolutional Network [56.41899553037247]
  This paper tackles the problem of few-shot learning, which aims to learn new visual concepts from a few examples. A common problem setting in few-shot classification assumes random sampling strategy in acquiring data labels. We introduce a new budget-aware few-shot learning problem that aims to learn novel object categories.
  arXiv  Detail & Related papers  (2022-01-07T02:46:35Z)
• Learning from Heterogeneous Data Based on Social Interactions over Graphs [58.34060409467834]
  This work proposes a decentralized architecture, where individual agents aim at solving a classification problem while observing streaming features of different dimensions. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting.
  arXiv  Detail & Related papers  (2021-12-17T12:47:18Z)
• Selecting the suitable resampling strategy for imbalanced data classification regarding dataset properties [62.997667081978825]
  In many application domains such as medicine, information retrieval, cybersecurity, social media, etc., datasets used for inducing classification models often have an unequal distribution of the instances of each class. This situation, known as imbalanced data classification, causes low predictive performance for the minority class examples. Oversampling and undersampling techniques are well-known strategies to deal with this problem by balancing the number of examples of each class.
  arXiv  Detail & Related papers  (2021-12-15T18:56:39Z)
• Client Selection in Federated Learning based on Gradients Importance [5.263296985310379]
  Federated learning (FL) enables multiple devices to collaboratively learn a global model without sharing their personal data. In this paper, we investigate and design a device selection strategy based on the importance of the gradient norms.
  arXiv  Detail & Related papers  (2021-11-19T11:53:23Z)
• Choice Set Confounding in Discrete Choice [29.25891648918572]
  Existing learning methods overlook how choice set assignment affects the data. We adapt methods from causal inference to the discrete choice setting. We show that accounting for choice set confounding makes choices observed in hotel booking more consistent with rational utility-maximization.
  arXiv  Detail & Related papers  (2021-05-17T15:39:02Z)
• Learning Interpretable Feature Context Effects in Discrete Choice [40.91593765662774]
  We provide a method for the automatic discovery of a broad class of context effects from observed choice data. Our models are easier to train and more flexible than existing models and also yield intuitive, interpretable, and statistically testable context effects. We identify new context effects in widely used choice datasets and provide the first analysis of choice set context effects in social network growth.
  arXiv  Detail & Related papers  (2020-09-07T20:59:24Z)
• Fairness-Aware Online Personalization [16.320648868892526]
  We present a study of fairness in online personalization settings involving the ranking of individuals. We first demonstrate that online personalization can cause the model to learn to act in an unfair manner if the user is biased in his/her responses. We then formulate the problem of learning personalized models under fairness constraints and present a regularization based approach for mitigating biases in machine learning.
  arXiv  Detail & Related papers  (2020-07-30T07:16:17Z)

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.