Sciweavers

227 search results - page 3 / 46
» A PAC Bound for Approximate Support Vector Machines
Sort
View
ML
2008
ACM
162views Machine Learning» more  ML 2008»
13 years 7 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
14 years 1 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario
COLT
2003
Springer
14 years 17 days 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
JMLR
2006
91views more  JMLR 2006»
13 years 7 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...