Sciweavers

180 search results - page 18 / 36
» ml 2007
Sort
View
ML
2007
ACM
153views Machine Learning» more  ML 2007»
13 years 10 months ago
Multi-Class Learning by Smoothed Boosting
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
Rong Jin, Jian Zhang 0003
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 10 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 10 months ago
A general criterion and an algorithmic framework for learning in multi-agent systems
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
Rob Powers, Yoav Shoham, Thuc Vu
ML
2007
ACM
192views Machine Learning» more  ML 2007»
13 years 10 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 10 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov