Online learning with kernels

Jyrki Kivinen, Alex J. Smola, Robert C. Williamson

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    46 Citations (Scopus)

    Abstract

    We consider online learning in a Reproducing Kernel Hilbert Space. Our method is computationally efficient and leads to simple algorithms. In particular we derive update equations for classification, regression, and novelty detection. The inclusion of the ε -trick allows us to give a robust parameterization. Moreover, unlike in batch learning where the ε -trick only applies to the ν -insensitive loss function we are able to derive general trimmed-mean types of estimators such as for Huber's robust loss.

    Original languageEnglish
    Title of host publicationAdvances in Neural Information Processing Systems 14 - Proceedings of the 2001 Conference, NIPS 2001
    PublisherNeural Information Processing Systems Foundation
    ISBN (Print)0262042088, 9780262042086
    Publication statusPublished - 2002
    Event15th Annual Neural Information Processing Systems Conference, NIPS 2001 - Vancouver, BC, Canada
    Duration: 3 Dec 20018 Dec 2001

    Publication series

    NameAdvances in Neural Information Processing Systems
    ISSN (Print)1049-5258

    Conference

    Conference15th Annual Neural Information Processing Systems Conference, NIPS 2001
    Country/TerritoryCanada
    CityVancouver, BC
    Period3/12/018/12/01

    Fingerprint

    Dive into the research topics of 'Online learning with kernels'. Together they form a unique fingerprint.

    Cite this