227 search results - page 25 / 46 » A PAC Bound for Approximate Support Vector Machines |
TIFS
2008
13 years 7 months ago
2008
This paper presents a method for detection of double JPEG compression and a maximum likelihood estimator of the primary quality factor. These methods are essential for construction...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
INFORMS
2000
13 years 7 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Taking inspiration from approximate ranking, this paper investigates the use of rank-based Support Vector Machine as surrogate model within CMA-ES, enforcing the invarian...