Improved bounds for the randomized decision tree complexity of recursive majority.
Frédéric MagniezAshwin NayakMiklos SanthaJonah ShermanGábor TardosDavid XiaoPublished in: CoRR (2013)
Keyphrases
- decision trees
- worst case
- lower bound
- upper bound
- computational complexity
- decision tree induction
- randomized algorithms
- space complexity
- computational cost
- predictive accuracy
- error tolerance
- neural network
- complexity bounds
- decision forest
- average case
- learning theory
- decision problems
- search algorithm
- bayesian networks