The following pages link to Yoav Freund (Q207983):
Displaying 29 items.
- (Q588654) (redirect page) (← links)
- Selective sampling using the query by committee algorithm (Q1369065) (← links)
- A decision-theoretic generalization of on-line learning and an application to boosting (Q1370863) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
- Drifting games and Brownian motion (Q1604221) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Generalization bounds for averaged classifiers (Q1879971) (← links)
- Boosting a weak learning algorithm by majority (Q1899915) (← links)
- Large margin classification using the perceptron algorithm (Q1969320) (← links)
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm (Q2141175) (← links)
- On the \(k\)-means/median cost function (Q2671798) (← links)
- (Q2893108) (← links)
- Automated trading with boosting and expert weighting (Q3564810) (← links)
- (Q4252717) (← links)
- (Q4252718) (← links)
- How to use expert advice (Q4376978) (← links)
- (Q4526998) (← links)
- The Nonstochastic Multiarmed Bandit Problem (Q4785631) (← links)
- 10.1162/1532443041827916 (Q4825996) (← links)
- Random Projection Trees for Vector Quantization (Q4975927) (← links)
- Efficient learning of typical finite automata from random walks (Q5248500) (← links)
- How to use expert advice (Q5248507) (← links)
- (Q5302077) (← links)
- An Online Learning Approach to Occlusion Boundary Detection (Q5370331) (← links)
- Research in Computational Molecular Biology (Q5706905) (← links)
- An adaptive version of the boost by majority algorithm (Q5945698) (← links)
- Discussion on boosting papers. (Q5970582) (← links)
