Sciweavers

780 search results - page 52 / 156
» Cost-Sharing Approximations for h
Sort
View
COLT
1993
Springer
13 years 11 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
EUROGP
2007
Springer
143views Optimization» more  EUROGP 2007»
13 years 11 months ago
Confidence Intervals for Computational Effort Comparisons
Abstract. When researchers make alterations to the genetic programming algorithm they almost invariably wish to measure the change in performance of the evolutionary system. No one...
Matthew Walker, Howard Edwards, Chris H. Messom
ESANN
2001
13 years 8 months ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron
CSDA
2010
119views more  CSDA 2010»
13 years 7 months ago
Fast robust estimation of prediction error based on resampling
Robust estimators of the prediction error of a linear model are proposed. The estimators are based on the resampling techniques cross-validation and bootstrap. The robustness of t...
Jafar A. Khan, Stefan Van Aelst, Ruben H. Zamar
COMPUTING
2006
110views more  COMPUTING 2006»
13 years 7 months ago
An Alternative Algorithm for a Sliding Window ULV Decomposition
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...
H. Erbay, J. Barlow