Sciweavers

159 search results - page 17 / 32
» Margin Maximizing Loss Functions
Sort
View
CORR
2007
Springer
112views Education» more  CORR 2007»
14 years 11 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
COLT
2000
Springer
15 years 4 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
NIPS
2001
15 years 1 months ago
Online Learning with Kernels
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
Jyrki Kivinen, Alex J. Smola, Robert C. Williamson
TIT
1998
80views more  TIT 1998»
14 years 11 months ago
Structural Risk Minimization Over Data-Dependent Hierarchies
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
John Shawe-Taylor, Peter L. Bartlett, Robert C. Wi...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
14 years 11 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...