Sciweavers

13 search results - page 2 / 3
» The Importance of Convexity in Learning with Squared Loss
Sort
View
COLT
2007
Springer
13 years 12 months ago
Aggregation by Exponential Weighting and Sharp Oracle Inequalities
In the present paper, we study the problem of aggregation under the squared loss in the model of regression with deterministic design. We obtain sharp oracle inequalities for conve...
Arnak S. Dalalyan, Alexandre B. Tsybakov
ALT
2004
Springer
14 years 2 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
JMLR
2010
121views more  JMLR 2010»
13 years 17 days ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
ESANN
2004
13 years 7 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
PR
2010
163views more  PR 2010»
13 years 4 months ago
Optimal feature selection for support vector machines
Selecting relevant features for Support Vector Machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and ...
Minh Hoai Nguyen, Fernando De la Torre