Sciweavers

683 search results - page 63 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICPR
2006
IEEE
14 years 11 months ago
A maximum margin discriminative learning algorithm for temporal signals
We propose a new maximum margin discriminative learning algorithm here for classification of temporal signals. It is superior to conventional HMM in the sense that it does not nee...
Wenjie Xu, Jiankang Wu, Zhiyong Huang
COLT
2003
Springer
14 years 3 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
TIT
2002
72views more  TIT 2002»
13 years 9 months ago
Principal curves with bounded turn
Principal curves, like principal components, are a tool used in multivariate analysis for ends like feature extraction. Defined in their original form, principal curves need not ex...
S. Sandilya, Sanjeev R. Kulkarni
COLT
2004
Springer
14 years 1 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
ICML
2001
IEEE
14 years 10 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor