A primal-dual perspective of online learning algorithms
type: Item
instance of: scholarly article
title: A primal-dual perspective of online learning algorithms
zbMATH Open document ID: 1470.68172
author: Shai Shalev-Shwartz
author: Yoram Singer
published in: Machine Learning
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5537343
zbMATH Keywords: online learning
zbMATH Keywords: mistake bounds
zbMATH Keywords: duality
zbMATH Keywords: regret bounds
describes a project that uses: Forgetron
MaRDI profile type: Publication
full work available at URL: s10994-007-5014-x
OpenAlex ID: W2074586650
cites work: Relative loss bounds for on-line density estimation with the exponential family of distributions
cites work: Q4821526
cites work: Q5580053
cites work: Q4718793
cites work: On the Generalization Ability of On-Line Learning Algorithms
cites work: A Second-Order Perceptron Algorithm
cites work: Q3093359
cites work: The Forgetron: A Kernel-Based Perceptron on a Budget
cites work: 10.1162/15324430260185600
cites work: The robustness of the \(p\)-norm algorithms
cites work: General convergence results for linear discriminant updates
cites work: Q3245635
cites work: Exponentiated gradient versus gradient descent for linear predictors
cites work: Relative loss bounds for multidimensional regression problems
cites work: Online Learning with Kernels
cites work: The relaxed online maximum margin algorithm
cites work: Convex Analysis
cites work: Competitive On-line Statistics
DOI: 10.1007/S10994-007-5014-X
description: scientific article; zbMATH DE number 5537343