On the learnability of shuffle ideals.
Dana AngluinJames AspnesSarah EisenstatAryeh KontorovichPublished in: J. Mach. Learn. Res. (2013)
Keyphrases
- uniform distribution
- pac learning
- finite automata
- regular languages
- partial order
- boolean functions
- agnostic learning
- pattern languages
- pac learnable
- pac learnability
- membership queries
- learning algorithm
- inductive logic programming
- pac model
- decision lists
- dnf formulas
- partially ordered
- real valued functions
- vapnik chervonenkis dimension
- limit from positive data
- grammatical inference
- monotone dnf formulas
- uniform convergence
- positive data
- concept class
- target concept
- sample complexity
- inductive inference
- sample size
- sufficient conditions
- support vector machine
- support vector