arXiv Machine Learning July 23, 2026 By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

Read the original on arXiv Machine Learning →

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$.

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.

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

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

Aug 26

Optimal Alternating Regret for Online Learning and Games

arXiv:2608.24731v1 Announce Type: new Abstract: We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimizat...

By Yixin Tao, Weiqiang Zheng

arXiv Machine Learning

Aug 27

Minimax Alternating Regret for the Experts Problem and Online Convex Optimization

arXiv:2608. 25182v1 Announce Type: cross Abstract: In this paper, we study alternating regret in online convex optimization (OCO), motivated by the success of alternating learning dynamics in two-player games.

By Mengxiao Zhang

arXiv Machine Learning

Jun 2

Online Learning in MDPs with Partially Adversarial Transitions and Losses

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.

By Ofir Schlisselberg, Tal Lancewicki, Yishay Mansour

reinforcement-learning safety

arXiv Machine Learning

Aug 18

Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits

arXiv:2608. 15996v1 Announce Type: new Abstract: We study second-order path-length regret in adversarial $K$-armed bandits against oblivious loss sequences.

By Mengxiao Zhang

reinforcement-learning safety

One email a morning, machine-written

Related stories

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning

Optimal Multi-Reward Reinforcement Learning

Optimal Alternating Regret for Online Learning and Games

Minimax Alternating Regret for the Experts Problem and Online Convex Optimization

Online Learning in MDPs with Partially Adversarial Transitions and Losses

Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits