On the Learnability of Shuffle Ideals.
Dana AngluinJames AspnesAryeh KontorovichPublished in: ALT (2012)
Keyphrases
- uniform distribution
- boolean functions
- pac learning
- regular languages
- finite automata
- uniform convergence
- learning algorithm
- partial order
- pac learnable
- vapnik chervonenkis dimension
- inductive inference
- pattern languages
- agnostic learning
- partially ordered
- membership queries
- dnf formulas
- pac model
- grammatical inference
- search engine
- data sets
- monotone dnf formulas
- computational learning theory
- concept classes
- sufficient conditions
- neural network