Login / Signup
On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization.
Rahul Vaze
Published in:
WiOpt (2022)
Keyphrases
</>
online convex optimization
constraint violations
hard constraints
online learning
long run
convex optimization
lower bound
cost function
newton method
worst case
logistic regression
temporal constraints
regret bounds
search algorithm
low level
soft constraints
special case