Sciweavers

176 search results - page 1 / 36
» The complexity of properly learning simple concept classes
Sort
View
20
Voted
JCSS
2008
70views more  JCSS 2008»
13 years 11 months ago
The complexity of properly learning simple concept classes
Michael Alekhnovich, Mark Braverman, Vitaly Feldma...
ECCC
2002
74views more  ECCC 2002»
13 years 11 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
ALT
2002
Springer
14 years 8 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
ICML
1999
IEEE
14 years 12 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 8 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...