Average-Case Lower Bounds for Noisy Boolean Decision Trees.
William S. EvansNicholas PippengerPublished in: SIAM J. Comput. (1998)
Keyphrases
- average case
- lower bound
- decision trees
- worst case
- vc dimension
- average case complexity
- upper bound
- online algorithms
- worst case analysis
- uniform distribution
- boolean functions
- learning curves
- sample complexity
- np hard
- competitive ratio
- real valued
- branch and bound
- objective function
- sample size
- training data
- concept classes
- machine learning algorithms
- optimal solution
- machine learning
- noisy data
- pac learning
- concept class
- small number
- upper and lower bounds