Sciweavers

7 search results - page 1 / 2
» Learning juntas
Sort
View
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
14 years 8 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
IJCNLP
2005
Springer
14 years 1 months ago
Two-Phase Biomedical Named Entity Recognition Using A Hybrid Method
Biomedical named entity recognition (NER) is a difficult problem in biomedical information processing due to the widespread ambiguity of terms out of context and extensive lexical ...
Seonho Kim, Juntae Yoon, Kyung-Mi Park, Hae-Chang ...
COLT
2006
Springer
13 years 11 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
FOCS
2006
IEEE
14 years 1 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
ECCC
2010
124views more  ECCC 2010»
13 years 7 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio