Sciweavers

1435 search results - page 18 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
JMLR
2002
75views more  JMLR 2002»
13 years 8 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
ML
2010
ACM
163views Machine Learning» more  ML 2010»
13 years 3 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi
DAGSTUHL
2008
13 years 10 months ago
Distributed Bounded-Error Parameter and State Estimation in Networks of Sensors
This paper presents distributed bounded-error parameter and state estimation algorithms suited to measurement processing by a network of sensors. Contrary to centralized estimation...
Michel Kieffer
JMLR
2008
89views more  JMLR 2008»
13 years 8 months ago
An Error Bound Based on a Worst Likely Assignment
This paper introduces a new PAC transductive error bound for classification. The method uses information from the training examples and inputs of working examples to develop a set...
Eric Bax, Augusto Callejas
MOC
2002
118views more  MOC 2002»
13 years 8 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang