no code implementations • 7 Dec 2023 • Yeongjong Kim, Dabeen Lee
This paper considers stochastic-constrained stochastic optimization where the stochastic constraint is to satisfy that the expectation of a random function is below a certain threshold.
no code implementations • 26 Jan 2023 • Yeongjong Kim, Dabeen Lee
We propose a variant of the drift-plus-penalty algorithm that guarantees $O(\sqrt{T})$ expected regret and zero constraint violation, after a fixed number of iterations, which improves the vanilla drift-plus-penalty method with $O(\sqrt{T})$ constraint violation.