Claudio Gentile, Manfred K. Warmuth  Home/Search
Context Related
| ucsc.edu/~manfred/pubs/hinge.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsc.edu/~manfred/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a unifying method for proving relative loss bounds for online linear threshold classification algorithms, such as the Perceptron and the Winnow algorithms. For classification problems the discrete loss is used, i.e., the total number of prediction mistakes. We introduce a continuous loss function, called the "linear hinge loss", that can be employed to derive the updates of the algorithms. We first prove bounds w.r.t. the linear hinge loss and then convert them to the discrete ... (Update)
Cited by: More
Journal of Machine Learning Research 7 (2006) 1205--1230 .. - For Linear.. (Correct)
Learning Algorithms for Enclosing Points in Bregmanian Spheres - Crammer, Singer (2003) (Correct)
Potential-based Algorithms in On-line Prediction and Game.. - Cesa-Bianchi, Lugosi (2001) (Correct)
Active bibliography (related documents): More All
0.3: Continuous And Discrete-Time Nonlinear Gradient Descent.. - Warmuth, Jagota (1997) (Correct)
0.3: Relative Loss Bounds for Multidimensional Regression Problems - Jyrki Kivinen (1997) (Correct)
0.1: Adaptive and Self-Confident On-Line Learning Algorithms - Auer, Gentile (2000) (Correct)
Similar documents based on text: More All
0.9: Theory, 1998. [BB, p.90] A. Blum and C. Burch. On-line.. - Proc Th Annu (Correct)
0.9: Direct and Indirect Algorithms for On-line Learning of.. - Helmbold, Panizza.. (1999) (Correct)
0.7: Relative Loss Bounds for On-line Density Estimation with the.. - Azoury, Warmuth (1999) (Correct)
Related documents from co-citation: More All
9: General convergence results for linear discriminant updates - Grove, Littlestone et al. - 1997
9: Learning quickly when irrelevant attributes abound: A new linearthreshold algori.. (context) - Littlestone - 1988
8: Relative loss bounds for multidimensional regression problems - Kivinen, Warmuth - 1997
BibTeX entry: (Update)
C. Gentile and M. K. Warmuth. Linear hinge loss and average margin. In Proc. NIPS'98, 1998. http://citeseer.ist.psu.edu/gentile98linear.html More
@misc{ gentile98linear,
author = "C. Gentile and M. Warmuth",
title = "Linear hinge loss and average margin",
text = "C. Gentile and M. K. Warmuth. Linear hinge loss and average margin. In
Proc. NIPS'98, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/gentile98linear.html" }
Citations (may not include all citations):84 Learning when irrelevant attributes abound: A new linearthre.. (context) - Littlestone - 1988
74 Mistake Bounds and Logarithmic Linear-threshold Learning Alg.. (context) - Littlestone - 1989
73 Additive versus exponentiated gradient updates for linear pr.. (context) - Kivinen, Warmuth - 1997
64 and linear threshold learning using Winnow (context) - Littlestone, attributes et al. - 1991
50 Large margin classification using the perceptron algorithm - Freund, Schapire - 1998
49 General convergence results for linear discriminant updates - Grove, Littlestone et al. - 1997
35 The relaxation method of finding the common point of convex .. (context) - Bregman - 1967
30 Relative loss bounds for multidimensional regression problem.. - Kivinen, Warmuth - 1998
27 logarithmic mistake bounds when few input variables are rele.. (context) - Kivinen, Warmuth et al. - 1997
22 Worst-case loss bounds for sigmoided linear neurons (context) - Helmbold, Kivinen et al.
4 Relative loss bounds and the exponential family of distribut.. (context) - Azoury, Warmuth - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ucsc.edu/~manfred/pubs.html): More
A New Parameter Estimation Method for Gaussian Mixtures - Singer, Warmuth (1998) (Correct)
On-Line Portfolio Selection Using Multiplicative Updates - Helmbold, Schapire, Singer, .. (1998) (Correct)
A Comparison of New and Old Algorithms for A Mixture.. - Helmbold, Schapire (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC