180 search results - page 9 / 36 » Improved bounds on the sample complexity of learning |
DCG
2008
13 years 7 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
ML
2002
ACM
13 years 7 months ago
2002
ACM
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
TNN
2010
13 years 2 months ago
2010
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...
NIPS
2004
13 years 9 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...