8381 search results - page 1183 / 1677 » The security of machine learning |
162
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
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...
186
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
230
click to vote
ALT
1999
Springer
15 years 11 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
187
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
262
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...