Introduces U-function-based policy optimization achieving \tilde O(H^2\sqrt{SAK}) regret for online MDPs with aggregate bandit feedback and known dynamics, matching a new lower bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
Introduces U-function-based policy optimization achieving \tilde O(H^2\sqrt{SAK}) regret for online MDPs with aggregate bandit feedback and known dynamics, matching a new lower bound.