Multiply-Recursive Upper Bounds with Higman's Lemma.
Sylvain SchmitzPhilippe SchnoebelenPublished in: ICALP (2) (2011)
Keyphrases
- upper bound
- recursive algorithm
- lower bound
- upper and lower bounds
- lower and upper bounds
- worst case
- johnson lindenstrauss
- tight bounds
- sample size
- efficiently computable
- vc dimension
- generalization error
- error probability
- branch and bound algorithm
- branch and bound
- genetic algorithm
- tight upper and lower bounds
- neural network
- recursive functions
- datalog programs
- sample complexity
- machine learning