180 search results - page 23 / 36 » Improved bounds on the sample complexity of learning |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
BMCBI
2008
13 years 6 months ago
2008
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
NIPS
2007
13 years 9 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
JCSS
2008
13 years 7 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...