Ultraconservative online algorithms for multiclass problems

DOI10.1007/3-540-44581-1_7MaRDI QIDQ3148801zbMATH OpenFDO

Authors Koby Crammer, Yoram Singer

Publication date 22 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2111/21110099

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• 10.1162/jmlr.2003.3.4-5.951
• scientific article; zbMATH DE number 5957338
• Online Regularized Classification Algorithms
• The relaxed online maximum margin algorithm
• scientific article; zbMATH DE number 1966610

Cited in

(8)

• Unconfused ultraconservative multiclass algorithms
• On multicriteria online problems
• On Online Labeling with Polynomially Many Labels
• Adaptive regularization of weight vectors
• scientific article; zbMATH DE number 1966610 (Why is no real title available?)
• 10.1162/153244303322533188
• 10.1162/jmlr.2003.3.4-5.951
• The relaxed online maximum margin algorithm

This page was built for publication: Ultraconservative online algorithms for multiclass problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148801)