Worst-case analysis of the Perceptron and Exponentiated Update algorithms

DOI10.1016/S0004-3702(98)00098-8zbMath0910.68164MaRDI QIDQ1277700

Tom Bylander

Publication date: 2 March 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

learning algorithmsmistake boundsabsolute loss boundsrandomized classification algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) ⋮ Learning to assign degrees of belief in relational domains

Cites Work

• Exponentiated gradient versus gradient descent for linear predictors
• A polynomial-time algorithm for learning noisy linear threshold functions
• Tracking the best expert
• The weighted majority algorithm
• The Perceptron: A Model for Brain Functioning. I
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst-case analysis of the Perceptron and Exponentiated Update algorithms