267 search results - page 4 / 54 » Convex optimization for the design of learning machines |
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
ICML
2009
IEEE
14 years 1 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
COLT
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
COLT
2005
Springer
14 years 16 days ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
— We propose a new family of classification algorithms in the spirit of support vector machines, that builds in non-conservative protection to noise and controls overfitting. O...