Sciweavers

263 search results - page 13 / 53
» Splitting of Learnable Classes
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 7 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
IANDC
2006
102views more  IANDC 2006»
13 years 7 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
CORR
2006
Springer
74views Education» more  CORR 2006»
13 years 7 months ago
PAC Classification based on PAC Estimates of Label Class Distributions
A standard approach in pattern classification is to estimate the distributions of the label classes, and then to apply the Bayes classifier to the estimates of the distributions in...
Nick Palmer, Paul W. Goldberg
ALT
2002
Springer
14 years 4 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
ICGI
2010
Springer
13 years 6 months ago
Grammatical Inference as Class Discrimination
Abstract. Grammatical inference is typically defined as the task of finding a compact representation of a language given a subset of sample sequences from that language. Many di...
Menno van Zaanen, Tanja Gaustad