Logarithmic Regret Algorithms for Strongly Convex Repeated Games


Many problems arising in machine learning can be cast as a convex optimization problem, in which a sum of a loss term and a regularization term is minimized. For example, in Support Vector Machines the loss term is the average hinge-loss of a vector over a training set of examples and the regularization term is the squared Euclidean norm of this vector. In… (More)


1 Figure or Table


Citations per Year

67 Citations

Semantic Scholar estimates that this publication has 67 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics