arXiv Machine Learning June 30, 2026 By Gianmarco Genalti, Marco Mussi, Nicola Gatti, Marcello Restelli, Matteo Castiglioni, Alberto Maria Metelli

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting

Read the original on arXiv Machine Learning →

arXiv:2409. 05980v2 Announce Type: replace-cross Abstract: Rested and Restless Bandits are two well-known bandit settings that are useful to model real-world sequential decision-making problems in which the expected reward of an arm evolves over time due to the actions we perform or due to the nature.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

reinforcement-learning

arXiv AI

Jul 14

Learning from Local Walks on Dynamic Graphs with Bandit Feedback

arXiv:2607. 10571v1 Announce Type: cross Abstract: We study stochastic multi-armed bandits on dynamic graphs, where arms correspond to the vertices of a network with time-varying edges.

By Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni, Lijun Chen

reinforcement-learning safety

Hugging Face Trending Papers

Jul 15

Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation

We study the contextual combinatorial semi-bandit (CCSB) problem with general reward function approximation. At each round, the learner observes a context, selects a combinatorial action consisting of a subset of basic arms, and receives the reward of each selected arm; the goal is to maximize the cumulative reward over time.

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 29

Learning in Markovian bandits with non-observable states and constrained decision epochs

arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.

By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop

reinforcement-learning benchmarks safety

arXiv Machine Learning

Jun 9

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

arXiv:2606. 08977v1 Announce Type: new Abstract: Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper.

By Vladimir Braverman, Chen Wang, Liudeng Wang, Samson Zhou

arXiv Machine Learning

Jun 9

Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees

arXiv:2606. 09002v1 Announce Type: cross Abstract: We study a stochastic multi-armed bandit problem in which the set of available arms expands over time.

By Deqi Zheng, Xiaoyang Xu, Yuhong Yang

reinforcement-learning benchmarks

arXiv Machine Learning

Jul 16

Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation

arXiv:2607. 13686v1 Announce Type: new Abstract: We study the contextual combinatorial semi-bandit (CCSB) problem with general reward function approximation.

By Hao Qin, Chicheng Zhang

reinforcement-learning benchmarks

Related stories

Learning from Local Walks on Dynamic Graphs with Bandit Feedback

Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation

Learning in Markovian bandits with non-observable states and constrained decision epochs

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees

Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation