Sciweavers

683 search results - page 32 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Multiclass multiple kernel learning
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
Alexander Zien, Cheng Soon Ong
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 8 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
ICML
2010
IEEE
13 years 9 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
NIPS
2008
13 years 10 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
NIPS
2003
13 years 9 months ago
Error Bounds for Transductive Learning via Compression and Clustering
This paper is concerned with transductive learning. Although transduction appears to be an easier task than induction, there have not been many provably useful algorithms and boun...
Philip Derbeko, Ran El-Yaniv, Ron Meir