arXiv Machine Learning July 24, 2026 By Jia Wan, Sean R. Sinclair, Devavrat Shah, Martin J. Wainwright

Exploiting Exogenous Structure for Sample-Efficient Reinforcement Learning

Read the original on arXiv Machine Learning →

arXiv:2409. 14557v4 Announce Type: replace-cross Abstract: We study a structured class of Markov Decision Processes, known as Exo-MDPs, in which the state space is partitioned into exogenous and endogenous components.

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

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

4d ago

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

arXiv:2609.37660v1 Announce Type: new Abstract: We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each roun...

By Wansoo Choi, Seoungbin Bae, Dabeen Lee

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

Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process

arXiv:2606. 16729v1 Announce Type: new Abstract: While there is an extensive body of work characterizing the sample complexity of discounted cumulative-reward MDPs, finite sample analyses for average-reward MDPs have been limited, and most existing works rely on restrictive assumptions such as ergodicity or access to a generative model.

By Jongmin Lee, Ernest K. Ryu, Vaneet Aggarwal

reinforcement-learning

arXiv Machine Learning

Jul 21

Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning

arXiv:2607. 17201v1 Announce Type: cross Abstract: In this work we study the Best Policy Identification (BPI) problem in online, tabular Reinforcement Learning.

By Joseph Lazzaro, Alessio Russo, Aldo Pacchiano

agents reinforcement-learning

One email a morning, machine-written

Related stories

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

Optimal Multi-Reward Reinforcement Learning

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process

Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning