Pages that link to "Item:Q1127362"
From MaRDI portal
The following pages link to The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Q1127362):
Displaying 13 items.
- Selection of relevant features and examples in machine learning (Q1127357) (← links)
- Tracking the best disjunction (Q1275393) (← links)
- Worst-case analysis of the Perceptron and Exponentiated Update algorithms (Q1277700) (← links)
- On the perceptron learning algorithm on data with high precision (Q1329165) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- Direct and indirect algorithms for on-line learning of disjunctions (Q1603594) (← links)
- On approximating weighted sums with exponentially many terms (Q1880781) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Minimum generalization via reflection: A fast linear threshold learner (Q1961322) (← links)
- Prototype Classification: Insights from Machine Learning (Q3612119) (← links)
- Sequential correction of linear classifiers (Q5128959) (← links)
- Robust logics (Q5918074) (← links)
- Agnostic learning of geometric patterns (Q5943123) (← links)
