arXiv Machine Learning August 10, 2026 By Yuepeng Yang, Yuxin Chen, Yuejie Chi

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

Read the original on arXiv Machine Learning →

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

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

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

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

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

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

Jun 15

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

arXiv:2606. 14095v1 Announce Type: new Abstract: We study the sample complexity of learning in average-reward weakly-coupled Markov decision processes (WCMDPs) and Restless Bandits (RBs) under a generative model.

By Tianhao Wu, Matthew Zurek, Weina Wang, Qiaomin Xie

reinforcement-learning safety

arXiv Machine Learning

Sep 4

Adaptive Resolving Methods for Markov Decision Processes with Function Approximations

arXiv:2505. 12037v2 Announce Type: replace Abstract: Learning the optimal policy for Markov decision process problems (MDPs) from samples is a fundamental problem in online and data-driven decision-making.

By Jiashuo Jiang, Yinyu Ye, Yiming Zong

reinforcement-learning

One email a morning, machine-written

Related stories

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

Optimal Multi-Reward Reinforcement Learning

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

Adaptive Resolving Methods for Markov Decision Processes with Function Approximations