A Classification View on Meta Learning Bandits
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916676074733568 |
|---|---|
| author | Mutti, Mirco Kwon, Jeongyeol Mannor, Shie Tamar, Aviv |
| author_facet | Mutti, Mirco Kwon, Jeongyeol Mannor, Shie Tamar, Aviv |
| contents | Contextual multi-armed bandits are a popular choice to model sequential decision-making. E.g., in a healthcare application we may perform various tests to asses a patient condition (exploration) and then decide on the best treatment to give (exploitation). When humans design strategies, they aim for the exploration to be fast, since the patient's health is at stake, and easy to interpret for a physician overseeing the process. However, common bandit algorithms are nothing like that: The regret caused by exploration scales with $\sqrt{H}$ over $H$ rounds and decision strategies are based on opaque statistical considerations. In this paper, we use an original classification view to meta learn interpretable and fast exploration plans for a fixed collection of bandits $\mathbb{M}$. The plan is prescribed by an interpretable decision tree probing decisions' payoff to classify the test bandit. The test regret of the plan in the stochastic and contextual setting scales with $O (λ^{-2} C_λ (\mathbb{M}) \log^2 (MH))$, being $M$ the size of $\mathbb{M}$, $λ$ a separation parameter over the bandits, and $C_λ(\mathbb{M})$ a novel classification-coefficient that fundamentally links meta learning bandits with classification. Through a nearly matching lower bound, we show that $C_λ(\mathbb{M})$ inherently captures the complexity of the setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_04505 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Classification View on Meta Learning Bandits Mutti, Mirco Kwon, Jeongyeol Mannor, Shie Tamar, Aviv Machine Learning Contextual multi-armed bandits are a popular choice to model sequential decision-making. E.g., in a healthcare application we may perform various tests to asses a patient condition (exploration) and then decide on the best treatment to give (exploitation). When humans design strategies, they aim for the exploration to be fast, since the patient's health is at stake, and easy to interpret for a physician overseeing the process. However, common bandit algorithms are nothing like that: The regret caused by exploration scales with $\sqrt{H}$ over $H$ rounds and decision strategies are based on opaque statistical considerations. In this paper, we use an original classification view to meta learn interpretable and fast exploration plans for a fixed collection of bandits $\mathbb{M}$. The plan is prescribed by an interpretable decision tree probing decisions' payoff to classify the test bandit. The test regret of the plan in the stochastic and contextual setting scales with $O (λ^{-2} C_λ (\mathbb{M}) \log^2 (MH))$, being $M$ the size of $\mathbb{M}$, $λ$ a separation parameter over the bandits, and $C_λ(\mathbb{M})$ a novel classification-coefficient that fundamentally links meta learning bandits with classification. Through a nearly matching lower bound, we show that $C_λ(\mathbb{M})$ inherently captures the complexity of the setting. |
| title | A Classification View on Meta Learning Bandits |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2504.04505 |