Search papers, labs, and topics across Lattice.
1
0
3
8
Optimal regret in adversarial MDPs with stochastic hard constraints is finally achieved, bridging the gap between existing upper and lower bounds by achieving $\widetilde{\mathcal{O}}(\sqrt{T}/\rho + 1/(d\rho))$ regret.
