A formal proof of PAC learnability for decision stumps

Joseph Tassarotti, Koundinya Vajjha, Anindya Banerjee 0001, Jean-Baptiste Tristan. A formal proof of PAC learnability for decision stumps. In Catalin Hritcu, Andrei Popescu 0001, editors, CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, Virtual Event, Denmark, January 17-19, 2021. pages 5-17, ACM, 2021. [doi]

Abstract

Abstract is missing.