Sciweavers

683 search results - page 74 / 137
» Generalization Bounds for Learning Kernels
Sort
View
NIPS
2008
13 years 11 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
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...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
14 years 3 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
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 ,...
Zhixiang Chen, Bin Fu
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 4 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
ALT
2006
Springer
14 years 6 months ago
Active Learning in the Non-realizable Case
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...
Matti Kääriäinen
ICML
2010
IEEE
13 years 11 months ago
Internal Rewards Mitigate Agent Boundedness
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...
Jonathan Sorg, Satinder P. Singh, Richard Lewis