Sciweavers

701 search results - page 33 / 141
» Self Bounding Learning Algorithms
Sort
View
COLT
2005
Springer
14 years 3 months ago
Stability and Generalization of Bipartite Ranking Algorithms
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Partha Niyogi
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 7 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
COLT
2006
Springer
14 years 1 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert
ECML
2003
Springer
14 years 2 months ago
Evaluation of Topographic Clustering and Its Kernelization
We consider the topographic clustering task and focus on the problem of its evaluation, which enables to perform model selection: topographic clustering algorithms, from the origin...
Marie-Jeanne Lesot, Florence d'Alché-Buc, G...
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 9 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli