In many sequential decision problems, an agent performs a repeated task. He then suffers regret and obtains information that he may use in the following rounds. However, sometimes the agent may also obtain information and avoid suffering regret by querying external sources. We study the trade-off between the information an agent accumulates and the regret it suffers. We invoke information-theoretic methods for obtaining regret lower bounds, that also allow us to easily re-derive several known lower bounds. We introduce the first Bayesian regret lower bounds that depend on the information an agent accumulates. We also prove regret upper bounds using the amount of information the agent accumulates. These bounds show that information measured in bits, can be traded off for regret, measured in reward. Finally, we demonstrate the utility of these bounds in improving the performance of a question-answering task with large language models, allowing us to obtain valuable insights.
View on arXiv@article{shufaro2025_2405.16581,
title={ On Bits and Bandits: Quantifying the Regret-Information Trade-off },
author={ Itai Shufaro and Nadav Merlis and Nir Weinberger and Shie Mannor },
journal={arXiv preprint arXiv:2405.16581},
year={ 2025 }
}