arXiv Machine Learning June 2, 2026 By Ofir Schlisselberg, Tal Lancewicki, Yishay Mansour

Online Learning in MDPs with Partially Adversarial Transitions and Losses

Read the original on arXiv Machine Learning →

arXiv:2602. 09474v2 Announce Type: replace Abstract: We study reinforcement learning in MDPs whose transition function is stochastic at most steps but may behave adversarially at a fixed subset of $\Lambda$ steps per episode.

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 Statistics ML

3d ago

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning

arXiv:2605.15692v2 Announce Type: replace-cross Abstract: We study episodic reinforcement learning with fixed reward and transition functions, but with episode-dependent admissible action sets that a...

By Zijun Chen, Zihan Zhang

reinforcement-learning safety

arXiv Machine Learning

Jul 23

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

arXiv:2607. 19854v1 Announce Type: new Abstract: We study horizon-free regret minimization for finite-horizon time-homogeneous tabular Markov decision processes with $S$ states, $A$ actions, horizon $H$, and per-trajectory total reward bounded by $1$.

By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du

reinforcement-learning

arXiv Machine Learning

Aug 14

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry

arXiv:2608. 12753v1 Announce Type: new Abstract: We study decentralized multi-player reinforcement learning in episodic tabular Markov decision processes (MDPs) under three forms of information asymmetry: (A) unobserved actions with common rewards, (B) observed actions with independent rewards, and (C) unobserved actions with independent rewards.

By Larissa Xu, King Bi, William Chang

agents reinforcement-learning benchmarks

arXiv Machine Learning

4d ago

Optimal Multi-Reward Reinforcement Learning

arXiv:2609.36486v1 Announce Type: new Abstract: We study an unknown-transition finite-horizon Markov decision process (MDP) with a finite collection of known reward functions $\{r^1, r^2, \ldots, r^M...

By Zijun Chen, Zihan Zhang

reinforcement-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 AI

Jul 15

Learning When to Trust in Contextual Social Bandits

arXiv:2603. 13356v2 Announce Type: replace Abstract: Robust reinforcement learning typically assumes that feedback sources are either globally trustworthy or corrupted within a fixed global budget.

By Majid Ghasemi, Mark Crowley

reinforcement-learning safety

One email a morning, machine-written

Related stories

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry

Optimal Multi-Reward Reinforcement Learning

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

Learning When to Trust in Contextual Social Bandits