Journal article · 2026 · Open access
Rising rested bandits: Lower bounds and efficient algorithms
Artificial Intelligence, 361, 104638 · Published 6 October 2026 · DOI 10.1016/j.artint.2026.104638
In brief
“Rising rested bandits: Lower bounds and efficient algorithms” is a 2026 journal article by Marco Fiandri and 2 co-authors, published in Artificial Intelligence. OpenAlex counts 3 citations as of 16 November 2026. It is open access under a CC BY licence: the full text is free to read at Artificial Intelligence.
- Citations
- 3
- Most cited in
- 2024 (1)
- Field-weighted impact
- 3.18
- References
- 19
- Authors
- 3
Abstract
This paper is in the field of stochastic Multi-Armed Bandits (MABs), i.e., those sequential selection techniques able to learn online using only the feedback given by the chosen option (a.k.a. arm). We study a particular case of the rested bandits in which the arms’ expected reward is monotonically non-decreasing and concave. We study the inherent sample complexity of the regret minimization problem by deriving suitable regret lower bounds. Then, we design an algorithm for the rested case ( R-ed-UCB ), providing a regret bound depending on the properties of the instance and, under certain circumstances, of ̃ 𝒪 ( 𝑇 2 3 ) . We empirically compare our algorithms with state-of-the-art methods for non-stationary MABs over several synthetically generated tasks and an online model selection problem for a real-world dataset.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Fiandri, M., Metelli, A. M., & Trovò, F. (2026). Rising rested bandits: Lower bounds and efficient algorithms. Artificial Intelligence, 361, 104638. https://doi.org/10.1016/j.artint.2026.104638
MLA 9
Fiandri, Marco, et al. “Rising rested bandits: Lower bounds and efficient algorithms.” Artificial Intelligence, vol. 361, 2026, p. 104638. https://doi.org/10.1016/j.artint.2026.104638.
Chicago
Fiandri, Marco, Alberto Maria Metelli, and Francesco Trovò. 2026. “Rising rested bandits: Lower bounds and efficient algorithms.” Artificial Intelligence 361: 104638. https://doi.org/10.1016/j.artint.2026.104638.
Harvard
Fiandri, M., Metelli, A. M. and Trovò, F. (2026) ‘Rising rested bandits: Lower bounds and efficient algorithms’, Artificial Intelligence, 361, p. 104638. doi:10.1016/j.artint.2026.104638.
IEEE
M. Fiandri, A. M. Metelli, and F. Trovò, “Rising rested bandits: Lower bounds and efficient algorithms,” Artificial Intelligence, vol. 361, p. 104638, 2026, doi: 10.1016/j.artint.2026.104638.
BibTeX
@article{fiandri2026rising,
title = {{Rising rested bandits: Lower bounds and efficient algorithms}},
author = {Fiandri, Marco and Metelli, Alberto Maria and Trovò, Francesco},
journal = {Artificial Intelligence},
year = {2026},
volume = {361},
pages = {104638},
doi = {10.1016/j.artint.2026.104638},
url = {https://doi.org/10.1016/j.artint.2026.104638}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 1 | |
| 2026 | 1 |
Its field-weighted citation impact is 3.18: it has been cited 3.18 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- stochastic bandits
- regret lower bounds
- regret minimization
- non-stationary bandits
- sample complexity
- online model selection
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Fiandri, M., Metelli, A. M., & Trovò, F. (2026). Rising rested bandits: Lower bounds and efficient algorithms. Artificial Intelligence, 361, 104638. https://doi.org/10.1016/j.artint.2026.104638
How many times has this paper been cited?
3 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Artificial Intelligence: sign in and open the PDF from this page.
Who wrote this paper?
Marco Fiandri, Alberto Maria Metelli, Francesco Trovò.
What is the DOI of this paper?
10.1016/j.artint.2026.104638, permanently at https://doi.org/10.1016/j.artint.2026.104638. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.