arXiv Machine Learning June 29, 2026 By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop

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

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 15

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...

By Mengxiao Zhang

safety

arXiv Machine Learning

Aug 3

Parameter-Free Heavy-Tailed Bandits

arXiv:2607. 29460v1 Announce Type: new Abstract: Heavy-tailed distributions arise naturally in sequential decision-making problems such as financial investment, online advertising, and network management, where rare but extreme outcomes can dominate performance.

By Gianmarco Genalti, Alberto Maria Metelli

arXiv Machine Learning

2d ago

Regret Analysis of Retry-Based Bandits

arXiv:2605.20854v3 Announce Type: replace Abstract: We provide the first regret analysis of ReMax in stochastic multi-armed bandits. Originally introduced for reinforcement learning, ReMax is motivat...

By Bingkui Tong, Junpei Komiyama, Soichiro Nishimori, Paavo Parmas

reinforcement-learning

arXiv Machine Learning

2d ago

Rising Multi-Armed Bandits with Known Horizons

arXiv:2602.10727v3 Announce Type: replace Abstract: Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such proble...

By Seockbean Song, Chenyu Gan, Youngsik Yoon, Siwei Wang, Wei Chen, Jungseul Ok

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 9

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

arXiv:2606. 09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates.

By Seoungbin Bae, Dabeen Lee

arXiv Machine Learning

Aug 26

An Efficient Minimax-Optimal Algorithm for Adversarial $m$-Set Bandits

arXiv:2608. 12231v2 Announce Type: replace Abstract: We study adversarial combinatorial bandits with $m$-set actions, where at each round the learner selects $m$ out of $d$ items and observes only the aggregate loss of the selected items.

By Francesco Bacchiocchi, Tommaso Cesari, Roberto Colomboni

safety

One email a morning, machine-written

Related stories

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

Parameter-Free Heavy-Tailed Bandits

Regret Analysis of Retry-Based Bandits

Rising Multi-Armed Bandits with Known Horizons

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

An Efficient Minimax-Optimal Algorithm for Adversarial $m$-Set Bandits