Sciweavers

19 search results - page 3 / 4
» Sparse Online Learning via Truncated Gradient
Sort
View
COLT
2000
Springer
13 years 9 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 3 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
CVPR
2010
IEEE
13 years 3 months ago
Visual classification with multi-task joint sparse representation
We address the problem of computing joint sparse representation of visual signal across multiple kernel-based representations. Such a problem arises naturally in supervised visual...
Xiaotong Yuan, Shuicheng Yan
ISCA
2006
IEEE
138views Hardware» more  ISCA 2006»
13 years 11 months ago
Learning-Based SMT Processor Resource Distribution via Hill-Climbing
The key to high performance in Simultaneous Multithreaded (SMT) processors lies in optimizing the distribution of shared resources to active threads. Existing resource distributio...
Seungryul Choi, Donald Yeung
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 5 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...