𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the generalization ability of on-line learning algorithms

✍ Scribed by Cesa-Bianchi, N.; Conconi, A.; Gentile, C.


Book ID
114638411
Publisher
IEEE
Year
2004
Tongue
English
Weight
213 KB
Volume
50
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Boosting Ability of Top–Down Deci
✍ Michael Kearns; Yishay Mansour πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 513 KB

We analyze the performance of top down algorithms for decision tree learning, such as those employed by the widely used C4.5 and CART software packages. Our main result is a proof that such algorithms are boosting algorithms. By this we mean that if the functions that label the internal nodes of the

Adaptive and Self-Confident On-Line Lear
✍ Peter Auer; NicolΓ² Cesa-Bianchi; Claudio Gentile πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 216 KB

We study on-line learning in the linear regression framework. Most of the performance bounds for on-line algorithms in this framework assume a constant learning rate. To achieve these bounds the learning rate must be optimized based on a posteriori information. This information depends on the whole

Line Generalization on the Sphere
✍ James E. Burt πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 491 KB