The following pages link to (Q4252716):
Displayed 5 items.
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Q1127362) (← links)
- Worst-case analysis of the Perceptron and Exponentiated Update algorithms (Q1277700) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)