No takes yet. Share an insight, caveat, or question.
Algorithmic analysis demonstrates sublinear regret and constraint violation in online convex optimization without Slater conditions, highlighting broader applicability to general equality constraints.
Wei et al. (2020) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: