arxiv
PublishedJune 15, 2026 at 4:00 AM
Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs
Publisher summary· verbatim
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. Naive reduction to a tabular MDP leads to high complexity bounds as the state-action spa
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivNumbers Already Carry Their Own Embeddings8harxivFrom Prompts to Responses: Dual-Sided Data Leakage and Defense in Split Large Language Models8harxivUniversal Manipulation Exoskeleton: Learning Compliant Whole-body Policies with Real-time Torque Feedback8harxivChronoID: Infusing Explicit Temporal Signals into Semantic IDs for Generative Recommendation8hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗