The following pages link to Tracking the best disjunction (Q1275393):
Displaying 8 items.
- Tracking the best hyperplane with a simple budget perceptron (Q1009215) (← links)
- Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning (Q1009287) (← links)
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Q1127362) (← links)
- Direct and indirect algorithms for on-line learning of disjunctions (Q1603594) (← links)
- Adaptive and self-confident on-line learning algorithms (Q1604218) (← links)
- Projective DNF formulae and their revision (Q2473048) (← links)
- Competitive On-line Statistics (Q4831997) (← links)
- Agnostic learning of geometric patterns (Q5943123) (← links)
