Name
Abstract | ||
|---|---|---|
We propose to train an ensemble with the help of a reservoir in which the learning algorithm can store a limited number of samples. This novel approach lies in the area between offline and online ensemble approaches and can be seen either as a restriction of the former or an enhancement of the latter. We identify some basic strategies that can be used to populate this reservoir and present our main contribution, dubbed Greedy Edge Expectation Maximization (GEEM), that maintains the reservoir content in the case of Boosting by viewing the samples through their projections into the weak classifier response space. We propose an efficient algorithmic implementation which makes it tractable in practice, and demonstrate its efficiency experimentally on several compute-vision data-sets, on which it outperforms both online and offline methods in a memory constrained setting. |
Year | Venue | Field |
|---|---|---|
2013 | NIPS | Expectation–maximization algorithm,Computer science,Online and offline,Boosting (machine learning),Artificial intelligence,Classifier (linguistics),Ensemble learning,Machine learning |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leonidas Lefakis | 1 | 21 | 3.86 |
| François Fleuret | 2 | 567 | 43.81 |