🏢 Tata Institute of Fundamental Research
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
·1266 words·6 mins·
loading
·
loading
AI Theory
Optimization
🏢 Tata Institute of Fundamental Research
Optimal algorithms for online convex optimization with adversarial constraints are developed, achieving O(√T) regret and Õ(√T) constraint violation—a breakthrough in the field.