Sciweavers

1435 search results - page 3 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ML
2002
ACM
178views Machine Learning» more  ML 2002»
13 years 5 months ago
Metric-Based Methods for Adaptive Model Selection and Regularization
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
Dale Schuurmans, Finnegan Southey
TNN
2010
143views Management» more  TNN 2010»
13 years 22 days ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
3DIM
2003
IEEE
13 years 11 months ago
Cramer-Rao Bounds for Nonparametric Surface Reconstruction from Range Data
The Cramer-Rao error bound provides a fundamental limit on the expected performance of a statistical estimator. The error bound depends on the general properties of the system, bu...
Tolga Tasdizen, Ross T. Whitaker
RC
2007
128views more  RC 2007»
13 years 5 months ago
Bounds on Generalized Linear Predictors with Incomplete Outcome Data
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
Jörg Stoye
COLT
2001
Springer
13 years 10 months ago
Geometric Bounds for Generalization in Boosting
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
Shie Mannor, Ron Meir