arXiv AI
Instance-Dependent Regret for CMDPs with Step-Wise Constraints
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jun 2
Online Learning in MDPs with Partially Adversarial Transitions and Losses
arXiv:2602. 09474v2 Announce Type: replace Abstract: We study reinforcement learning in MDPs whose transition function is stochastic at most steps but may behave adversarially at a fixed subset of $\Lambda$ steps per episode.
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$.
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...
arXiv Statistics ML
Oct 1
Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
arXiv:2605.15692v2 Announce Type: replace-cross Abstract: We study episodic reinforcement learning with fixed reward and transition functions, but with episode-dependent admissible action sets that a...
arXiv Machine Learning
Jul 14
Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
arXiv:2509. 20114v3 Announce Type: replace Abstract: We study \emph{online episodic Constrained Markov Decision Processes} (CMDPs) under both stochastic and adversarial constraints.
arXiv Machine Learning
Oct 9
Toward Optimal Regret in Adversarial MDPs with Stochastic Hard Constraints
arXiv:2610. 12153v1 Announce Type: new Abstract: We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints.