arXiv Machine Learning November 5, 2026 By Yue Wang

Near-Minimax Sample Complexity for Multi-Objective Reinforcement Learning under Generative Models

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

reinforcement-learning

arXiv Machine Learning

Sep 30

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

Jun 25

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

arXiv:2606. 25170v1 Announce Type: cross Abstract: We study PAC learning in tabular discounted Markov decision processes with exogenous i.

By Corentin Pla, Hugo Richard, Marc Abeille, Vianney Perchet

agents reinforcement-learning

arXiv Machine Learning

Aug 10

Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

arXiv:2608. 06545v1 Announce Type: new Abstract: Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty.

By Yuepeng Yang, Yuxin Chen, Yuejie Chi

reinforcement-learning safety

arXiv Machine Learning

Aug 18

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs

arXiv:2509. 16586v2 Announce Type: replace Abstract: Recent advances have significantly improved our understanding of the sample complexity of learning in average-reward Markov decision processes (AMDPs) under the generative model.

By Yukuan Wei, Xudong Li, Lin F. Yang

reinforcement-learning safety

arXiv Machine Learning

Sep 22

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

arXiv:2302.07477v4 Announce Type: replace Abstract: We study the optimal sample complexity of tabular reinforcement learning for infinite-horizon discounted Markov decision processes. The unrestricte...

By Shengbo Wang, Jose Blanchet, Peter Glynn

reinforcement-learning

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

One email a morning, machine-written

Related stories

Optimal Multi-Reward Reinforcement Learning

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence