Continuity-Free Near-Minimax Leading-Order Regret for CVaR-UCBVI
arXiv:2608.28960v1 Announce Type: new Abstract: For finite-horizon tabular CVaR reinforcement learning, prior work proves a widetilde{O}(au^{-1}sqrt{SAK}) leading regret bound for arbitrary normalized