Search papers, labs, and topics across Lattice.
Affiliation:
3
0
3
Nonpreemptive queueing breaks standard myopic priority rules because optimal decisions fundamentally depend on the remaining horizon, yet certainty-equivalence Bellman planning can still match the theoretical lower bound at $\widetilde{O}(\sqrt{d/T})$ regret.
Achieving optimal regret and constraint violation without relying on Slater's condition could revolutionize how we approach online convex optimization.
Achieving a rate-optimal queue length regret of $\widetilde{\mathcal{O}}(T^{-1/2})$ reveals that strategic exploration can significantly enhance learning efficiency in contextual queueing environments.
