Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
arXiv:2501.16919v2 Announce Type: replace
Abstract: We study a generalization of the Online Convex Optimization (OCO) framework with time-varying adversarial constraints. In this setting, at each round, the learner selects an action from a convex deci…