Influencing Bandits: Arm Selection for Preference Shaping
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929259853905920 |
|---|---|
| author | Nadkarni, Viraj Manjunath, D. Moharir, Sharayu |
| author_facet | Nadkarni, Viraj Manjunath, D. Moharir, Sharayu |
| contents | We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the fraction of the population favouring a predetermined arm. For the case of binary opinions, two types of opinion dynamics are considered -- decreasing elasticity (modeled as a Polya urn with increasing number of balls) and constant elasticity (using the voter model). For the first case, we describe an Explore-then-commit policy and a Thompson sampling policy and analyse the regret for each of these policies. We then show that these algorithms and their analyses carry over to the constant elasticity case. We also describe a Thompson sampling based algorithm for the case when more than two types of opinions are present. Finally, we discuss the case where presence of multiple recommendation systems gives rise to a trade-off between their popularity and opinion shaping objectives. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00036 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Influencing Bandits: Arm Selection for Preference Shaping Nadkarni, Viraj Manjunath, D. Moharir, Sharayu Machine Learning Artificial Intelligence Information Retrieval Systems and Control I.2.6 We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the fraction of the population favouring a predetermined arm. For the case of binary opinions, two types of opinion dynamics are considered -- decreasing elasticity (modeled as a Polya urn with increasing number of balls) and constant elasticity (using the voter model). For the first case, we describe an Explore-then-commit policy and a Thompson sampling policy and analyse the regret for each of these policies. We then show that these algorithms and their analyses carry over to the constant elasticity case. We also describe a Thompson sampling based algorithm for the case when more than two types of opinions are present. Finally, we discuss the case where presence of multiple recommendation systems gives rise to a trade-off between their popularity and opinion shaping objectives. |
| title | Influencing Bandits: Arm Selection for Preference Shaping |
| topic | Machine Learning Artificial Intelligence Information Retrieval Systems and Control I.2.6 |
| url | https://arxiv.org/abs/2403.00036 |