Signals 4 · free daily AI digest

Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs

Paper recorded by Signals 4 on 2026-09-29 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-29 on arXiv · recorded by Signals 4 on 2026-09-30

Category: cs.LG · 机器学习 · first seen 2026-09-30

Abstract

We study average-reward weakly-coupled Markov decision processes (WCMDPs), where a WCMDP consists of $N$ smaller MDPs, called arms, that share multiple per-step budget constraints. We consider the setting where the arms have identical model parameters, multiple actions, and state- and action-dependent costs. For restless bandits (RBs), a well-studied special case of WCMDPs, prior work has develope

Read on arXiv →

#5 most recent of 334 cs.LG papers we have recorded · ↑ newer: Multi-Agent Flow Matching with Decoupled Generative Guidance · ↓ older: WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms
Cite this page: Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs: the #5 most recent of 334 cs.LG papers we have recorded (as of 2026-09-29). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/achieving-an-o-1-n-optimality-gap-in-average-reward-weakly-coupled-mdps.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions