A formal proof of PAC learnability for decision stumps.
Joseph TassarottiKoundinya VajjhaAnindya BanerjeeJean-Baptiste TristanPublished in: CPP (2021)
Keyphrases
- pac learnability
- formal proof
- decision stumps
- sample complexity
- learning algorithm
- decision forest
- selection algorithm
- theorem prover
- pac learning
- ensemble learning
- kernel machines
- vc dimension
- ensemble classifier
- definite clause
- theoretical analysis
- decision trees
- weak classifiers
- support vector machine
- base classifiers
- learning theory
- special case
- feature selection