We propose a new online learning algorithm which provably approximates maximum margin classifiers with bias, where the margin is defined in terms of p-norm distance. Although learning of linear classifiers with bias can be reduced to learning of those without bias, the known reduction might lose the margin and slow down the convergence of online learning algorithms. Our algorithm, unlike previous online learning algorithms, implicitly uses a new reduction which preserves the margin and avoids such possible deficiencies. Our preliminary experiments show that our algorithm runs much faster than previous algorithms especially when the underlying linear classifier has large bias.
|Number of pages||12|
|Publication status||Published - Dec 1 2008|
|Event||21st Annual Conference on Learning Theory, COLT 2008 - Helsinki, Finland|
Duration: Jul 9 2008 → Jul 12 2008
|Other||21st Annual Conference on Learning Theory, COLT 2008|
|Period||7/9/08 → 7/12/08|
All Science Journal Classification (ASJC) codes