# Rising Rested MAB with Linear Drift

arXiv: https://arxiv.org/abs/2501.04403 · HTML: https://mlsanity.com/paper/2501.04403/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jan 2025.

## Built on by (most cited first, 1 of 1)

- [Rising Multi-Armed Bandits with Known Horizons](https://mlsanity.com/paper/2602.10727/) (2026)

## Abstract (arXiv)

We consider non-stationary multi-arm bandit (MAB) where the expected reward of each action follows a linear function of the number of times we executed the action. Our main result is a tight regret bound of tildeTheta(T4/5K3/5), by providing both upper and lower bounds. We extend our results to derive instance dependent regret bounds, which depend on the unknown parametrization of the linear drift of the rewards.