Worst-case analysis of the perceptron and exponentiated update algorithms

Authors:
Tom Bylander
Affiliations:
The Univ. of Texas at San Antonio, San Antonio
Venue:
Artificial Intelligence
Year:
1998

Citing 0
Cited 4

Learning DNF in time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
PAC Analogues of Perceptron and Winnow Via Boosting the Margin

Machine Learning
Learning DNF in time 2õ(n1/3)

Journal of Computer and System Sciences - STOC 2001
Learning to assign degrees of belief in relational domains

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract