Sciweavers

3050 search results - page 331 / 610
» On-line Algorithms in Machine Learning
Sort
View
ML
2008
ACM
15 years 6 months ago
Incremental exemplar learning schemes for classification on embedded devices
Although memory-based classifiers offer robust classification performance, their widespread usage on embedded devices is hindered due to the device's limited memory resources...
Ankur Jain, Daniel Nikovski
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
16 years 21 days ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
ICML
2008
IEEE
16 years 7 months ago
Training structural SVMs when exact inference is intractable
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
Thomas Finley, Thorsten Joachims
ICML
2004
IEEE
16 years 7 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
COLT
2007
Springer
16 years 21 days ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...