Sciweavers

283 search results - page 52 / 57
» Bounds on the Generalization Performance of Kernel Machine E...
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
JAIR
2000
102views more  JAIR 2000»
13 years 7 months ago
A Model of Inductive Bias Learning
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem bein...
Jonathan Baxter
COLT
2004
Springer
14 years 22 days ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
IPPS
2003
IEEE
14 years 18 days ago
Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
JMLR
2010
123views more  JMLR 2010»
13 years 5 months ago
Maximum Relative Margin and Data-Dependent Regularization
Leading classification methods such as support vector machines (SVMs) and their counterparts achieve strong generalization performance by maximizing the margin of separation betw...
Pannagadatta K. Shivaswamy, Tony Jebara