Strategic Usage in a Multi-Learner Setting

• URL: http://arxiv.org/abs/2401.16422v2
• Date: Fri, 8 Mar 2024 21:01:08 GMT
• Title: Strategic Usage in a Multi-Learner Setting
• Authors: Eliot Shekhtman and Sarah Dean
• Abstract summary: Real-world systems often involve some pool of users choosing between a set of services. We analyze a setting in which strategic users choose among several available services in order to pursue positive classifications. We show that naive retraining can still lead to oscillation even if all users are observed at different times.
• Score: 4.810166064205261
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Real-world systems often involve some pool of users choosing between a set of services. With the increase in popularity of online learning algorithms, these services can now self-optimize, leveraging data collected on users to maximize some reward such as service quality. On the flipside, users may strategically choose which services to use in order to pursue their own reward functions, in the process wielding power over which services can see and use their data. Extensive prior research has been conducted on the effects of strategic users in single-service settings, with strategic behavior manifesting in the manipulation of observable features to achieve a desired classification; however, this can often be costly or unattainable for users and fails to capture the full behavior of multi-service dynamic systems. As such, we analyze a setting in which strategic users choose among several available services in order to pursue positive classifications, while services seek to minimize loss functions on their observations. We focus our analysis on realizable settings, and show that naive retraining can still lead to oscillation even if all users are observed at different times; however, if this retraining uses memory of past observations, convergent behavior can be guaranteed for certain loss function classes. We provide results obtained from synthetic and real-world data to empirically validate our theoretical findings.

Related papers

• Learning from Streaming Data when Users Choose [3.2429724835345692]
  In digital markets comprised of many competing services, each user chooses between multiple service providers according to their preferences, and the chosen service makes use of the user data to incrementally improve its model. The service providers' models influence which service the user will choose at the next time step, and the user's choice, in return, influences the model update, leading to a feedback loop. We develop a simple and efficient decentralized algorithm to minimize the overall user loss.
  arXiv  Detail & Related papers  (2024-06-03T16:07:52Z)
• Initializing Services in Interactive ML Systems for Diverse Users [29.445931639366325]
  We study ML systems that interactively learn from users across multiple subpopulations with heterogeneous data distributions. We propose a randomized algorithm to adaptively select very few users to collect preference data from, while simultaneously initializing a set of services.
  arXiv  Detail & Related papers  (2023-12-19T04:26:12Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• Emergent specialization from participation dynamics and multi-learner retraining [26.913065669463247]
  We analyze a class of dynamics where users allocate their participation amongst services to reduce the individual risk they experience. We find that repeated myopic updates with multiple learners lead to better outcomes.
  arXiv  Detail & Related papers  (2022-06-06T15:12:56Z)
• Straggler-Resilient Personalized Federated Learning [55.54344312542944]
  Federated learning allows training models from samples distributed across a large network of clients while respecting privacy and communication restrictions. We develop a novel algorithmic procedure with theoretical speedup guarantees that simultaneously handles two of these hurdles. Our method relies on ideas from representation learning theory to find a global common representation using all clients' data and learn a user-specific set of parameters leading to a personalized solution for each client.
  arXiv  Detail & Related papers  (2022-06-05T01:14:46Z)
• 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)
• Generalized Strategic Classification and the Case of Aligned Incentives [16.607142366834015]
  We argue for a broader perspective on what accounts for strategic user behavior. Our model subsumes most current models, but includes other novel settings. We show how our results and approach can extend to the most general case.
  arXiv  Detail & Related papers  (2022-02-09T09:36:09Z)
• 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)
• Online Learning Demands in Max-min Fairness [91.37280766977923]
  We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof. The mechanism is repeated for multiple rounds and a user's requirements can change on each round. At the end of each round, users provide feedback about the allocation they received, enabling the mechanism to learn user preferences over time.
  arXiv  Detail & Related papers  (2020-12-15T22:15:20Z)
• Unsatisfied Today, Satisfied Tomorrow: a simulation framework for performance evaluation of crowdsourcing-based network monitoring [68.8204255655161]
  We propose an empirical framework tailored to assess the quality of the detection of under-performing cells. The framework simulates both the processes of satisfaction surveys delivery and users satisfaction prediction. We use the simulation framework to test empirically the performance of under-performing sites detection in general scenarios.
  arXiv  Detail & Related papers  (2020-10-30T10:03:48Z)

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.