2 papers
cs.LG2026
Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
Dhruv Sarkar, Aprameyo Chakrabartty, Subhamon Supantha +2
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…
cs.LG2026
Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
Subhamon Supantha, Abhishek Sinha
We consider a generalization of the celebrated Online Convex Optimization (OCO) framework with adversarial online constraints. In this problem, an online learner interacts with an…