Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability

We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t where t is the number of trials. The lower bound for the mistake probability is [HLW94] Ω 1 t , so our algorithm is almost optimal. 1

• Type: Conference
• Year: 2004
• Where: COLT
• Authors: Nader H. Bshouty
• Keywords: COLT 2004, Mistake Probability, Prediction Strategy, first Polynomial Time