Multi-Class Confidence Weighted Algorithms

The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW learning updates and inference cannot be computed analytically or solved as convex optimization problems as they are in the binary case. We derive learning algorithms for the multi-class CW setting and provide extensive evaluation using nine NLP datasets, including three derived from the recently released New York Times corpus. Our best algorithm outperforms state-of-the-art online and batch methods on eight of the nine tasks. We also show that the confidence information maintained during learning yields useful probabilistic information at test time.

• Type: Journal
• Year: 2009
• Where: EMNLP
• Authors: Koby Crammer, Mark Dredze, Alex Kulesza
• Keywords: Algorithm, Binary Nlp Tasks, Convex Optimization Problems, EMNLP 2009, Natural Language Processing