Sciweavers

227 search results - page 30 / 46
» Generalized multiagent learning with performance bound
Sort
View
JMLR
2010
179views more  JMLR 2010»
13 years 3 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
SIGIR
2002
ACM
13 years 8 months ago
A new family of online algorithms for category ranking
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
Koby Crammer, Yoram Singer
COLT
2005
Springer
14 years 2 months ago
Ranking and Scoring Using Empirical Risk Minimization
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
Stéphan Clémençon, Gáb...
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
14 years 20 days ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
COLT
2008
Springer
13 years 10 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...