Breaking the $O(\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\sqrt{T})$ Static Regret in Constrained Online …
arXiv:2603.20671v1 Announce Type: new Abstract: The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action …
Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze
조회수 34회