Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.15962 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909545484255232 |
|---|---|
| author | Barbier-Chebbah, Alex Vestergaard, Christian L. Masson, Jean-Baptiste |
| author_facet | Barbier-Chebbah, Alex Vestergaard, Christian L. Masson, Jean-Baptiste |
| contents | Information and free-energy maximization are physics principles that provide general rules for an agent to optimize actions in line with specific goals and policies. These principles are the building blocks for designing decision-making policies capable of efficient performance with only partial information. Notably, the information maximization principle has shown remarkable success in the classical bandit problem and has recently been shown to yield optimal algorithms for Gaussian and sub-Gaussian reward distributions. This article explores a broad extension of physics-based approaches to more complex and structured bandit problems. To this end, we cover three distinct types of bandit problems, where information maximization is adapted and leads to strong performance. Since the main challenge of information maximization lies in avoiding over-exploration, we highlight how information is tailored at various levels to mitigate this issue, paving the way for more efficient and robust decision-making strategies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15962 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Information maximization for a broad variety of multi-armed bandit games Barbier-Chebbah, Alex Vestergaard, Christian L. Masson, Jean-Baptiste Machine Learning Statistical Mechanics Information and free-energy maximization are physics principles that provide general rules for an agent to optimize actions in line with specific goals and policies. These principles are the building blocks for designing decision-making policies capable of efficient performance with only partial information. Notably, the information maximization principle has shown remarkable success in the classical bandit problem and has recently been shown to yield optimal algorithms for Gaussian and sub-Gaussian reward distributions. This article explores a broad extension of physics-based approaches to more complex and structured bandit problems. To this end, we cover three distinct types of bandit problems, where information maximization is adapted and leads to strong performance. Since the main challenge of information maximization lies in avoiding over-exploration, we highlight how information is tailored at various levels to mitigate this issue, paving the way for more efficient and robust decision-making strategies. |
| title | Information maximization for a broad variety of multi-armed bandit games |
| topic | Machine Learning Statistical Mechanics |
| url | https://arxiv.org/abs/2503.15962 |