Login / Signup
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees.
Dan Garber
Ben Kretzu
Published in:
COLT (2022)
Keyphrases
</>
online convex optimization
online learning
long run
newton method
worst case
convex optimization
support vector machine
binary classification
theoretical guarantees
regret bounds
learning algorithm
e learning
optimization problems
sufficient conditions
loss function