Sciweavers

1427 search results - page 20 / 286
» Learning with Annotation Noise
Sort
View
ML
2008
ACM
174views Machine Learning» more  ML 2008»
14 years 9 months ago
ALLPAD: approximate learning of logic programs with annotated disjunctions
In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). ALLPAD modifies the previous system LLPAD in order to tackle real world ...
Fabrizio Riguzzi
66
Voted
ICML
2008
IEEE
15 years 10 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
COLT
1999
Springer
15 years 1 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
73
Voted
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
15 years 10 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
IPL
2011
131views more  IPL 2011»
14 years 4 months ago
The regularized least squares algorithm and the problem of learning halfspaces
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
Ha Quang Minh