683 search results - page 74 / 137 » Generalization Bounds for Learning Kernels |
129
click to vote
NIPS
2008
15 years 4 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
109
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
135
Voted
ML
2010
ACM
14 years 9 months ago
2010
ACM
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
125
click to vote
ALT
2006
Springer
15 years 12 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...