A Formal Proof of PAC Learnability for Decision Stumps.
Joseph TassarottiJean-Baptiste TristanKoundinya VajjhaPublished in: CoRR (2019)
Keyphrases
- formal proof
- pac learnability
- decision stumps
- sample complexity
- pac learning
- selection algorithm
- learning algorithm
- theorem prover
- decision forest
- kernel machines
- ensemble learning
- ensemble classifier
- weak classifiers
- vc dimension
- definite clause
- decision trees
- support vector machine
- special case
- data sets
- high dimensional
- base classifiers
- upper bound